:: AXIOMS semantic presentation

Lemma1: for b1, b2 being real number holds
( b1 <= b2 implies ( not ( b1 in REAL+ & b2 in REAL+ & ( for b3, b4 being Element of REAL+ holds
not ( b1 = b3 & b2 = b4 & b3 <=' b4 ) ) ) & not ( b1 in [:{0},REAL+ :] & b2 in [:{0},REAL+ :] & ( for b3, b4 being Element of REAL+ holds
not ( b1 = [0,b3] & b2 = [0,b4] & b4 <=' b3 ) ) ) & ( not ( b1 in REAL+ & b2 in REAL+ ) & not ( b1 in [:{0},REAL+ :] & b2 in [:{0},REAL+ :] ) implies ( b2 in REAL+ & b1 in [:{0},REAL+ :] ) ) ) )
by XXREAL_0:def 5;

Lemma2: for b1, b2 being real number holds
( not ( not ( b1 in REAL+ & b2 in REAL+ & ex b3, b4 being Element of REAL+ st
( b1 = b3 & b2 = b4 & b3 <=' b4 ) ) & not ( b1 in [:{0},REAL+ :] & b2 in [:{0},REAL+ :] & ex b3, b4 being Element of REAL+ st
( b1 = [0,b3] & b2 = [0,b4] & b4 <=' b3 ) ) & not ( b2 in REAL+ & b1 in [:{0},REAL+ :] ) ) implies b1 <= b2 )
proof
let c1, c2 be real number ;
assume E3: not ( not ( c1 in REAL+ & c2 in REAL+ & ex b1, b2 being Element of REAL+ st
( c1 = b1 & c2 = b2 & b1 <=' b2 ) ) & not ( c1 in [:{0},REAL+ :] & c2 in [:{0},REAL+ :] & ex b1, b2 being Element of REAL+ st
( c1 = [0,b1] & c2 = [0,b2] & b2 <=' b1 ) ) & not ( c2 in REAL+ & c1 in [:{0},REAL+ :] ) ) ;
per cases not ( not ( c1 in REAL+ & c2 in REAL+ ) & not ( c1 in [:{0},REAL+ :] & c2 in [:{0},REAL+ :] ) & not ( not ( c1 in REAL+ & c2 in REAL+ ) & not ( c1 in [:{0},REAL+ :] & c2 in [:{0},REAL+ :] ) ) ) ;
case ( c1 in REAL+ & c2 in REAL+ ) ;
then ( not c1 in [:{0},REAL+ :] & not c2 in [:{0},REAL+ :] ) by ARYTM_0:5, XBOOLE_0:3;
hence ex b1, b2 being Element of REAL+ st
( c1 = b1 & c2 = b2 & b1 <=' b2 ) by E3;
end;
case ( c1 in [:{0},REAL+ :] & c2 in [:{0},REAL+ :] ) ;
then ( not c1 in REAL+ & not c2 in REAL+ ) by ARYTM_0:5, XBOOLE_0:3;
hence ex b1, b2 being Element of REAL+ st
( c1 = [0,b1] & c2 = [0,b2] & b2 <=' b1 ) by E3;
end;
case ( not ( c1 in REAL+ & c2 in REAL+ ) & not ( c1 in [:{0},REAL+ :] & c2 in [:{0},REAL+ :] ) ) ;
hence not ( not ( c2 in REAL+ & c1 in [:{0},REAL+ :] ) & not c1 = K138() & not c2 = K137() ) by E3;
end;
end;
end;

theorem Th1: :: AXIOMS:1
canceled;

theorem Th2: :: AXIOMS:2
canceled;

theorem Th3: :: AXIOMS:3
canceled;

theorem Th4: :: AXIOMS:4
canceled;

theorem Th5: :: AXIOMS:5
canceled;

theorem Th6: :: AXIOMS:6
canceled;

theorem Th7: :: AXIOMS:7
canceled;

theorem Th8: :: AXIOMS:8
canceled;

theorem Th9: :: AXIOMS:9
canceled;

theorem Th10: :: AXIOMS:10
canceled;

theorem Th11: :: AXIOMS:11
canceled;

theorem Th12: :: AXIOMS:12
canceled;

theorem Th13: :: AXIOMS:13
canceled;

theorem Th14: :: AXIOMS:14
canceled;

theorem Th15: :: AXIOMS:15
canceled;

theorem Th16: :: AXIOMS:16
canceled;

theorem Th17: :: AXIOMS:17
canceled;

theorem Th18: :: AXIOMS:18
canceled;

theorem Th19: :: AXIOMS:19
for b1 being real number holds
ex b2 being real number st b1 + b2 = 0
proof
let c1 be real number ;
take c2 = - c1;
thus c1 + c2 = 0 ;
end;

theorem Th20: :: AXIOMS:20
for b1 being real number holds
not ( b1 <> 0 & ( for b2 being real number holds
not b1 * b2 = 1 ) )
proof
let c1 be real number ;
assume E3: c1 <> 0 ;
take c2 = c1 " ;
thus c1 * c2 = 1 by E3, XCMPLX_0:def 7;
end;

Lemma3: for b1, b2 being real number holds
( b1 <= b2 & b2 <= b1 implies b1 = b2 )
by XXREAL_0:1;

Lemma4: for b1 being real number
for b2, b3 being Element of REAL holds
( b1 = [*b2,b3*] implies ( b3 = 0 & b1 = b2 ) )
proof
let c1 be real number ;
let c2, c3 be Element of REAL ;
assume E5: c1 = [*c2,c3*] ;
E6: c1 in REAL by XREAL_0:def 1;
hereby
assume c3 <> 0 ;
then c1 = 0,1 --> c2,c3 by E5, ARYTM_0:def 7;
hence not verum by E6, ARYTM_0:10;
end;
hence c1 = c2 by E5, ARYTM_0:def 7;
end;

Lemma5: for b1, b2 being Element of REAL
for b3, b4 being real number holds
( b1 = b3 & b2 = b4 implies + b1,b2 = b3 + b4 )
proof
let c1, c2 be Element of REAL ;
let c3, c4 be real number ;
assume E6: ( c1 = c3 & c2 = c4 ) ;
consider c5, c6, c7, c8 being Element of REAL such that
E7: c3 = [*c5,c6*] and
E8: c4 = [*c7,c8*] and
E9: c3 + c4 = [*(+ c5,c7),(+ c6,c8)*] by XCMPLX_0:def 4;
E10: ( c3 = c5 & c4 = c7 ) by E7, E8, Lemma4;
( c6 = 0 & c8 = 0 ) by E7, E8, Lemma4;
then + c6,c8 = 0 by ARYTM_0:13;
hence + c1,c2 = c3 + c4 by E6, E9, E10, ARYTM_0:def 7;
end;

Lemma6: {} in {{} }
by TARSKI:def 1;

reconsider c1 = 0 as Element of REAL+ by ARYTM_2:21;

theorem Th21: :: AXIOMS:21
canceled;

theorem Th22: :: AXIOMS:22
canceled;

theorem Th23: :: AXIOMS:23
canceled;

theorem Th24: :: AXIOMS:24
canceled;

theorem Th25: :: AXIOMS:25
canceled;

theorem Th26: :: AXIOMS:26
for b1, b2 being Subset of REAL holds
not ( ( for b3, b4 being real number holds
( b3 in b1 & b4 in b2 implies b3 <= b4 ) ) & ( for b3 being real number holds
ex b4, b5 being real number st
( b4 in b1 & b5 in b2 & not ( b4 <= b3 & b3 <= b5 ) ) ) )
proof
let c2, c3 be Subset of REAL ;
assume E7: for b1, b2 being real number holds
( b1 in c2 & b2 in c3 implies b1 <= b2 ) ;
per cases not ( not c2 = 0 & not c3 = 0 & not ( c2 <> 0 & c3 <> 0 ) ) ;
suppose E8: ( c2 = 0 or c3 = 0 ) ;
take 1 ;
thus for b1, b2 being real number holds
( b1 in c2 & b2 in c3 implies ( b1 <= 1 & 1 <= b2 ) ) by E8;
end;
suppose that E8: c2 <> 0 and
E9: c3 <> 0 ;
consider c4 being Element of REAL such that
E10: c4 in c2 by E8, SUBSET_1:10;
consider c5 being Element of REAL such that
E11: c5 in c3 by E9, SUBSET_1:10;
E12: REAL c= REAL+ \/ [:{0},REAL+ :] by NUMBERS:def 1;
then E13: c2 c= REAL+ \/ [:{0},REAL+ :] by XBOOLE_1:1;
E14: c3 c= REAL+ \/ [:{0},REAL+ :] by E12, XBOOLE_1:1;
thus ex b1 being real number st
for b2, b3 being real number holds
( b2 in c2 & b3 in c3 implies ( b2 <= b1 & b1 <= b3 ) )
proof
per cases not ( not ( c2 misses REAL+ & c3 misses [:{0},REAL+ :] ) & not c3 meets [:{0},REAL+ :] & not c2 meets REAL+ ) ;
suppose that E15: c2 misses REAL+ and
E16: c3 misses [:{0},REAL+ :] ;
E17: c3 c= REAL+ by E14, E16, XBOOLE_1:73;
take c6 = 0;
let c7, c8 be real number ;
assume that
E18: c7 in c2 and
E19: c8 in c3 ;
( not c6 in [:{0},REAL+ :] & not c7 in REAL+ ) by E15, E18, ARYTM_0:5, ARYTM_2:21, XBOOLE_0:3;
hence c7 <= c6 by Lemma1;
reconsider c9 = c8 as Element of REAL+ by E17, E19;
c1 <=' c9 by ARYTM_1:6;
hence c6 <= c8 by Lemma2;
end;
suppose c3 meets [:{0},REAL+ :] ;
then consider c6 being set such that
E15: c6 in c3 and
E16: c6 in [:{0},REAL+ :] by XBOOLE_0:3;
consider c7, c8 being set such that
E17: c7 in {0} and
E18: c8 in REAL+ and
E19: c6 = [c7,c8] by E16, ZFMISC_1:103;
reconsider c9 = c8 as Element of REAL+ by E18;
c6 in REAL by E15;
then E20: [0,c9] in REAL by E17, E19, TARSKI:def 1;
then reconsider c10 = [0,c9] as real number by XREAL_0:def 1;
{ b1 where B is Element of REAL+ : [0,b1] in c3 } c= REAL+
proof
let c11 be set ; :: according to TARSKI:def 3
assume c11 in { b1 where B is Element of REAL+ : [0,b1] in c3 } ;
then ex b1 being Element of REAL+ st
( c11 = b1 & [0,b1] in c3 ) ;
hence c11 in REAL+ ;
end;
then reconsider c11 = { b1 where B is Element of REAL+ : [0,b1] in c3 } as Subset of REAL+ ;
E21: c10 in [:{0},REAL+ :] by Lemma6, ZFMISC_1:106;
E22: c10 in c3 by E15, E17, E19, TARSKI:def 1;
then E23: c9 in c11 ;
E24: c2 c= [:{0},REAL+ :]
proof
let c12 be set ; :: according to TARSKI:def 3
assume E25: c12 in c2 ;
then reconsider c13 = c12 as real number by XREAL_0:def 1;
now
assume E26: c13 in REAL+ ;
E27: c13 <= c10 by E7, E22, E25;
( not c10 in REAL+ & not c13 in [:{0},REAL+ :] ) by E21, E26, ARYTM_0:5, XBOOLE_0:3;
hence not verum by E27, Lemma1;
end;
hence c12 in [:{0},REAL+ :] by E13, E25, XBOOLE_0:def 2;
end;
then consider c12, c13 being set such that
E25: c12 in {0} and
E26: c13 in REAL+ and
E27: c4 = [c12,c13] by E10, ZFMISC_1:103;
reconsider c14 = c13 as Element of REAL+ by E26;
E28: c4 = [0,c14] by E25, E27, TARSKI:def 1;
{ b1 where B is Element of REAL+ : [0,b1] in c2 } c= REAL+
proof
let c15 be set ; :: according to TARSKI:def 3
assume c15 in { b1 where B is Element of REAL+ : [0,b1] in c2 } ;
then ex b1 being Element of REAL+ st
( c15 = b1 & [0,b1] in c2 ) ;
hence c15 in REAL+ ;
end;
then reconsider c15 = { b1 where B is Element of REAL+ : [0,b1] in c2 } as Subset of REAL+ ;
E29: c14 in c15 by E10, E28;
for b1, b2 being Element of REAL+ holds
( b1 in c11 & b2 in c15 implies b1 <=' b2 )
proof
let c16, c17 be Element of REAL+ ;
assume c16 in c11 ;
then consider c18 being Element of REAL+ such that
E30: c16 = c18 and
E31: [0,c18] in c3 ;
assume c17 in c15 ;
then consider c19 being Element of REAL+ such that
E32: c17 = c19 and
E33: [0,c19] in c2 ;
reconsider c20 = [0,c17], c21 = [0,c16] as real number by E30, E31, E32, E33, XREAL_0:def 1;
E34: ( c20 in [:{0},REAL+ :] & c21 in [:{0},REAL+ :] ) by Lemma6, ZFMISC_1:106;
c20 <= c21 by E7, E30, E31, E32, E33;
then consider c22, c23 being Element of REAL+ such that
E35: c20 = [0,c22] and
E36: c21 = [0,c23] and
E37: c23 <=' c22 by E34, Lemma1;
( c17 = c22 & c16 = c23 ) by E35, E36, ZFMISC_1:33;
hence c16 <=' c17 by E37;
end;
then consider c16 being Element of REAL+ such that
E30: for b1, b2 being Element of REAL+ holds
( b1 in c11 & b2 in c15 implies ( b1 <=' c16 & c16 <=' b2 ) ) by E23, E29, ARYTM_2:9;
E31: c9 <> 0 by E20, ARYTM_0:3;
c9 <=' c16 by E23, E29, E30;
then c16 <> 0 by E31, ARYTM_1:5;
then [0,c16] in REAL by ARYTM_0:2;
then reconsider c17 = [0,c16] as real number by XREAL_0:def 1;
take c17 ;
E32: c17 in [:{0},REAL+ :] by Lemma6, ZFMISC_1:106;
let c18, c19 be real number ;
assume that
E33: c18 in c2 and
E34: c19 in c3 ;
consider c20, c21 being set such that
E35: c20 in {0} and
E36: c21 in REAL+ and
E37: c18 = [c20,c21] by E24, E33, ZFMISC_1:103;
reconsider c22 = c21 as Element of REAL+ by E36;
E38: c18 = [0,c22] by E35, E37, TARSKI:def 1;
then E39: c22 in c15 by E33;
now
per cases ( c19 in REAL+ or c19 in [:{0},REAL+ :] ) by E14, E34, XBOOLE_0:def 2;
suppose E40: c19 in REAL+ ;
( c9 <=' c16 & c16 <=' c22 ) by E23, E30, E39;
hence c18 <= c17 by E24, E32, E33, E38, Lemma2;
( not c17 in REAL+ & not c19 in [:{0},REAL+ :] ) by E32, E40, ARYTM_0:5, XBOOLE_0:3;
hence c17 <= c19 by Lemma1;
end;
suppose E40: c19 in [:{0},REAL+ :] ;
then consider c23, c24 being set such that
E41: c23 in {0} and
E42: c24 in REAL+ and
E43: c19 = [c23,c24] by ZFMISC_1:103;
reconsider c25 = c24 as Element of REAL+ by E42;
E44: c19 = [0,c25] by E41, E43, TARSKI:def 1;
then c25 in c11 by E34;
then ( c25 <=' c16 & c16 <=' c22 ) by E30, E39;
hence ( c18 <= c17 & c17 <= c19 ) by E24, E32, E33, E38, E40, E44, Lemma2;
end;
end;
end;
hence ( c18 <= c17 & c17 <= c19 ) ;
end;
suppose c2 meets REAL+ ;
then consider c6 being set such that
E15: c6 in c2 and
E16: c6 in REAL+ by XBOOLE_0:3;
reconsider c7 = c6 as Element of REAL+ by E16;
c7 in REAL+ ;
then reconsider c8 = c7 as real number by ARYTM_0:1, XREAL_0:def 1;
reconsider c9 = c2 /\ REAL+ as Subset of REAL+ by XBOOLE_1:17;
E17: c8 in c9 by E15, XBOOLE_0:def 3;
E18: c3 c= REAL+
proof
let c10 be set ; :: according to TARSKI:def 3
assume E19: c10 in c3 ;
then reconsider c11 = c10 as real number by XREAL_0:def 1;
now
assume E20: c11 in [:{0},REAL+ :] ;
E21: c8 <= c11 by E7, E15, E19;
( not c11 in REAL+ & not c8 in [:{0},REAL+ :] ) by E20, ARYTM_0:5, XBOOLE_0:3;
hence not verum by E21, Lemma1;
end;
hence c10 in REAL+ by E14, E19, XBOOLE_0:def 2;
end;
then reconsider c10 = c3 as Subset of REAL+ ;
for b1, b2 being Element of REAL+ holds
( b1 in c9 & b2 in c10 implies b1 <=' b2 )
proof
let c11, c12 be Element of REAL+ ;
assume E19: ( c11 in c9 & c12 in c10 ) ;
( c11 in REAL+ & c12 in REAL+ ) ;
then reconsider c13 = c11, c14 = c12 as real number by ARYTM_0:1, XREAL_0:def 1;
c9 c= c2 by XBOOLE_1:17;
then c13 <= c14 by E7, E19;
then ex b1, b2 being Element of REAL+ st
( c13 = b1 & c14 = b2 & b1 <=' b2 ) by Lemma1;
hence c11 <=' c12 ;
end;
then consider c11 being Element of REAL+ such that
E19: for b1, b2 being Element of REAL+ holds
( b1 in c9 & b2 in c10 implies ( b1 <=' c11 & c11 <=' b2 ) ) by E11, E17, ARYTM_2:9;
c11 in REAL+ ;
then reconsider c12 = c11 as real number by ARYTM_0:1, XREAL_0:def 1;
take c12 ;
let c13, c14 be real number ;
assume that
E20: c13 in c2 and
E21: c14 in c3 ;
reconsider c15 = c14 as Element of REAL+ by E18, E21;
now
per cases ( c13 in REAL+ or c13 in [:{0},REAL+ :] ) by E13, E20, XBOOLE_0:def 2;
suppose c13 in REAL+ ;
then reconsider c16 = c13 as Element of REAL+ ;
( c16 in c9 & c15 in c10 ) by E20, E21, XBOOLE_0:def 3;
then ( c16 <=' c11 & c11 <=' c15 ) by E19;
hence ( c13 <= c12 & c12 <= c14 ) by Lemma2;
end;
suppose c13 in [:{0},REAL+ :] ;
then ( not c13 in REAL+ & not c12 in [:{0},REAL+ :] ) by ARYTM_0:5, XBOOLE_0:3;
hence c13 <= c12 by Lemma1;
( c7 <=' c11 & c11 <=' c15 ) by E17, E19, E21;
hence c12 <= c14 by Lemma2;
end;
end;
end;
hence ( c13 <= c12 & c12 <= c14 ) ;
end;
end;
end;
end;
end;
end;

theorem Th27: :: AXIOMS:27
canceled;

theorem Th28: :: AXIOMS:28
for b1, b2 being real number holds
( b1 in NAT & b2 in NAT implies b1 + b2 in NAT )
proof
let c2, c3 be real number ;
reconsider c4 = c2, c5 = c3 as Element of REAL by XREAL_0:def 1;
E7: + c4,c5 = c2 + c3 by Lemma5;
assume E8: ( c2 in NAT & c3 in NAT ) ;
then ex b1, b2 being Element of REAL+ st
( c4 = b1 & c5 = b2 & + c4,c5 = b1 + b2 ) by ARYTM_0:def 2, ARYTM_2:2;
hence c2 + c3 in NAT by E7, E8, ARYTM_2:17;
end;

Lemma7: 1 = succ 0
;

theorem Th29: :: AXIOMS:29
for b1 being Subset of REAL holds
( 0 in b1 & ( for b2 being real number holds
( b2 in b1 implies b2 + 1 in b1 ) ) implies NAT c= b1 )
proof
let c2 be Subset of REAL ;
assume that
E8: 0 in c2 and
E9: for b1 being real number holds
( b1 in c2 implies b1 + 1 in c2 ) ;
reconsider c3 = c2 /\ REAL+ as Subset of REAL+ by XBOOLE_1:17;
E10: 0 in c3 by E8, ARYTM_2:21, XBOOLE_0:def 3;
E11: c3 c= c2 by XBOOLE_1:17;
for b1, b2 being Element of REAL+ holds
( b1 in c3 & b2 = 1 implies b1 + b2 in c3 )
proof
let c4, c5 be Element of REAL+ ;
assume that
E12: c4 in c3 and
E13: c5 = 1 ;
c4 in REAL+ ;
then reconsider c6 = c4 as Element of REAL by ARYTM_0:1;
reconsider c7 = c6 as real number by XREAL_0:def 1;
consider c8, c9 being Element of REAL+ such that
E14: c6 = c8 and
E15: 1 = c9 and
E16: + c6,1 = c8 + c9 by Lemma7, ARYTM_0:def 2, ARYTM_2:21;
c7 + 1 in c2 by E9, E11, E12;
then + c6,1 in c2 by Lemma5;
hence c4 + c5 in c3 by E13, E14, E15, E16, XBOOLE_0:def 3;
end;
then NAT c= c3 by E10, Lemma7, ARYTM_2:18;
hence NAT c= c2 by E11, XBOOLE_1:1;
end;

theorem Th30: :: AXIOMS:30
for b1 being natural number holds b1 = { b2 where B is Element of NAT : b2 < b1 }
proof
let c2 be natural number ;
thus c2 c= { b1 where B is Element of NAT : b1 < c2 } :: according to XBOOLE_0:def 10
proof
let c3 be set ; :: according to TARSKI:def 3
reconsider c4 = c2 as Element of NAT by ORDINAL1:def 13;
E8: c4 c= NAT by ORDINAL1:def 2;
assume E9: c3 in c2 ;
then reconsider c5 = c3 as Element of NAT by E8;
c4 in NAT ;
then reconsider c6 = c4 as Element of REAL+ by ARYTM_2:2;
c3 in NAT by E8, E9;
then reconsider c7 = c3 as Element of REAL+ by ARYTM_2:2;
c7 in c6 by E9;
then E10: ( c7 in NAT & c7 <> c6 & c7 <=' c6 ) by ARYTM_2:19;
then c5 <= c2 by Lemma2;
then c5 < c2 by E10, Lemma3;
hence c3 in { b1 where B is Element of NAT : b1 < c2 } ;
end;
let c3 be set ; :: according to TARSKI:def 3
assume c3 in { b1 where B is Element of NAT : b1 < c2 } ;
then consider c4 being Element of NAT such that
E8: c3 = c4 and
E9: not c2 <= c4 ;
E10: ( c2 in NAT & c4 in NAT ) by ORDINAL1:def 13;
then reconsider c5 = c3, c6 = c2 as Element of REAL+ by E8, ARYTM_2:2;
not c6 <=' c5 by E8, E9, Lemma2;
hence c3 in c2 by E8, E9, E10, ARYTM_2:19;
end;