let K, L be non empty ComplLattStr ; :: thesis: ( ComplLattStr(# the carrier of K,the L_join of K,the Compl of K #) = ComplLattStr(# the carrier of L,the L_join of L,the Compl of L #) & K is with_Top implies L is with_Top )
assume A1:
( ComplLattStr(# the carrier of K,the L_join of K,the Compl of K #) = ComplLattStr(# the carrier of L,the L_join of L,the Compl of L #) & K is with_Top )
; :: thesis: L is with_Top
for x, y being Element of L holds x |_| (x ` ) = y |_| (y ` )
hence
L is with_Top
by Def7; :: thesis: verum