let V be non empty set ; :: thesis: for a being Object of (Ens V) st V <> {{} } & a is terminal holds
ex x being set st a = {x}
let a be Object of (Ens V); :: thesis: ( V <> {{} } & a is terminal implies ex x being set st a = {x} )
assume that
A1:
V <> {{} }
and
A2:
a is terminal
; :: thesis: ex x being set st a = {x}
consider x being Element of @ a;
now assume
a <> {x}
;
:: thesis: contradictionthen consider y being
set such that A7:
y in @ a
and A8:
y <> x
by A3, ZFMISC_1:41;
reconsider fx =
(@ a) --> x as
Function of
(@ a),
(@ a) by A7, FUNCOP_1:57;
reconsider fy =
(@ a) --> y as
Function of
(@ a),
(@ a) by A7, FUNCOP_1:57;
A9:
(
[[(@ a),(@ a)],fx] in Maps (@ a),
(@ a) &
[[(@ a),(@ a)],fy] in Maps (@ a),
(@ a) )
by Th15;
Maps (@ a),
(@ a) c= Maps V
by Th17;
then reconsider m1 =
[[(@ a),(@ a)],fx],
m2 =
[[(@ a),(@ a)],fy] as
Element of
Maps V by A9;
(
m1 in Hom a,
a &
m2 in Hom a,
a )
by A9, Th27;
then reconsider f =
@ m1,
g =
@ m2 as
Morphism of
a,
a by CAT_1:def 7;
consider h being
Morphism of
a,
a such that A10:
for
h' being
Morphism of
a,
a holds
h = h'
by A2, CAT_1:def 15;
hence
contradiction
by ZFMISC_1:33;
:: thesis: verum end;
hence
ex x being set st a = {x}
; :: thesis: verum