let L be 0_Lattice; :: thesis: for X, Y being Element of L holds
( X "\/" Y = Bottom L iff ( X = Bottom L & Y = Bottom L ) )

let X, Y be Element of L; :: thesis: ( X "\/" Y = Bottom L iff ( X = Bottom L & Y = Bottom L ) )
thus ( X "\/" Y = Bottom L implies ( X = Bottom L & Y = Bottom L ) ) :: thesis: ( X = Bottom L & Y = Bottom L implies X "\/" Y = Bottom L )
proof end;
thus ( X = Bottom L & Y = Bottom L implies X "\/" Y = Bottom L ) by LATTICES:39; :: thesis: verum