let H be distributive complete LATTICE; :: thesis: for a being Element of H
for X being finite Subset of H holds inf ({a} "\/" X) = a "\/" (inf X)

let a be Element of H; :: thesis: for X being finite Subset of H holds inf ({a} "\/" X) = a "\/" (inf X)
let X be finite Subset of H; :: thesis: inf ({a} "\/" X) = a "\/" (inf X)
defpred S1[ set ] means ex A being Subset of H st
( A = \$1 & a "\/" (inf A) = inf ({a} "\/" A) );
A1: S1[ {} ]
proof
reconsider A = {} as Subset of H by XBOOLE_1:2;
take A ; :: thesis: ( A = {} & a "\/" (inf A) = inf ({a} "\/" A) )
thus A = {} ; :: thesis: a "\/" (inf A) = inf ({a} "\/" A)
( a <= Top H & {a} "\/" ({} H) = {} ) by ;
hence a "\/" (inf A) = inf ({a} "\/" A) by YELLOW_0:24; :: thesis: verum
end;
A2: for x, B being set st x in X & B c= X & S1[B] holds
S1[B \/ {x}]
proof
let x, B be set ; :: thesis: ( x in X & B c= X & S1[B] implies S1[B \/ {x}] )
assume that
A3: x in X and
A4: B c= X and
A5: S1[B] ; :: thesis: S1[B \/ {x}]
reconsider x1 = x as Element of H by A3;
A6: {x1} c= the carrier of H ;
B c= the carrier of H by ;
then reconsider C = B \/ {x} as Subset of H by ;
take C ; :: thesis: ( C = B \/ {x} & a "\/" (inf C) = inf ({a} "\/" C) )
thus C = B \/ {x} ; :: thesis: a "\/" (inf C) = inf ({a} "\/" C)
consider A being Subset of H such that
A7: A = B and
A8: a "\/" (inf A) = inf ({a} "\/" A) by A5;
A9: {a} "\/" C = ({a} "\/" A) \/ ({a} "\/" {x1}) by
.= ({a} "\/" A) \/ {(a "\/" x1)} by YELLOW_4:19 ;
A10: ( ex_inf_of {a} "\/" A,H & ex_inf_of {(a "\/" x1)},H ) by YELLOW_0:17;
( ex_inf_of B,H & ex_inf_of {x},H ) by YELLOW_0:17;
hence a "\/" (inf C) = a "\/" (("/\" (B,H)) "/\" ("/\" ({x},H))) by YELLOW_2:4
.= (inf ({a} "\/" A)) "/\" (a "\/" ("/\" ({x},H))) by
.= (inf ({a} "\/" A)) "/\" (a "\/" x1) by YELLOW_0:39
.= (inf ({a} "\/" A)) "/\" (inf {(a "\/" x1)}) by YELLOW_0:39
.= inf ({a} "\/" C) by ;
:: thesis: verum
end;
A11: X is finite ;
S1[X] from FINSET_1:sch 2(A11, A1, A2);
hence inf ({a} "\/" X) = a "\/" (inf X) ; :: thesis: verum