%  problem-set/algebra/category.theory/p1.ver2.clauses
%  created : 07/10/89
%  revised : 07/19/89

% description: 
%
% Theorem 1: If xy is a monomorphism, then x is. 
% [Notice order of composition: xy indicates y(x()) ].

% representation:
%
% declare_predicate(2,=).
% declare_function(2,star).
% declare_functions(1,[dom,cod]). 
%
% x = y : usual classical equality
% star(x,y) : x composed with y
% dom(x) : the object which is the domain of x
% cod(x) : the object which is the codomain of x 


% equality axiom
(all x (x = x)).

% category theory axioms
(all x (cod(dom(x)) = dom(x))).
(all x (dom(cod(x)) = cod(x))).
(all x (star(dom(x),x) = x)).
(all x (star(x,cod(x)) = x)).
(all x all y ((cod(x) = dom(y)) -> (dom(star(x,y)) = dom(x)))).
(all x all y ((cod(x) = dom(y)) -> (cod(star(x,y)) = cod(y)))).
(all x all y all z (((cod(x) = dom(y)) & (cod(y) = dom(z))) -> 
	(star(x,star(y,z)) = star(star(x,y),z)))).

% hypothesis of denial

(all x all y all z ((cod(x) != dom(star(a,b))) | (star(x,star(a,b)) != y) | 
	(cod(z) != dom(star(a,b))) | (star(z,star(a,b)) != y) | (x = z))).

% denial of Theorem 1

(cod(a) = dom(b)).
(cod(a) = dom(h)).
(cod(a) = dom(g)).
(star(a,h) = star(a,g)).
(h != g).