let S be complete LATTICE; :: thesis: for T being continuous complete LATTICE
for g being infs-preserving Function of S,T st LowerAdj g is waybelow-preserving holds
g is directed-sups-preserving
let T be continuous complete LATTICE; :: thesis: for g being infs-preserving Function of S,T st LowerAdj g is waybelow-preserving holds
g is directed-sups-preserving
let g be infs-preserving Function of S,T; :: thesis: ( LowerAdj g is waybelow-preserving implies g is directed-sups-preserving )
assume A1:
for t, t' being Element of T st t << t' holds
(LowerAdj g) . t << (LowerAdj g) . t'
; :: according to WAYBEL34:def 8 :: thesis: g is directed-sups-preserving
let D be Subset of S; :: according to WAYBEL_0:def 37 :: thesis: ( D is empty or not D is directed or g preserves_sup_of D )
assume A2:
( not D is empty & D is directed )
; :: thesis: g preserves_sup_of D
assume
ex_sup_of D,S
; :: according to WAYBEL_0:def 31 :: thesis: ( ex_sup_of g .: D,T & "\/" (g .: D),T = g . ("\/" D,S) )
thus
ex_sup_of g .: D,T
by YELLOW_0:17; :: thesis: "\/" (g .: D),T = g . ("\/" D,S)
A3:
sup (g .: D) <= g . (sup D)
by WAYBEL17:15;
A4:
g . (sup D) = sup (waybelow (g . (sup D)))
by WAYBEL_3:def 5;
waybelow (g . (sup D)) is_<=_than sup (g .: D)
then
g . (sup D) <= sup (g .: D)
by A4, YELLOW_0:32;
hence
"\/" (g .: D),T = g . ("\/" D,S)
by A3, ORDERS_2:25; :: thesis: verum