let S, T be non empty lower-bounded Poset; :: thesis: ( [:S,T:] is algebraic implies ( S is algebraic & T is algebraic ) )
assume that
A1:
for x being Element of [:S,T:] holds
( not compactbelow x is empty & compactbelow x is directed )
and
A2:
( [:S,T:] is up-complete & [:S,T:] is satisfying_axiom_K )
; :: according to WAYBEL_8:def 4 :: thesis: ( S is algebraic & T is algebraic )
A3:
( S is up-complete & T is up-complete )
by A2, WAYBEL_2:11;
hereby :: according to WAYBEL_8:def 4 :: thesis: T is algebraic
thus
S is
up-complete
by A2, WAYBEL_2:11;
:: thesis: S is satisfying_axiom_K thus
S is
satisfying_axiom_K
:: thesis: verumproof
let s be
Element of
S;
:: according to WAYBEL_8:def 3 :: thesis: s = "\/" (compactbelow s),S
consider t being
Element of
T;
( not
compactbelow [s,t] is
empty &
compactbelow [s,t] is
directed )
by A1;
then
ex_sup_of compactbelow [s,t],
[:S,T:]
by A2, WAYBEL_0:75;
then A6:
sup (compactbelow [s,t]) = [(sup (proj1 (compactbelow [s,t]))),(sup (proj2 (compactbelow [s,t])))]
by Th5;
thus s =
[s,t] `1
by MCART_1:7
.=
(sup (compactbelow [s,t])) `1
by A2, WAYBEL_8:def 3
.=
sup (proj1 (compactbelow [s,t]))
by A6, MCART_1:7
.=
sup (compactbelow ([s,t] `1 ))
by A3, Th52
.=
sup (compactbelow s)
by MCART_1:7
;
:: thesis: verum
end;
end;
thus
T is up-complete
by A2, WAYBEL_2:11; :: thesis: T is satisfying_axiom_K
let t be Element of T; :: according to WAYBEL_8:def 3 :: thesis: t = "\/" (compactbelow t),T
consider s being Element of S;
( not compactbelow [s,t] is empty & compactbelow [s,t] is directed )
by A1;
then
ex_sup_of compactbelow [s,t],[:S,T:]
by A2, WAYBEL_0:75;
then A9:
sup (compactbelow [s,t]) = [(sup (proj1 (compactbelow [s,t]))),(sup (proj2 (compactbelow [s,t])))]
by Th5;
thus t =
[s,t] `2
by MCART_1:7
.=
(sup (compactbelow [s,t])) `2
by A2, WAYBEL_8:def 3
.=
sup (proj2 (compactbelow [s,t]))
by A9, MCART_1:7
.=
sup (compactbelow ([s,t] `2 ))
by A3, Th53
.=
sup (compactbelow t)
by MCART_1:7
; :: thesis: verum