let X be non empty set ; :: thesis: 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 ; :: thesis: 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:]; :: thesis: 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; :: thesis: ( ( 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) ; :: thesis: Y-section ((meet (rng F)),p) = meet (rng Fx)
now :: thesis: for q being set st q in Y-section ((meet (rng F)),p) holds
q in meet (rng Fx)
let q be set ; :: thesis: ( q in Y-section ((meet (rng F)),p) implies q in meet (rng Fx) )
assume q in Y-section ((meet (rng F)),p) ; :: thesis: q in meet (rng Fx)
then consider y1 being Element of X such that
A3: ( q = y1 & [y1,p] in meet (rng F) ) ;
for T being set st T in rng Fx holds
q in T
proof
let T be set ; :: thesis: ( T in rng Fx implies q in T )
assume T in rng Fx ; :: thesis: q in T
then consider n being object such that
B1: ( n in dom Fx & T = Fx . n ) by FUNCT_1:def 3;
reconsider n = n as Element of NAT by B1;
dom F = NAT by FUNCT_2:def 1;
then F . n in rng F by FUNCT_1:3;
then [q,p] in F . n by A3, SETFAM_1:def 1;
then q in Y-section ((F . n),p) by A3;
hence q in T by B1, A2; :: thesis: verum
end;
hence q in meet (rng Fx) by SETFAM_1:def 1; :: thesis: verum
end;
then A7: Y-section ((meet (rng F)),p) c= meet (rng Fx) ;
now :: thesis: for q being set st q in meet (rng Fx) holds
q in Y-section ((meet (rng F)),p)
let q be set ; :: thesis: ( q in meet (rng Fx) implies q in Y-section ((meet (rng F)),p) )
assume B0: q in meet (rng Fx) ; :: thesis: q in Y-section ((meet (rng F)),p)
now :: thesis: for T being set st T in rng F holds
[q,p] in T
let T be set ; :: thesis: ( T in rng F implies [q,p] in T )
assume T in rng F ; :: thesis: [q,p] in T
then consider n being object such that
B2: ( n in dom F & T = F . n ) by FUNCT_1:def 3;
reconsider n = n as Nat by B2;
dom Fx = NAT by FUNCT_2:def 1;
then Fx . n in rng Fx by B2, FUNCT_1:3;
then q in Fx . n by B0, SETFAM_1:def 1;
then q in Y-section ((F . n),p) by A2;
then ex y being Element of X st
( q = y & [y,p] in F . n ) ;
hence [q,p] in T by B2; :: thesis: verum
end;
then [q,p] in meet (rng F) by SETFAM_1:def 1;
hence q in Y-section ((meet (rng F)),p) by B0; :: thesis: verum
end;
then meet (rng Fx) c= Y-section ((meet (rng F)),p) ;
hence Y-section ((meet (rng F)),p) = meet (rng Fx) by A7; :: thesis: verum