let X be non empty set ; for Y, p being set
for F being SetSequence of [:X,Y:]
for Fx being SetSequence of X st ( for n being Nat holds Fx . n = Y-section ((F . n),p) ) holds
Y-section ((meet (rng F)),p) = meet (rng Fx)
let Y, p be set ; for F being SetSequence of [:X,Y:]
for Fx being SetSequence of X st ( for n being Nat holds Fx . n = Y-section ((F . n),p) ) holds
Y-section ((meet (rng F)),p) = meet (rng Fx)
let F be SetSequence of [:X,Y:]; for Fx being SetSequence of X st ( for n being Nat holds Fx . n = Y-section ((F . n),p) ) holds
Y-section ((meet (rng F)),p) = meet (rng Fx)
let Fx be SetSequence of X; ( ( for n being Nat holds Fx . n = Y-section ((F . n),p) ) implies Y-section ((meet (rng F)),p) = meet (rng Fx) )
assume A2:
for n being Nat holds Fx . n = Y-section ((F . n),p)
; Y-section ((meet (rng F)),p) = meet (rng Fx)
then A7:
Y-section ((meet (rng F)),p) c= meet (rng Fx)
;
then
meet (rng Fx) c= Y-section ((meet (rng F)),p)
;
hence
Y-section ((meet (rng F)),p) = meet (rng Fx)
by A7; verum