let A be non empty set ; :: thesis: ( A is c=-linear implies [:(union A),(union A):] = union { [:a,a:] where a is Element of A : a in A } )
assume A1:
A is c=-linear
; :: thesis: [:(union A),(union A):] = union { [:a,a:] where a is Element of A : a in A }
set X = { [:a,a:] where a is Element of A : a in A } ;
set Y = { [:a,b:] where a, b is Element of A : ( a in A & b in A ) } ;
{ [:a,a:] where a is Element of A : a in A } c= { [:a,b:] where a, b is Element of A : ( a in A & b in A ) }
then A3:
union { [:a,a:] where a is Element of A : a in A } c= union { [:a,b:] where a, b is Element of A : ( a in A & b in A ) }
by ZFMISC_1:95;
union { [:a,b:] where a, b is Element of A : ( a in A & b in A ) } c= union { [:a,a:] where a is Element of A : a in A }
proof
let Z be
set ;
:: according to TARSKI:def 3 :: thesis: ( not Z in union { [:a,b:] where a, b is Element of A : ( a in A & b in A ) } or Z in union { [:a,a:] where a is Element of A : a in A } )
assume
Z in union { [:a,b:] where a, b is Element of A : ( a in A & b in A ) }
;
:: thesis: Z in union { [:a,a:] where a is Element of A : a in A }
then consider z being
set such that A4:
(
Z in z &
z in { [:a,b:] where a, b is Element of A : ( a in A & b in A ) } )
by TARSKI:def 4;
consider a,
b being
Element of
A such that A5:
(
z = [:a,b:] &
a in A &
b in A )
by A4;
A6:
a,
b are_c=-comparable
by A1, ORDINAL1:def 9;
end;
then
union { [:a,a:] where a is Element of A : a in A } = union { [:a,b:] where a, b is Element of A : ( a in A & b in A ) }
by A3, XBOOLE_0:def 10;
hence
[:(union A),(union A):] = union { [:a,a:] where a is Element of A : a in A }
by Th2; :: thesis: verum