let S, T be non empty reflexive antisymmetric up-complete RelStr ; :: thesis: for X being Subset of [:S,T:] st X is property(S) holds
( proj1 X is property(S) & proj2 X is property(S) )
let X be Subset of [:S,T:]; :: thesis: ( X is property(S) implies ( proj1 X is property(S) & proj2 X is property(S) ) )
assume A1:
for D being non empty directed Subset of [:S,T:] st sup D in X holds
ex y being Element of [:S,T:] st
( y in D & ( for x being Element of [:S,T:] st x in D & x >= y holds
x in X ) )
; :: according to WAYBEL11:def 3 :: thesis: ( proj1 X is property(S) & proj2 X is property(S) )
A2:
the carrier of [:S,T:] = [:the carrier of S,the carrier of T:]
by YELLOW_3:def 2;
hereby :: according to WAYBEL11:def 3 :: thesis: proj2 X is property(S)
let D be non
empty directed Subset of
S;
:: thesis: ( sup D in proj1 X implies ex z being M2(the carrier of S) st
( z in D & ( for x being Element of S st x in D & x >= z holds
x in proj1 X ) ) )assume
sup D in proj1 X
;
:: thesis: ex z being M2(the carrier of S) st
( z in D & ( for x being Element of S st x in D & x >= z holds
x in proj1 X ) )then consider t being
set such that A3:
[(sup D),t] in X
by RELAT_1:def 4;
reconsider t =
t as
Element of
T by A2, A3, ZFMISC_1:106;
reconsider t' =
{t} as non
empty directed Subset of
T by WAYBEL_0:5;
ex_sup_of [:D,t':],
[:S,T:]
by WAYBEL_0:75;
then sup [:D,t':] =
[(sup (proj1 [:D,t':])),(sup (proj2 [:D,t':]))]
by YELLOW_3:46
.=
[(sup D),(sup (proj2 [:D,t':]))]
by FUNCT_5:11
.=
[(sup D),(sup t')]
by FUNCT_5:11
.=
[(sup D),t]
by YELLOW_0:39
;
then consider y being
Element of
[:S,T:] such that A4:
y in [:D,t':]
and A5:
for
x being
Element of
[:S,T:] st
x in [:D,t':] &
x >= y holds
x in X
by A1, A3;
take z =
y `1 ;
:: thesis: ( z in D & ( for x being Element of S st x in D & x >= z holds
x in proj1 X ) )A6:
y = [(y `1 ),(y `2 )]
by A2, MCART_1:23;
hence
z in D
by A4, ZFMISC_1:106;
:: thesis: for x being Element of S st x in D & x >= z holds
x in proj1 Xlet x be
Element of
S;
:: thesis: ( x in D & x >= z implies x in proj1 X )assume
x in D
;
:: thesis: ( x >= z implies x in proj1 X )then A7:
[x,t] in [:D,t':]
by ZFMISC_1:129;
assume A8:
x >= z
;
:: thesis: x in proj1 XA9:
y `2 = t
by A4, A6, ZFMISC_1:129;
y `2 <= y `2
;
then
[x,t] >= y
by A6, A8, A9, YELLOW_3:11;
then
[x,t] in X
by A5, A7;
hence
x in proj1 X
by FUNCT_5:4;
:: thesis: verum
end;
let D be non empty directed Subset of T; :: according to WAYBEL11:def 3 :: thesis: ( not "\/" D,T in proj2 X or ex b1 being M2(the carrier of T) st
( b1 in D & ( for b2 being M2(the carrier of T) holds
( not b2 in D or not b1 <= b2 or b2 in proj2 X ) ) ) )
assume
sup D in proj2 X
; :: thesis: ex b1 being M2(the carrier of T) st
( b1 in D & ( for b2 being M2(the carrier of T) holds
( not b2 in D or not b1 <= b2 or b2 in proj2 X ) ) )
then consider s being set such that
A10:
[s,(sup D)] in X
by RELAT_1:def 5;
reconsider s = s as Element of S by A2, A10, ZFMISC_1:106;
reconsider s' = {s} as non empty directed Subset of S by WAYBEL_0:5;
ex_sup_of [:s',D:],[:S,T:]
by WAYBEL_0:75;
then sup [:s',D:] =
[(sup (proj1 [:s',D:])),(sup (proj2 [:s',D:]))]
by YELLOW_3:46
.=
[(sup s'),(sup (proj2 [:s',D:]))]
by FUNCT_5:11
.=
[(sup s'),(sup D)]
by FUNCT_5:11
.=
[s,(sup D)]
by YELLOW_0:39
;
then consider y being Element of [:S,T:] such that
A11:
y in [:s',D:]
and
A12:
for x being Element of [:S,T:] st x in [:s',D:] & x >= y holds
x in X
by A1, A10;
take z = y `2 ; :: thesis: ( z in D & ( for b1 being M2(the carrier of T) holds
( not b1 in D or not z <= b1 or b1 in proj2 X ) ) )
A13:
y = [(y `1 ),(y `2 )]
by A2, MCART_1:23;
hence
z in D
by A11, ZFMISC_1:106; :: thesis: for b1 being M2(the carrier of T) holds
( not b1 in D or not z <= b1 or b1 in proj2 X )
let x be Element of T; :: thesis: ( not x in D or not z <= x or x in proj2 X )
assume
x in D
; :: thesis: ( not z <= x or x in proj2 X )
then A14:
[s,x] in [:s',D:]
by ZFMISC_1:128;
assume A15:
x >= z
; :: thesis: x in proj2 X
A16:
y `1 = s
by A11, A13, ZFMISC_1:128;
y `1 <= y `1
;
then
[s,x] >= y
by A13, A15, A16, YELLOW_3:11;
then
[s,x] in X
by A12, A14;
hence
x in proj2 X
by FUNCT_5:4; :: thesis: verum