set IT = Y |^ X;
let x, y be Element of (Y |^ X); :: according to LATTICE3:def 10 :: thesis: ex b1 being Element of the carrier of (Y |^ X) st
( x <= b1 & y <= b1 & ( for b2 being Element of the carrier of (Y |^ X) holds
( not x <= b2 or not y <= b2 or b1 <= b2 ) ) )
reconsider x' = x as Function of X,the carrier of Y by Lm5;
reconsider y' = y as Function of X,the carrier of Y by Lm5;
defpred S1[ set , set ] means ex xa, ya being Element of Y st
( xa = x' . X & ya = y' . X & Y = xa "\/" ya );
A1:
for x being set st x in X holds
ex y being set st
( y in the carrier of Y & S1[x,y] )
consider f being Function of X,the carrier of Y such that
A2:
for a being set st a in X holds
S1[a,f . a]
from FUNCT_2:sch 1(A1);
f in Funcs X,the carrier of Y
by FUNCT_2:11;
then reconsider z = f as Element of (Y |^ X) by Th28;
take
z
; :: thesis: ( x <= z & y <= z & ( for b1 being Element of the carrier of (Y |^ X) holds
( not x <= b1 or not y <= b1 or z <= b1 ) ) )
A3:
x <= z
proof
reconsider x1 =
x,
z1 =
z as
Element of
(product (X --> Y)) ;
x1 in the
carrier of
(product (X --> Y))
;
then A4:
x1 in product (Carrier (X --> Y))
by Def4;
ex
f,
g being
Function st
(
f = x1 &
g = z1 & ( for
i being
set st
i in X holds
ex
R being
RelStr ex
xi,
yi being
Element of
R st
(
R = (X --> Y) . i &
xi = f . i &
yi = g . i &
xi <= yi ) ) )
proof
take
x'
;
:: thesis: ex g being Function st
( x' = x1 & g = z1 & ( for i being set st i in X holds
ex R being RelStr ex xi, yi being Element of R st
( R = (X --> Y) . i & xi = x' . i & yi = g . i & xi <= yi ) ) )
take
f
;
:: thesis: ( x' = x1 & f = z1 & ( for i being set st i in X holds
ex R being RelStr ex xi, yi being Element of R st
( R = (X --> Y) . i & xi = x' . i & yi = f . i & xi <= yi ) ) )
thus
(
x' = x1 &
f = z1 )
;
:: thesis: for i being set st i in X holds
ex R being RelStr ex xi, yi being Element of R st
( R = (X --> Y) . i & xi = x' . i & yi = f . i & xi <= yi )
let i be
set ;
:: thesis: ( i in X implies ex R being RelStr ex xi, yi being Element of R st
( R = (X --> Y) . i & xi = x' . i & yi = f . i & xi <= yi ) )
assume
i in X
;
:: thesis: ex R being RelStr ex xi, yi being Element of R st
( R = (X --> Y) . i & xi = x' . i & yi = f . i & xi <= yi )
then reconsider i =
i as
Element of
X ;
reconsider R =
(X --> Y) . i as
RelStr ;
A5:
R = Y
by FUNCOP_1:13;
reconsider yi =
f . i,
xi =
x' . i as
Element of
R by FUNCOP_1:13;
take
R
;
:: thesis: ex xi, yi being Element of R st
( R = (X --> Y) . i & xi = x' . i & yi = f . i & xi <= yi )
take
xi
;
:: thesis: ex yi being Element of R st
( R = (X --> Y) . i & xi = x' . i & yi = f . i & xi <= yi )
take
yi
;
:: thesis: ( R = (X --> Y) . i & xi = x' . i & yi = f . i & xi <= yi )
consider xa,
ya being
Element of
Y such that A6:
(
xa = x' . i &
ya = y' . i &
f . i = xa "\/" ya )
by A2;
thus
(
R = (X --> Y) . i &
xi = x' . i &
yi = f . i &
xi <= yi )
by A5, A6, YELLOW_0:22;
:: thesis: verum
end;
hence
x <= z
by A4, Def4;
:: thesis: verum
end;
A7:
y <= z
proof
reconsider y1 =
y,
z1 =
z as
Element of
(product (X --> Y)) ;
y1 in the
carrier of
(product (X --> Y))
;
then A8:
y1 in product (Carrier (X --> Y))
by Def4;
ex
f,
g being
Function st
(
f = y1 &
g = z1 & ( for
i being
set st
i in X holds
ex
R being
RelStr ex
xi,
yi being
Element of
R st
(
R = (X --> Y) . i &
xi = f . i &
yi = g . i &
xi <= yi ) ) )
proof
take
y'
;
:: thesis: ex g being Function st
( y' = y1 & g = z1 & ( for i being set st i in X holds
ex R being RelStr ex xi, yi being Element of R st
( R = (X --> Y) . i & xi = y' . i & yi = g . i & xi <= yi ) ) )
take
f
;
:: thesis: ( y' = y1 & f = z1 & ( for i being set st i in X holds
ex R being RelStr ex xi, yi being Element of R st
( R = (X --> Y) . i & xi = y' . i & yi = f . i & xi <= yi ) ) )
thus
(
y' = y1 &
f = z1 )
;
:: thesis: for i being set st i in X holds
ex R being RelStr ex xi, yi being Element of R st
( R = (X --> Y) . i & xi = y' . i & yi = f . i & xi <= yi )
let i be
set ;
:: thesis: ( i in X implies ex R being RelStr ex xi, yi being Element of R st
( R = (X --> Y) . i & xi = y' . i & yi = f . i & xi <= yi ) )
assume
i in X
;
:: thesis: ex R being RelStr ex xi, yi being Element of R st
( R = (X --> Y) . i & xi = y' . i & yi = f . i & xi <= yi )
then reconsider i =
i as
Element of
X ;
reconsider R =
(X --> Y) . i as
RelStr ;
A9:
R = Y
by FUNCOP_1:13;
reconsider yi =
f . i,
xi =
y' . i as
Element of
R by FUNCOP_1:13;
take
R
;
:: thesis: ex xi, yi being Element of R st
( R = (X --> Y) . i & xi = y' . i & yi = f . i & xi <= yi )
take
xi
;
:: thesis: ex yi being Element of R st
( R = (X --> Y) . i & xi = y' . i & yi = f . i & xi <= yi )
take
yi
;
:: thesis: ( R = (X --> Y) . i & xi = y' . i & yi = f . i & xi <= yi )
consider xa,
ya being
Element of
Y such that A10:
(
xa = x' . i &
ya = y' . i &
f . i = xa "\/" ya )
by A2;
thus
(
R = (X --> Y) . i &
xi = y' . i &
yi = f . i &
xi <= yi )
by A9, A10, YELLOW_0:22;
:: thesis: verum
end;
hence
y <= z
by A8, Def4;
:: thesis: verum
end;
for z' being Element of (Y |^ X) st z' >= x & z' >= y holds
z' >= z
proof
let z' be
Element of
(Y |^ X);
:: thesis: ( z' >= x & z' >= y implies z' >= z )
assume A11:
(
z' >= x &
z' >= y )
;
:: thesis: z' >= z
z' >= z
proof
reconsider z2 =
z',
z3 =
z,
z4 =
y,
z5 =
x as
Element of
(product (X --> Y)) ;
reconsider K =
z3,
J =
z2 as
Function of
X,the
carrier of
Y by Lm5;
(
z5 in the
carrier of
(product (X --> Y)) &
z3 in the
carrier of
(product (X --> Y)) &
z4 in the
carrier of
(product (X --> Y)) )
;
then A12:
(
z5 in product (Carrier (X --> Y)) &
z3 in product (Carrier (X --> Y)) &
z4 in product (Carrier (X --> Y)) )
by Def4;
then consider f1,
g1 being
Function such that A13:
(
f1 = z5 &
g1 = z2 & ( for
i being
set st
i in X holds
ex
R being
RelStr ex
xi,
yi being
Element of
R st
(
R = (X --> Y) . i &
xi = f1 . i &
yi = g1 . i &
xi <= yi ) ) )
by A11, Def4;
consider f2,
g2 being
Function such that A14:
(
f2 = z4 &
g2 = z2 & ( for
i being
set st
i in X holds
ex
R being
RelStr ex
xi,
yi being
Element of
R st
(
R = (X --> Y) . i &
xi = f2 . i &
yi = g2 . i &
xi <= yi ) ) )
by A11, A12, Def4;
ex
f,
g being
Function st
(
f = z3 &
g = z2 & ( for
i being
set st
i in X holds
ex
R being
RelStr ex
xi,
yi being
Element of
R st
(
R = (X --> Y) . i &
xi = f . i &
yi = g . i &
xi <= yi ) ) )
proof
take
K
;
:: thesis: ex g being Function st
( K = z3 & g = z2 & ( for i being set st i in X holds
ex R being RelStr ex xi, yi being Element of R st
( R = (X --> Y) . i & xi = K . i & yi = g . i & xi <= yi ) ) )
take
J
;
:: thesis: ( K = z3 & J = z2 & ( for i being set st i in X holds
ex R being RelStr ex xi, yi being Element of R st
( R = (X --> Y) . i & xi = K . i & yi = J . i & xi <= yi ) ) )
thus
(
K = z3 &
J = z2 )
;
:: thesis: for i being set st i in X holds
ex R being RelStr ex xi, yi being Element of R st
( R = (X --> Y) . i & xi = K . i & yi = J . i & xi <= yi )
let i be
set ;
:: thesis: ( i in X implies ex R being RelStr ex xi, yi being Element of R st
( R = (X --> Y) . i & xi = K . i & yi = J . i & xi <= yi ) )
assume
i in X
;
:: thesis: ex R being RelStr ex xi, yi being Element of R st
( R = (X --> Y) . i & xi = K . i & yi = J . i & xi <= yi )
then reconsider i =
i as
Element of
X ;
reconsider R =
(X --> Y) . i as
RelStr ;
A15:
R = Y
by FUNCOP_1:13;
reconsider yi =
J . i,
xi =
K . i as
Element of
R by FUNCOP_1:13;
take
R
;
:: thesis: ex xi, yi being Element of R st
( R = (X --> Y) . i & xi = K . i & yi = J . i & xi <= yi )
take
xi
;
:: thesis: ex yi being Element of R st
( R = (X --> Y) . i & xi = K . i & yi = J . i & xi <= yi )
take
yi
;
:: thesis: ( R = (X --> Y) . i & xi = K . i & yi = J . i & xi <= yi )
consider xa,
ya being
Element of
Y such that A16:
(
xa = x' . i &
ya = y' . i &
f . i = xa "\/" ya )
by A2;
consider R1 being
RelStr ,
xi1,
yi1 being
Element of
R1 such that A17:
(
R1 = (X --> Y) . i &
xi1 = f1 . i &
yi1 = g1 . i &
xi1 <= yi1 )
by A13;
consider R2 being
RelStr ,
xi2,
yi2 being
Element of
R2 such that A18:
(
R2 = (X --> Y) . i &
xi2 = f2 . i &
yi2 = g2 . i &
xi2 <= yi2 )
by A14;
thus
(
R = (X --> Y) . i &
xi = K . i &
yi = J . i &
xi <= yi )
by A13, A14, A15, A16, A17, A18, YELLOW_0:22;
:: thesis: verum
end;
hence
z' >= z
by A12, Def4;
:: thesis: verum
end;
hence
z' >= z
;
:: thesis: verum
end;
hence
( x <= z & y <= z & ( for b1 being Element of the carrier of (Y |^ X) holds
( not x <= b1 or not y <= b1 or z <= b1 ) ) )
by A3, A7; :: thesis: verum