let L be Lattice; :: thesis: ( L is C_Lattice iff L .: is C_Lattice )
A1: ( L is upper-bounded iff L .: is lower-bounded ) by LATTICE2:49;
A2: ( L is lower-bounded iff L .: is upper-bounded ) by LATTICE2:48;
thus ( L is C_Lattice implies L .: is C_Lattice ) :: thesis: ( L .: is C_Lattice implies L is C_Lattice )
proof
assume A3: L is C_Lattice ; :: thesis: L .: is C_Lattice
now :: thesis: for p9 being Element of (L .:) ex r being Element of (L .:) st r is_a_complement_of p9end;
hence L .: is C_Lattice by A2, A1, A3, LATTICES:def 19; :: thesis: verum
end;
assume A7: L .: is C_Lattice ; :: thesis: L is C_Lattice
now :: thesis: for p being Element of L ex r being Element of L st r is_a_complement_of pend;
hence L is C_Lattice by A2, A1, A7, LATTICES:def 19; :: thesis: verum