:: AXIOMS semantic presentation

theorem :: AXIOMS:1
canceled;

theorem :: AXIOMS:2
canceled;

theorem :: AXIOMS:3
canceled;

theorem :: AXIOMS:4
canceled;

theorem :: AXIOMS:5
canceled;

theorem :: AXIOMS:6
canceled;

theorem :: AXIOMS:7
canceled;

theorem :: AXIOMS:8
canceled;

theorem :: AXIOMS:9
canceled;

theorem :: AXIOMS:10
canceled;

theorem :: AXIOMS:11
canceled;

theorem :: AXIOMS:12
canceled;

theorem :: AXIOMS:13
canceled;

theorem :: AXIOMS:14
canceled;

theorem :: AXIOMS:15
canceled;

theorem :: AXIOMS:16
canceled;

theorem :: AXIOMS:17
canceled;

theorem :: AXIOMS:18
canceled;

theorem :: 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 :: 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 E1: c1 <> 0 ;
take c2 = c1 " ;
thus c1 * c2 = 1 by E1, XCMPLX_0:def 7;
end;

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

E2: 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 E3: c1 = [*c2,c3*] ;
E4: c1 in REAL by XREAL_0:def 1;
hereby
assume c3 <> 0 ;
then c1 = 0,one --> c2,c3 by E3, ARYTM_0:def 7;
hence not verum by E4, ARYTM_0:10;
end; hence c1 = c2 by E3, ARYTM_0:def 7;
end;

E3: 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 E4: ( c1 = c3 & c2 = c4 ) ;
consider c5, c6, c7, c8 being Element of REAL such that
E5: c3 = [*c5,c6*]
and E6: c4 = [*c7,c8*]
and E7: c3 + c4 = [*(+ c5,c7),(+ c6,c8)*] by XCMPLX_0:def 4;
E8: ( c3 = c5 & c4 = c7 ) by E5, E6, E2;
( c6 = 0 & c8 = 0 ) by E5, E6, E2;
then + c6,c8 = 0 by ARYTM_0:13;
hence + c1,c2 = c3 + c4 by E4, E7, E8, ARYTM_0:def 7;
end;

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

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

theorem :: AXIOMS:21
canceled;

theorem :: AXIOMS:22
canceled;

theorem :: AXIOMS:23
canceled;

theorem :: AXIOMS:24
canceled;

theorem :: AXIOMS:25
canceled;

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

theorem :: AXIOMS:27
canceled;

theorem :: 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;
E5: + c4,c5 = c2 + c3 by E3;
assume E6: ( 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 E5, E6, ARYTM_2:17;
end;

E5: one = succ 0 by ORDINAL2:def 4
.= 1 ;

theorem :: 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 E6: 0 in c2
and E7: 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;
E8: 0 in c3 by E6, ARYTM_2:21, XBOOLE_0:def 3;
E9: 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 E10: c4 in c3
and E11: 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
E12: c6 = c8
and E13: 1 = c9
and E14: + c6,1 = c8 + c9 by E5, ARYTM_0:def 2, ARYTM_2:21;
c7 + 1 in c2 by E7, E9, E10;
then + c6,1 in c2 by E3;
hence c4 + c5 in c3 by E11, E12, E13, E14, XBOOLE_0:def 3;
end;
then NAT c= c3 by E8, E5, ARYTM_2:18;
hence NAT c= c2 by E9, XBOOLE_1:1;
end;

theorem :: 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 } :: uses XBOOLE_0:def 10
proof
let c3 be set ; :: uses TARSKI:def 3
reconsider c4 = c2 as Element of NAT by ORDINAL2:def 21;
E6: c4 c= NAT by ORDINAL1:def 2;
assume E7: c3 in c2 ;
then reconsider c5 = c3 as Element of NAT by E6;
c4 in NAT ;
then reconsider c6 = c4 as Element of REAL+ by ARYTM_2:2;
c3 in NAT by E6, E7;
then reconsider c7 = c3 as Element of REAL+ by ARYTM_2:2;
c7 in c6 by E7;
then E8: ( c7 in NAT & c7 <> c6 & c7 <=' c6 ) by ARYTM_2:19;
then c5 <= c2 by XREAL_0:def 2;
then c5 < c2 by E8, E1;
hence c3 in { b1 where B is Element of NAT : b1 < c2 } ;
end;
let c3 be set ; :: uses TARSKI:def 3
assume c3 in { b1 where B is Element of NAT : b1 < c2 } ;
then consider c4 being Element of NAT such that
E6: c3 = c4
and E7: not c2 <= c4 ;
E8: ( c2 in NAT & c4 in NAT ) by ORDINAL2:def 21;
then reconsider c5 = c3, c6 = c2 as Element of REAL+ by E6, ARYTM_2:2;
not c6 <=' c5 by E6, E7, XREAL_0:def 2;
hence c3 in c2 by E6, E7, E8, ARYTM_2:19;
end;