let H be distributive complete LATTICE; :: thesis: for a being Element of H
for X being finite Subset of H holds sup ({a} "/\" X) = a "/\" (sup X)
let a be Element of H; :: thesis: for X being finite Subset of H holds sup ({a} "/\" X) = a "/\" (sup X)
let X be finite Subset of H; :: thesis: sup ({a} "/\" X) = a "/\" (sup X)
defpred S1[ set ] means ex A being Subset of H st
( A = $1 & a "/\" (sup A) = sup ({a} "/\" A) );
A1:
X is finite
;
A2:
S1[ {} ]
A4:
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 A5:
(
x in X &
B c= X )
and A6:
S1[
B]
;
:: thesis: S1[B \/ {x}]
consider A being
Subset of
H such that A7:
(
A = B &
a "/\" (sup A) = sup ({a} "/\" A) )
by A6;
reconsider x1 =
x as
Element of
H by A5;
(
B c= the
carrier of
H &
{x1} c= the
carrier of
H )
by A5, XBOOLE_1:1;
then reconsider C =
B \/ {x} as
Subset of
H by XBOOLE_1:8;
take
C
;
:: thesis: ( C = B \/ {x} & a "/\" (sup C) = sup ({a} "/\" C) )
thus
C = B \/ {x}
;
:: thesis: a "/\" (sup C) = sup ({a} "/\" C)
A8:
(
ex_sup_of {a} "/\" A,
H &
ex_sup_of {(a "/\" x1)},
H )
by YELLOW_0:17;
A9:
{a} "/\" C =
({a} "/\" A) \/ ({a} "/\" {x1})
by A7, YELLOW_4:43
.=
({a} "/\" A) \/ {(a "/\" x1)}
by YELLOW_4:46
;
(
ex_sup_of B,
H &
ex_sup_of {x},
H )
by YELLOW_0:17;
hence a "/\" (sup C) =
a "/\" (("\/" B,H) "\/" ("\/" {x},H))
by YELLOW_2:3
.=
(sup ({a} "/\" A)) "\/" (a "/\" ("\/" {x},H))
by A7, WAYBEL_1:def 3
.=
(sup ({a} "/\" A)) "\/" (a "/\" x1)
by YELLOW_0:39
.=
(sup ({a} "/\" A)) "\/" (sup {(a "/\" x1)})
by YELLOW_0:39
.=
sup ({a} "/\" C)
by A8, A9, YELLOW_2:3
;
:: thesis: verum
end;
S1[X]
from FINSET_1:sch 2(A1, A2, A4);
hence
sup ({a} "/\" X) = a "/\" (sup X)
; :: thesis: verum