let X be set ; :: thesis: ( 3 c= card X iff ex x, y, z being set st
( x in X & y in X & z in X & x <> y & x <> z & y <> z ) )
thus
( 3 c= card X implies ex x, y, z being set st
( x in X & y in X & z in X & x <> y & x <> z & y <> z ) )
:: thesis: ( ex x, y, z being set st
( x in X & y in X & z in X & x <> y & x <> z & y <> z ) implies 3 c= card X )proof
assume
3
c= card X
;
:: thesis: ex x, y, z being set st
( x in X & y in X & z in X & x <> y & x <> z & y <> z )
then
card 3
c= card X
by CARD_1:def 5;
then consider f being
Function such that A1:
(
f is
one-to-one &
dom f = 3 &
rng f c= X )
by CARD_1:26;
take x =
f . 0 ;
:: thesis: ex y, z being set st
( x in X & y in X & z in X & x <> y & x <> z & y <> z )
take y =
f . 1;
:: thesis: ex z being set st
( x in X & y in X & z in X & x <> y & x <> z & y <> z )
take z =
f . 2;
:: thesis: ( x in X & y in X & z in X & x <> y & x <> z & y <> z )
A2:
(
0 in dom f & 1
in dom f & 2
in dom f )
by A1, ENUMSET1:def 1, YELLOW11:1;
then
f . 0 in rng f
by FUNCT_1:def 5;
hence
x in X
by A1;
:: thesis: ( y in X & z in X & x <> y & x <> z & y <> z )
f . 1
in rng f
by A2, FUNCT_1:def 5;
hence
y in X
by A1;
:: thesis: ( z in X & x <> y & x <> z & y <> z )
f . 2
in rng f
by A2, FUNCT_1:def 5;
hence
z in X
by A1;
:: thesis: ( x <> y & x <> z & y <> z )
thus
x <> y
by A1, A2, FUNCT_1:def 8;
:: thesis: ( x <> z & y <> z )
thus
x <> z
by A1, A2, FUNCT_1:def 8;
:: thesis: y <> z
thus
y <> z
by A1, A2, FUNCT_1:def 8;
:: thesis: verum
end;
given x, y, z being set such that A3:
( x in X & y in X & z in X & x <> y & x <> z & y <> z )
; :: thesis: 3 c= card X
{x,y,z} c= X
then
card {x,y,z} c= card X
by CARD_1:27;
hence
3 c= card X
by A3, CARD_2:77; :: thesis: verum