let L, M be non empty RelStr ; ( L,M are_isomorphic & L is complete implies M is complete )
assume that
A1:
L,M are_isomorphic
and
A2:
L is complete
; M is complete
let X be Subset of M; LATTICE5:def 2 ex b1 being Element of the carrier of M st
( b1 is_<=_than X & ( for b2 being Element of the carrier of M holds
( not b2 is_<=_than X or b2 <= b1 ) ) )
M,L are_isomorphic
by A1, WAYBEL_1:6;
then consider f being Function of M,L such that
A3:
f is isomorphic
;
reconsider fX = f .: X as Subset of L ;
consider fa being Element of L such that
A4:
fa is_<=_than fX
and
A5:
for fb being Element of L st fb is_<=_than fX holds
fb <= fa
by A2;
set a = (f ") . fa;
A6:
rng f = the carrier of L
by A3, WAYBEL_0:66;
then
(f ") . fa in dom f
by A3, FUNCT_1:32;
then reconsider a = (f ") . fa as Element of M ;
A7:
fa = f . a
by A3, A6, FUNCT_1:35;
take
a
; ( a is_<=_than X & ( for b1 being Element of the carrier of M holds
( not b1 is_<=_than X or b1 <= a ) ) )
A8:
dom f = the carrier of M
by FUNCT_2:def 1;
let b be Element of M; ( not b is_<=_than X or b <= a )
assume A10:
b is_<=_than X
; b <= a
reconsider fb = f . b as Element of L ;
fb is_<=_than fX
then
fb <= fa
by A5;
hence
b <= a
by A3, A7, WAYBEL_0:66; verum