:: The Lattice of Real Numbers. The Lattice of Real Functions
:: by Marek Chmur
::
:: Received May 22, 1990
:: Copyright (c) 1990-2012 Association of Mizar Users


begin

definition
func minreal  ->  BinOp of REAL means :Def1: :: REAL_LAT:def 1
 for x, y being Real holds it . (x,y) = min (x,y);
existence
 ex b1 being BinOp of REAL st
for x, y being Real holds b1 . (x,y) = min (x,y)
proofend;
uniqueness
 for b1, b2 being BinOp of REAL st ( for x, y being Real holds b1 . (x,y) = min (x,y) ) & ( for x, y being Real holds b2 . (x,y) = min (x,y) ) holds
b1 = b2
proofend;
func maxreal  ->  BinOp of REAL means :Def2: :: REAL_LAT:def 2
 for x, y being Real holds it . (x,y) = max (x,y);
existence
 ex b1 being BinOp of REAL st
for x, y being Real holds b1 . (x,y) = max (x,y)
proofend;
uniqueness
 for b1, b2 being BinOp of REAL st ( for x, y being Real holds b1 . (x,y) = max (x,y) ) & ( for x, y being Real holds b2 . (x,y) = max (x,y) ) holds
b1 = b2
proofend;
end;

:: deftheorem Def1 defines minreal REAL_LAT:def_1_:_
 for b1 being BinOp of REAL holds
( b1 = minreal iff for x, y being Real holds b1 . (x,y) = min (x,y) );

:: deftheorem Def2 defines maxreal REAL_LAT:def_2_:_
 for b1 being BinOp of REAL holds
( b1 = maxreal iff for x, y being Real holds b1 . (x,y) = max (x,y) );

definition
func Real_Lattice  ->  strict LattStr  equals :: REAL_LAT:def 3
 LattStr(# REAL,maxreal,minreal #);
coherence
 LattStr(# REAL,maxreal,minreal #) is strict LattStr ;
end;

:: deftheorem  defines Real_Lattice REAL_LAT:def_3_:_
 Real_Lattice = LattStr(# REAL,maxreal,minreal #);

registration
cluster the carrier of Real_Lattice ->  real-membered ;
coherence
 the carrier of Real_Lattice is real-membered ;
end;

registration
cluster Real_Lattice  ->  non empty strict ;
coherence
 not Real_Lattice is empty ;
end;

registration
let a, b be Element of Real_Lattice;
identifya "\/" b with  max (a,b);
compatibility
 a "\/" b = max (a,b) by Def2;
identifya "/\" b with  min (a,b);
compatibility
 a "/\" b = min (a,b) by Def1;
end;

Lm1:  for a, b being Element of Real_Lattice holds a "\/" b = b "\/" a
;

Lm2:  for a, b, c being Element of Real_Lattice holds a "\/" (b "\/" c) = (a "\/" b) "\/" c
by XXREAL_0:34;

Lm3:  for a, b being Element of Real_Lattice holds (a "/\" b) "\/" b = b
by XXREAL_0:36;

Lm4:  for a, b being Element of Real_Lattice holds a "/\" b = b "/\" a
;

Lm5:  for a, b, c being Element of Real_Lattice holds a "/\" (b "/\" c) = (a "/\" b) "/\" c
by XXREAL_0:33;

Lm6:  for a, b being Element of Real_Lattice holds a "/\" (a "\/" b) = a
by XXREAL_0:35;

registration
cluster Real_Lattice  ->  strict Lattice-like ;
coherence
 Real_Lattice is Lattice-like
proofend;
end;

Lm7:  for a, b, c being Element of Real_Lattice holds a "/\" (b "\/" c) = (a "/\" b) "\/" (a "/\" c)
by XXREAL_0:38;

theorem Th1: :: REAL_LAT:1
for p, q being Element of Real_Lattice holds maxreal . (p,q) = maxreal . (q,p)
proofend;

theorem Th2: :: REAL_LAT:2
for p, q being Element of Real_Lattice holds minreal . (p,q) = minreal . (q,p)
proofend;

theorem Th3: :: REAL_LAT:3
for p, q, r being Element of Real_Lattice holds
( maxreal . (p,(maxreal . (q,r))) = maxreal . ((maxreal . (q,r)),p) & maxreal . (p,(maxreal . (q,r))) = maxreal . ((maxreal . (p,q)),r) & maxreal . (p,(maxreal . (q,r))) = maxreal . ((maxreal . (q,p)),r) & maxreal . (p,(maxreal . (q,r))) = maxreal . ((maxreal . (r,p)),q) & maxreal . (p,(maxreal . (q,r))) = maxreal . ((maxreal . (r,q)),p) & maxreal . (p,(maxreal . (q,r))) = maxreal . ((maxreal . (p,r)),q) )
proofend;

theorem Th4: :: REAL_LAT:4
for p, q, r being Element of Real_Lattice holds
( minreal . (p,(minreal . (q,r))) = minreal . ((minreal . (q,r)),p) & minreal . (p,(minreal . (q,r))) = minreal . ((minreal . (p,q)),r) & minreal . (p,(minreal . (q,r))) = minreal . ((minreal . (q,p)),r) & minreal . (p,(minreal . (q,r))) = minreal . ((minreal . (r,p)),q) & minreal . (p,(minreal . (q,r))) = minreal . ((minreal . (r,q)),p) & minreal . (p,(minreal . (q,r))) = minreal . ((minreal . (p,r)),q) )
proofend;

theorem Th5: :: REAL_LAT:5
for p, q being Element of Real_Lattice holds
( maxreal . ((minreal . (p,q)),q) = q & maxreal . (q,(minreal . (p,q))) = q & maxreal . (q,(minreal . (q,p))) = q & maxreal . ((minreal . (q,p)),q) = q )
proofend;

theorem Th6: :: REAL_LAT:6
for q, p being Element of Real_Lattice holds
( minreal . (q,(maxreal . (q,p))) = q & minreal . ((maxreal . (p,q)),q) = q & minreal . (q,(maxreal . (p,q))) = q & minreal . ((maxreal . (q,p)),q) = q )
proofend;

theorem Th7: :: REAL_LAT:7
for q, p, r being Element of Real_Lattice holds minreal . (q,(maxreal . (p,r))) = maxreal . ((minreal . (q,p)),(minreal . (q,r)))
proofend;

registration
cluster Real_Lattice  ->  strict distributive ;
coherence
 Real_Lattice is distributive by Lm7, LATTICES:def_11;
end;

definition
let A be non empty set ;
func maxfuncreal A ->  BinOp of (Funcs (A,REAL)) means :Def4: :: REAL_LAT:def 4
 for f, g being Element of Funcs (A,REAL) holds it . (f,g) = maxreal .: (f,g);
existence
 ex b1 being BinOp of (Funcs (A,REAL)) st
for f, g being Element of Funcs (A,REAL) holds b1 . (f,g) = maxreal .: (f,g)
proofend;
uniqueness
 for b1, b2 being BinOp of (Funcs (A,REAL)) st ( for f, g being Element of Funcs (A,REAL) holds b1 . (f,g) = maxreal .: (f,g) ) & ( for f, g being Element of Funcs (A,REAL) holds b2 . (f,g) = maxreal .: (f,g) ) holds
b1 = b2
proofend;
func minfuncreal A ->  BinOp of (Funcs (A,REAL)) means :Def5: :: REAL_LAT:def 5
 for f, g being Element of Funcs (A,REAL) holds it . (f,g) = minreal .: (f,g);
existence
 ex b1 being BinOp of (Funcs (A,REAL)) st
for f, g being Element of Funcs (A,REAL) holds b1 . (f,g) = minreal .: (f,g)
proofend;
uniqueness
 for b1, b2 being BinOp of (Funcs (A,REAL)) st ( for f, g being Element of Funcs (A,REAL) holds b1 . (f,g) = minreal .: (f,g) ) & ( for f, g being Element of Funcs (A,REAL) holds b2 . (f,g) = minreal .: (f,g) ) holds
b1 = b2
proofend;
end;

:: deftheorem Def4 defines maxfuncreal REAL_LAT:def_4_:_
 for A being non empty set
for b2 being BinOp of (Funcs (A,REAL)) holds
( b2 = maxfuncreal A iff for f, g being Element of Funcs (A,REAL) holds b2 . (f,g) = maxreal .: (f,g) );

:: deftheorem Def5 defines minfuncreal REAL_LAT:def_5_:_
 for A being non empty set
for b2 being BinOp of (Funcs (A,REAL)) holds
( b2 = minfuncreal A iff for f, g being Element of Funcs (A,REAL) holds b2 . (f,g) = minreal .: (f,g) );

Lm8:  for A, B being non empty set
for x being Element of A
for f being Function of A,B holds x in dom f
proofend;

theorem Th8: :: REAL_LAT:8
for A being non empty set
for f, g being Element of Funcs (A,REAL) holds (maxfuncreal A) . (f,g) = (maxfuncreal A) . (g,f)
proofend;

theorem Th9: :: REAL_LAT:9
for A being non empty set
for f, g being Element of Funcs (A,REAL) holds (minfuncreal A) . (f,g) = (minfuncreal A) . (g,f)
proofend;

theorem Th10: :: REAL_LAT:10
for A being non empty set
for f, g, h being Element of Funcs (A,REAL) holds (maxfuncreal A) . (((maxfuncreal A) . (f,g)),h) = (maxfuncreal A) . (f,((maxfuncreal A) . (g,h)))
proofend;

theorem Th11: :: REAL_LAT:11
for A being non empty set
for f, g, h being Element of Funcs (A,REAL) holds (minfuncreal A) . (((minfuncreal A) . (f,g)),h) = (minfuncreal A) . (f,((minfuncreal A) . (g,h)))
proofend;

theorem Th12: :: REAL_LAT:12
for A being non empty set
for f, g being Element of Funcs (A,REAL) holds (maxfuncreal A) . (f,((minfuncreal A) . (f,g))) = f
proofend;

theorem Th13: :: REAL_LAT:13
for A being non empty set
for f, g being Element of Funcs (A,REAL) holds (maxfuncreal A) . (((minfuncreal A) . (f,g)),f) = f
proofend;

theorem Th14: :: REAL_LAT:14
for A being non empty set
for g, f being Element of Funcs (A,REAL) holds (maxfuncreal A) . (((minfuncreal A) . (g,f)),f) = f
proofend;

theorem :: REAL_LAT:15
for A being non empty set
for f, g being Element of Funcs (A,REAL) holds (maxfuncreal A) . (f,((minfuncreal A) . (g,f))) = f
proofend;

theorem Th16: :: REAL_LAT:16
for A being non empty set
for f, g being Element of Funcs (A,REAL) holds (minfuncreal A) . (f,((maxfuncreal A) . (f,g))) = f
proofend;

theorem Th17: :: REAL_LAT:17
for A being non empty set
for f, g being Element of Funcs (A,REAL) holds (minfuncreal A) . (f,((maxfuncreal A) . (g,f))) = f
proofend;

theorem Th18: :: REAL_LAT:18
for A being non empty set
for g, f being Element of Funcs (A,REAL) holds (minfuncreal A) . (((maxfuncreal A) . (g,f)),f) = f
proofend;

theorem :: REAL_LAT:19
for A being non empty set
for f, g being Element of Funcs (A,REAL) holds (minfuncreal A) . (((maxfuncreal A) . (f,g)),f) = f
proofend;

theorem Th20: :: REAL_LAT:20
for A being non empty set
for f, g, h being Element of Funcs (A,REAL) holds (minfuncreal A) . (f,((maxfuncreal A) . (g,h))) = (maxfuncreal A) . (((minfuncreal A) . (f,g)),((minfuncreal A) . (f,h)))
proofend;

Lm9:  for A being non empty set
for a, b, c being Element of LattStr(# (Funcs (A,REAL)),(maxfuncreal A),(minfuncreal A) #) holds a "\/" (b "\/" c) = (a "\/" b) "\/" c
by Th10;

Lm10:  for A being non empty set
for a, b, c being Element of LattStr(# (Funcs (A,REAL)),(maxfuncreal A),(minfuncreal A) #) holds a "/\" (b "/\" c) = (a "/\" b) "/\" c
by Th11;

definition
let A be non empty set ;
func RealFunc_Lattice A ->  non empty strict LattStr  equals :: REAL_LAT:def 6
 LattStr(# (Funcs (A,REAL)),(maxfuncreal A),(minfuncreal A) #);
coherence
 LattStr(# (Funcs (A,REAL)),(maxfuncreal A),(minfuncreal A) #) is non empty strict LattStr ;
end;

:: deftheorem  defines RealFunc_Lattice REAL_LAT:def_6_:_
 for A being non empty set holds RealFunc_Lattice A = LattStr(# (Funcs (A,REAL)),(maxfuncreal A),(minfuncreal A) #);

registration
let A be non empty set ;
cluster RealFunc_Lattice A ->  non empty join-commutative join-associative meet-commutative meet-associative meet-absorbing join-absorbing for non empty LattStr ;
coherence
 for b1 being non empty LattStr st b1 = RealFunc_Lattice A holds
( b1 is join-commutative & b1 is join-associative & b1 is meet-absorbing & b1 is meet-commutative & b1 is meet-associative & b1 is join-absorbing )
proofend;
end;

theorem Th21: :: REAL_LAT:21
for A being non empty set
for p, q being Element of (RealFunc_Lattice A) holds (maxfuncreal A) . (p,q) = (maxfuncreal A) . (q,p)
proofend;

theorem Th22: :: REAL_LAT:22
for A being non empty set
for p, q being Element of (RealFunc_Lattice A) holds (minfuncreal A) . (p,q) = (minfuncreal A) . (q,p)
proofend;

theorem :: REAL_LAT:23
for A being non empty set
for p, q, r being Element of (RealFunc_Lattice A) holds
( (maxfuncreal A) . (p,((maxfuncreal A) . (q,r))) = (maxfuncreal A) . (((maxfuncreal A) . (q,r)),p) & (maxfuncreal A) . (p,((maxfuncreal A) . (q,r))) = (maxfuncreal A) . (((maxfuncreal A) . (p,q)),r) & (maxfuncreal A) . (p,((maxfuncreal A) . (q,r))) = (maxfuncreal A) . (((maxfuncreal A) . (q,p)),r) & (maxfuncreal A) . (p,((maxfuncreal A) . (q,r))) = (maxfuncreal A) . (((maxfuncreal A) . (r,p)),q) & (maxfuncreal A) . (p,((maxfuncreal A) . (q,r))) = (maxfuncreal A) . (((maxfuncreal A) . (r,q)),p) & (maxfuncreal A) . (p,((maxfuncreal A) . (q,r))) = (maxfuncreal A) . (((maxfuncreal A) . (p,r)),q) )
proofend;

theorem :: REAL_LAT:24
for A being non empty set
for p, q, r being Element of (RealFunc_Lattice A) holds
( (minfuncreal A) . (p,((minfuncreal A) . (q,r))) = (minfuncreal A) . (((minfuncreal A) . (q,r)),p) & (minfuncreal A) . (p,((minfuncreal A) . (q,r))) = (minfuncreal A) . (((minfuncreal A) . (p,q)),r) & (minfuncreal A) . (p,((minfuncreal A) . (q,r))) = (minfuncreal A) . (((minfuncreal A) . (q,p)),r) & (minfuncreal A) . (p,((minfuncreal A) . (q,r))) = (minfuncreal A) . (((minfuncreal A) . (r,p)),q) & (minfuncreal A) . (p,((minfuncreal A) . (q,r))) = (minfuncreal A) . (((minfuncreal A) . (r,q)),p) & (minfuncreal A) . (p,((minfuncreal A) . (q,r))) = (minfuncreal A) . (((minfuncreal A) . (p,r)),q) )
proofend;

theorem :: REAL_LAT:25
for A being non empty set
for p, q being Element of (RealFunc_Lattice A) holds
( (maxfuncreal A) . (((minfuncreal A) . (p,q)),q) = q & (maxfuncreal A) . (q,((minfuncreal A) . (p,q))) = q & (maxfuncreal A) . (q,((minfuncreal A) . (q,p))) = q & (maxfuncreal A) . (((minfuncreal A) . (q,p)),q) = q )
proofend;

theorem :: REAL_LAT:26
for A being non empty set
for q, p being Element of (RealFunc_Lattice A) holds
( (minfuncreal A) . (q,((maxfuncreal A) . (q,p))) = q & (minfuncreal A) . (((maxfuncreal A) . (p,q)),q) = q & (minfuncreal A) . (q,((maxfuncreal A) . (p,q))) = q & (minfuncreal A) . (((maxfuncreal A) . (q,p)),q) = q )
proofend;

theorem :: REAL_LAT:27
for A being non empty set
for q, p, r being Element of (RealFunc_Lattice A) holds (minfuncreal A) . (q,((maxfuncreal A) . (p,r))) = (maxfuncreal A) . (((minfuncreal A) . (q,p)),((minfuncreal A) . (q,r))) by Th20;

theorem :: REAL_LAT:28
for A being non empty set holds RealFunc_Lattice A is D_Lattice
proofend;