let P1, P2 be RelStr ; ( RelStr(# the carrier of P1, the InternalRel of P1 #) = RelStr(# the carrier of P2, the InternalRel of P2 #) & P1 is complete implies P2 is complete )
assume that
A1:
RelStr(# the carrier of P1, the InternalRel of P1 #) = RelStr(# the carrier of P2, the InternalRel of P2 #)
and
A2:
for X being set ex a being Element of P1 st
( X is_<=_than a & ( for b being Element of P1 st X is_<=_than b holds
a <= b ) )
; LATTICE3:def 12 P2 is complete
let X be set ; LATTICE3:def 12 ex b1 being Element of the carrier of P2 st
( X is_<=_than b1 & ( for b2 being Element of the carrier of P2 holds
( not X is_<=_than b2 or b1 <= b2 ) ) )
consider a being Element of P1 such that
A3:
X is_<=_than a
and
A4:
for b being Element of P1 st X is_<=_than b holds
a <= b
by A2;
reconsider a9 = a as Element of P2 by A1;
take
a9
; ( X is_<=_than a9 & ( for b1 being Element of the carrier of P2 holds
( not X is_<=_than b1 or a9 <= b1 ) ) )
thus
X is_<=_than a9
by A1, A3, Th2; for b1 being Element of the carrier of P2 holds
( not X is_<=_than b1 or a9 <= b1 )
let b9 be Element of P2; ( not X is_<=_than b9 or a9 <= b9 )
reconsider b = b9 as Element of P1 by A1;
assume
X is_<=_than b9
; a9 <= b9
then
a <= b
by A1, A4, Th2;
hence
a9 <= b9
by A1, Th1; verum