set L = lattice G;
B: lattice G = LattStr(# (Subgroups G),(SubJoin G),(SubMeet G) #) by GROUP_4:def 12;
I: now :: thesis: for a, b being Element of (lattice G)
for K1, K2 being SubGroup of G st K1 = a & K2 = b holds
K1 /\ K2 = a "/\" b
let a, b be Element of (lattice G); :: thesis: for K1, K2 being SubGroup of G st K1 = a & K2 = b holds
K1 /\ K2 = a "/\" b

let K1, K2 be SubGroup of G; :: thesis: ( K1 = a & K2 = b implies K1 /\ K2 = a "/\" b )
assume ( K1 = a & K2 = b ) ; :: thesis: K1 /\ K2 = a "/\" b
hence K1 /\ K2 = (SubMeet G) . (a,b) by GROUP_4:def 11
.= a "/\" b by B, LATTICES:def 2 ;
:: thesis: verum
end;
now :: thesis: for Y being Subset of (lattice G) ex a being Element of (lattice G) st
( a is_less_than Y & ( for b being Element of (lattice G) st b is_less_than Y holds
b [= a ) )
let Y be Subset of (lattice G); :: thesis: ex a being Element of (lattice G) st
( b2 is_less_than a & ( for b being Element of (lattice G) st b3 is_less_than a holds
b3 [= b ) )

per cases ( Y = {} or Y <> {} ) ;
suppose A1: Y = {} ; :: thesis: ex a being Element of (lattice G) st
( b2 is_less_than a & ( for b being Element of (lattice G) st b3 is_less_than a holds
b3 [= b ) )

thus ex a being Element of (lattice G) st
( a is_less_than Y & ( for b being Element of (lattice G) st b is_less_than Y holds
b [= a ) ) :: thesis: verum
proof
take Top (lattice G) ; :: thesis: ( Top (lattice G) is_less_than Y & ( for b being Element of (lattice G) st b is_less_than Y holds
b [= Top (lattice G) ) )

for a being Element of (lattice G) st a in Y holds
Top (lattice G) [= a by A1;
hence Top (lattice G) is_less_than Y by LATTICE3:def 16; :: thesis: for b being Element of (lattice G) st b is_less_than Y holds
b [= Top (lattice G)

let b be Element of (lattice G); :: thesis: ( b is_less_than Y implies b [= Top (lattice G) )
assume b is_less_than Y ; :: thesis: b [= Top (lattice G)
thus b [= Top (lattice G) by LATTICES:19; :: thesis: verum
end;
end;
suppose Y <> {} ; :: thesis: ex a being Element of (lattice G) st
( b2 is_less_than a & ( for b being Element of (lattice G) st b3 is_less_than a holds
b3 [= b ) )

then reconsider M = Y as non empty Subset of (Subgroups G) by B;
/\ M in Subgroups G by GROUP_3:def 1;
then reconsider K1 = /\ M as SubGroup of G by dSG;
reconsider a = K1 as Element of (lattice G) by B, GROUP_3:def 1;
thus ex a being Element of (lattice G) st
( a is_less_than Y & ( for b being Element of (lattice G) st b is_less_than Y holds
b [= a ) ) :: thesis: verum
proof
take a ; :: thesis: ( a is_less_than Y & ( for b being Element of (lattice G) st b is_less_than Y holds
b [= a ) )

now :: thesis: for q being Element of (lattice G) st q in Y holds
a [= q
let q be Element of (lattice G); :: thesis: ( q in Y implies a [= q )
assume q in Y ; :: thesis: a [= q
then reconsider K2 = q as Element of M ;
reconsider K2 = K2 as SubGroup of G by dSG, B;
/\ M is Subgroup of K2 by lemG8;
then K1 /\ K2 = K1 by GROUP_2:89;
then a "/\" q = a by I;
hence a [= q by LATTICES:4; :: thesis: verum
end;
hence a is_less_than Y by LATTICE3:def 16; :: thesis: for b being Element of (lattice G) st b is_less_than Y holds
b [= a

thus for b being Element of (lattice G) st b is_less_than Y holds
b [= a :: thesis: verum
proof
let b be Element of (lattice G); :: thesis: ( b is_less_than Y implies b [= a )
b is strict Subgroup of G by B, GROUP_3:def 1;
then reconsider Kb = b as SubGroup of G by B, dSG;
assume A2: b is_less_than Y ; :: thesis: b [= a
now :: thesis: for F being Element of M holds Kb is Subgroup of F
let F be Element of M; :: thesis: Kb is Subgroup of F
A3: ( F in M & M c= Subgroups G ) ;
then reconsider F1 = F as SubGroup of G by dSG;
reconsider c = F1 as Element of (lattice G) by A3;
b "/\" c = b by A2, LATTICE3:def 16, LATTICES:4;
then Kb /\ F1 = Kb by I;
hence Kb is Subgroup of F by GROUP_2:89; :: thesis: verum
end;
then Kb is Subgroup of K1 by lemG9;
then Kb /\ K1 = Kb by GROUP_2:89;
then b "/\" a = b by I;
hence b [= a by LATTICES:4; :: thesis: verum
end;
end;
end;
end;
end;
hence lattice G is complete by VECTSP_8:def 6; :: thesis: verum