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 end;
consider s being Element of S;
hereby :: according to WAYBEL_8:def 4 :: thesis: ( T is up-complete & T is satisfying_axiom_K ) 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
( 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 A7: 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 A7, MCART_1:7
.= sup (compactbelow ([s,t] `2 )) by A3, Th53
.= sup (compactbelow t) by MCART_1:7 ; :: thesis: verum