let S be non empty RelStr ; :: thesis: for T being complete LATTICE
for F being non empty Subset of (T |^ the carrier of S)
for i being Element of S holds (sup F) . i = "\/" { (f . i) where f is Element of (T |^ the carrier of S) : f in F } ,T
let T be complete LATTICE; :: thesis: for F being non empty Subset of (T |^ the carrier of S)
for i being Element of S holds (sup F) . i = "\/" { (f . i) where f is Element of (T |^ the carrier of S) : f in F } ,T
let F be non empty Subset of (T |^ the carrier of S); :: thesis: for i being Element of S holds (sup F) . i = "\/" { (f . i) where f is Element of (T |^ the carrier of S) : f in F } ,T
let i be Element of S; :: thesis: (sup F) . i = "\/" { (f . i) where f is Element of (T |^ the carrier of S) : f in F } ,T
reconsider SYT = the carrier of S --> T as RelStr-yielding non-Empty ManySortedSet of ;
reconsider SYT = SYT as RelStr-yielding non-Empty reflexive-yielding ManySortedSet of ;
A1:
T |^ the carrier of S = product SYT
by YELLOW_1:def 5;
reconsider X = F as Subset of (product SYT) by YELLOW_1:def 5;
A2:
pi X,i = { (f . i) where f is Element of (T |^ the carrier of S) : f in F }
for i being Element of S holds SYT . i is complete LATTICE
by FUNCOP_1:13;
then (sup F) . i =
"\/" (pi X,i),(SYT . i)
by A1, WAYBEL_3:32
.=
"\/" { (f . i) where f is Element of (T |^ the carrier of S) : f in F } ,T
by A2, FUNCOP_1:13
;
hence
(sup F) . i = "\/" { (f . i) where f is Element of (T |^ the carrier of S) : f in F } ,T
; :: thesis: verum