let S, T be non empty lower-bounded Poset; ( [: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 )
; WAYBEL_8:def 4 ( S is algebraic & T is algebraic )
A3:
( S is up-complete & T is up-complete )
by A2, WAYBEL_2:11;
hereby WAYBEL_8:def 4 T is algebraic
thus
S is
up-complete
by A2, WAYBEL_2:11;
S is satisfying_axiom_K thus
S is
satisfying_axiom_K
verumproof
set t = the
Element of
T;
let s be
Element of
S;
WAYBEL_8:def 3 s = "\/" ((compactbelow s),S)
( not
compactbelow [s, the Element of T] is
empty &
compactbelow [s, the Element of T] is
directed )
by A1;
then
ex_sup_of compactbelow [s, the Element of T],
[:S,T:]
by A2, WAYBEL_0:75;
then A5:
sup (compactbelow [s, the Element of T]) = [(sup (proj1 (compactbelow [s, the Element of T]))),(sup (proj2 (compactbelow [s, the Element of T])))]
by Th5;
thus s =
[s, the Element of T] `1
.=
(sup (compactbelow [s, the Element of T])) `1
by A2
.=
sup (proj1 (compactbelow [s, the Element of T]))
by A5
.=
sup (compactbelow ([s, the Element of T] `1))
by A3, Th52
.=
sup (compactbelow s)
;
verum
end;
end;
set s = the Element of S;
thus
T is up-complete
by A2, WAYBEL_2:11; T is satisfying_axiom_K
let t be Element of T; WAYBEL_8:def 3 t = "\/" ((compactbelow t),T)
( not compactbelow [ the Element of S,t] is empty & compactbelow [ the Element of S,t] is directed )
by A1;
then
ex_sup_of compactbelow [ the Element of S,t],[:S,T:]
by A2, WAYBEL_0:75;
then A7:
sup (compactbelow [ the Element of S,t]) = [(sup (proj1 (compactbelow [ the Element of S,t]))),(sup (proj2 (compactbelow [ the Element of S,t])))]
by Th5;
thus t =
[ the Element of S,t] `2
.=
(sup (compactbelow [ the Element of S,t])) `2
by A2
.=
sup (proj2 (compactbelow [ the Element of S,t]))
by A7
.=
sup (compactbelow ([ the Element of S,t] `2))
by A3, Th53
.=
sup (compactbelow t)
; verum