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