let x1, x2 be set ; for X being finite set st x1 <> x2 holds
card (Choose (X,0,x1,x2)) = 1
let X be finite set ; ( x1 <> x2 implies card (Choose (X,0,x1,x2)) = 1 )
assume A1:
x1 <> x2
; card (Choose (X,0,x1,x2)) = 1
per cases
( X is empty or not X is empty )
;
suppose A2:
X is
empty
;
card (Choose (X,0,x1,x2)) = 1A3:
rng {} = {}
;
dom {} = X
by A2;
then reconsider Empty =
{} as
Function of
X,
{x1,x2} by A3, FUNCT_2:2, XBOOLE_1:2;
A4:
Choose (
X,
0,
x1,
x2)
c= {Empty}
(
Empty " {x1} = {} &
card {} = 0 )
by FUNCT_1:72, RELAT_1:38;
then
Empty in Choose (
X,
0,
x1,
x2)
by Def1;
then
Choose (
X,
0,
x1,
x2)
= {Empty}
by A4, ZFMISC_1:33;
hence
card (Choose (X,0,x1,x2)) = 1
by CARD_1:30;
verum end; suppose A6:
not
X is
empty
;
card (Choose (X,0,x1,x2)) = 1then consider f being
Function such that A7:
dom f = X
and A8:
rng f = {x2}
by FUNCT_1:5;
rng f c= {x1,x2}
by A8, ZFMISC_1:36;
then A9:
f is
Function of
X,
{x1,x2}
by A7, FUNCT_2:2;
A10:
Choose (
X,
0,
x1,
x2)
c= {f}
proof
let z be
set ;
TARSKI:def 3 ( not z in Choose (X,0,x1,x2) or z in {f} )
assume
z in Choose (
X,
0,
x1,
x2)
;
z in {f}
then consider g being
Function of
X,
{x1,x2} such that A11:
z = g
and A12:
card (g " {x1}) = 0
by Def1;
g " {x1} = {}
by A12;
then
not
x1 in rng g
by FUNCT_1:72;
then
( not
rng g = {x1} & not
rng g = {x1,x2} )
by TARSKI:def 1, TARSKI:def 2;
then
(
dom g = X &
rng g = {x2} )
by A6, FUNCT_2:def 1, ZFMISC_1:36;
then
g = f
by A7, A8, FUNCT_1:7;
hence
z in {f}
by A11, TARSKI:def 1;
verum
end;
not
x1 in rng f
by A1, A8, TARSKI:def 1;
then A13:
f " {x1} = {}
by FUNCT_1:72;
card {} = 0
;
then
f in Choose (
X,
0,
x1,
x2)
by A13, A9, Def1;
then
Choose (
X,
0,
x1,
x2)
= {f}
by A10, ZFMISC_1:33;
hence
card (Choose (X,0,x1,x2)) = 1
by CARD_1:30;
verum end; end;