reserve L for Lattice,
  p,p1,q,q1,r,r1 for Element of L;
reserve x,y,z,X,Y,Z,X1,X2 for set;
reserve H,F for Filter of L;
reserve D for non empty Subset of L;
reserve D1,D2 for non empty Subset of L;
reserve I for I_Lattice,
  i,j,k for Element of I;
reserve B for B_Lattice,
  FB,HB for Filter of B;
reserve I for I_Lattice,
  i,j,k for Element of I,
  DI for non empty Subset of I,
  FI for Filter of I;
reserve F1,F2 for Filter of I;
reserve a,b,c for Element of B;
reserve o1,o2 for BinOp of F;

theorem
  for L being strict Lattice holds latt <.L.) = L
proof
  let L be strict Lattice;
  dom the L_meet of L = [:the carrier of L, the carrier of L:] by FUNCT_2:def 1
;
  then
A1: the L_meet of L = (the L_meet of L)||the carrier of L by RELAT_1:68;
  dom the L_join of L = [:the carrier of L, the carrier of L:] by FUNCT_2:def 1
;
  then the L_join of L = (the L_join of L)||the carrier of L by RELAT_1:68;
  hence thesis by A1,Def9;
end;
