ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  peano5nnnn Unicode version

Theorem peano5nnnn 7627
Description: Peano's inductive postulate. This is a counterpart to peano5nni 8633 designed for real number axioms which involve natural numbers (notably, axcaucvg 7635). (Contributed by Jim Kingdon, 14-Jul-2021.) (New usage is discouraged.)
Hypothesis
Ref Expression
nntopi.n  |-  N  = 
|^| { x  |  ( 1  e.  x  /\  A. y  e.  x  ( y  +  1 )  e.  x ) }
Assertion
Ref Expression
peano5nnnn  |-  ( ( 1  e.  A  /\  A. z  e.  A  ( z  +  1 )  e.  A )  ->  N  C_  A )
Distinct variable groups:    x, y, A   
z, A, y
Allowed substitution hints:    N( x, y, z)

Proof of Theorem peano5nnnn
StepHypRef Expression
1 oveq1 5735 . . . 4  |-  ( y  =  z  ->  (
y  +  1 )  =  ( z  +  1 ) )
21eleq1d 2183 . . 3  |-  ( y  =  z  ->  (
( y  +  1 )  e.  A  <->  ( z  +  1 )  e.  A ) )
32cbvralv 2628 . 2  |-  ( A. y  e.  A  (
y  +  1 )  e.  A  <->  A. z  e.  A  ( z  +  1 )  e.  A )
4 ax1re 7597 . . . . 5  |-  1  e.  RR
5 elin 3225 . . . . . 6  |-  ( 1  e.  ( A  i^i  RR )  <->  ( 1  e.  A  /\  1  e.  RR ) )
65biimpri 132 . . . . 5  |-  ( ( 1  e.  A  /\  1  e.  RR )  ->  1  e.  ( A  i^i  RR ) )
74, 6mpan2 419 . . . 4  |-  ( 1  e.  A  ->  1  e.  ( A  i^i  RR ) )
8 inss1 3262 . . . . . 6  |-  ( A  i^i  RR )  C_  A
9 ssralv 3127 . . . . . 6  |-  ( ( A  i^i  RR ) 
C_  A  ->  ( A. y  e.  A  ( y  +  1 )  e.  A  ->  A. y  e.  ( A  i^i  RR ) ( y  +  1 )  e.  A ) )
108, 9ax-mp 7 . . . . 5  |-  ( A. y  e.  A  (
y  +  1 )  e.  A  ->  A. y  e.  ( A  i^i  RR ) ( y  +  1 )  e.  A
)
11 inss2 3263 . . . . . . . 8  |-  ( A  i^i  RR )  C_  RR
1211sseli 3059 . . . . . . 7  |-  ( y  e.  ( A  i^i  RR )  ->  y  e.  RR )
13 axaddrcl 7600 . . . . . . . 8  |-  ( ( y  e.  RR  /\  1  e.  RR )  ->  ( y  +  1 )  e.  RR )
144, 13mpan2 419 . . . . . . 7  |-  ( y  e.  RR  ->  (
y  +  1 )  e.  RR )
15 elin 3225 . . . . . . . 8  |-  ( ( y  +  1 )  e.  ( A  i^i  RR )  <->  ( ( y  +  1 )  e.  A  /\  ( y  +  1 )  e.  RR ) )
1615simplbi2com 1403 . . . . . . 7  |-  ( ( y  +  1 )  e.  RR  ->  (
( y  +  1 )  e.  A  -> 
( y  +  1 )  e.  ( A  i^i  RR ) ) )
1712, 14, 163syl 17 . . . . . 6  |-  ( y  e.  ( A  i^i  RR )  ->  ( (
y  +  1 )  e.  A  ->  (
y  +  1 )  e.  ( A  i^i  RR ) ) )
1817ralimia 2467 . . . . 5  |-  ( A. y  e.  ( A  i^i  RR ) ( y  +  1 )  e.  A  ->  A. y  e.  ( A  i^i  RR ) ( y  +  1 )  e.  ( A  i^i  RR ) )
1910, 18syl 14 . . . 4  |-  ( A. y  e.  A  (
y  +  1 )  e.  A  ->  A. y  e.  ( A  i^i  RR ) ( y  +  1 )  e.  ( A  i^i  RR ) )
20 axcnex 7594 . . . . . . 7  |-  CC  e.  _V
21 axresscn 7595 . . . . . . 7  |-  RR  C_  CC
2220, 21ssexi 4026 . . . . . 6  |-  RR  e.  _V
2322inex2 4023 . . . . 5  |-  ( A  i^i  RR )  e. 
_V
24 eleq2 2178 . . . . . . . 8  |-  ( x  =  ( A  i^i  RR )  ->  ( 1  e.  x  <->  1  e.  ( A  i^i  RR ) ) )
25 eleq2 2178 . . . . . . . . 9  |-  ( x  =  ( A  i^i  RR )  ->  ( (
y  +  1 )  e.  x  <->  ( y  +  1 )  e.  ( A  i^i  RR ) ) )
2625raleqbi1dv 2608 . . . . . . . 8  |-  ( x  =  ( A  i^i  RR )  ->  ( A. y  e.  x  (
y  +  1 )  e.  x  <->  A. y  e.  ( A  i^i  RR ) ( y  +  1 )  e.  ( A  i^i  RR ) ) )
2724, 26anbi12d 462 . . . . . . 7  |-  ( x  =  ( A  i^i  RR )  ->  ( (
1  e.  x  /\  A. y  e.  x  ( y  +  1 )  e.  x )  <->  ( 1  e.  ( A  i^i  RR )  /\  A. y  e.  ( A  i^i  RR ) ( y  +  1 )  e.  ( A  i^i  RR ) ) ) )
2827elabg 2799 . . . . . 6  |-  ( ( A  i^i  RR )  e.  _V  ->  (
( A  i^i  RR )  e.  { x  |  ( 1  e.  x  /\  A. y  e.  x  ( y  +  1 )  e.  x ) }  <->  ( 1  e.  ( A  i^i  RR )  /\  A. y  e.  ( A  i^i  RR ) ( y  +  1 )  e.  ( A  i^i  RR ) ) ) )
29 nntopi.n . . . . . . 7  |-  N  = 
|^| { x  |  ( 1  e.  x  /\  A. y  e.  x  ( y  +  1 )  e.  x ) }
30 intss1 3752 . . . . . . 7  |-  ( ( A  i^i  RR )  e.  { x  |  ( 1  e.  x  /\  A. y  e.  x  ( y  +  1 )  e.  x ) }  ->  |^| { x  |  ( 1  e.  x  /\  A. y  e.  x  ( y  +  1 )  e.  x ) }  C_  ( A  i^i  RR ) )
3129, 30eqsstrid 3109 . . . . . 6  |-  ( ( A  i^i  RR )  e.  { x  |  ( 1  e.  x  /\  A. y  e.  x  ( y  +  1 )  e.  x ) }  ->  N  C_  ( A  i^i  RR ) )
3228, 31syl6bir 163 . . . . 5  |-  ( ( A  i^i  RR )  e.  _V  ->  (
( 1  e.  ( A  i^i  RR )  /\  A. y  e.  ( A  i^i  RR ) ( y  +  1 )  e.  ( A  i^i  RR ) )  ->  N  C_  ( A  i^i  RR ) ) )
3323, 32ax-mp 7 . . . 4  |-  ( ( 1  e.  ( A  i^i  RR )  /\  A. y  e.  ( A  i^i  RR ) ( y  +  1 )  e.  ( A  i^i  RR ) )  ->  N  C_  ( A  i^i  RR ) )
347, 19, 33syl2an 285 . . 3  |-  ( ( 1  e.  A  /\  A. y  e.  A  ( y  +  1 )  e.  A )  ->  N  C_  ( A  i^i  RR ) )
3534, 8syl6ss 3075 . 2  |-  ( ( 1  e.  A  /\  A. y  e.  A  ( y  +  1 )  e.  A )  ->  N  C_  A )
363, 35sylan2br 284 1  |-  ( ( 1  e.  A  /\  A. z  e.  A  ( z  +  1 )  e.  A )  ->  N  C_  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1314    e. wcel 1463   {cab 2101   A.wral 2390   _Vcvv 2657    i^i cin 3036    C_ wss 3037   |^|cint 3737  (class class class)co 5728   CCcc 7545   RRcr 7546   1c1 7548    + caddc 7550
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 586  ax-in2 587  ax-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-13 1474  ax-14 1475  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097  ax-coll 4003  ax-sep 4006  ax-nul 4014  ax-pow 4058  ax-pr 4091  ax-un 4315  ax-setind 4412  ax-iinf 4462
This theorem depends on definitions:  df-bi 116  df-dc 803  df-3or 946  df-3an 947  df-tru 1317  df-fal 1320  df-nf 1420  df-sb 1719  df-eu 1978  df-mo 1979  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2244  df-ne 2283  df-ral 2395  df-rex 2396  df-reu 2397  df-rab 2399  df-v 2659  df-sbc 2879  df-csb 2972  df-dif 3039  df-un 3041  df-in 3043  df-ss 3050  df-nul 3330  df-pw 3478  df-sn 3499  df-pr 3500  df-op 3502  df-uni 3703  df-int 3738  df-iun 3781  df-br 3896  df-opab 3950  df-mpt 3951  df-tr 3987  df-eprel 4171  df-id 4175  df-po 4178  df-iso 4179  df-iord 4248  df-on 4250  df-suc 4253  df-iom 4465  df-xp 4505  df-rel 4506  df-cnv 4507  df-co 4508  df-dm 4509  df-rn 4510  df-res 4511  df-ima 4512  df-iota 5046  df-fun 5083  df-fn 5084  df-f 5085  df-f1 5086  df-fo 5087  df-f1o 5088  df-fv 5089  df-ov 5731  df-oprab 5732  df-mpo 5733  df-1st 5992  df-2nd 5993  df-recs 6156  df-irdg 6221  df-1o 6267  df-2o 6268  df-oadd 6271  df-omul 6272  df-er 6383  df-ec 6385  df-qs 6389  df-ni 7060  df-pli 7061  df-mi 7062  df-lti 7063  df-plpq 7100  df-mpq 7101  df-enq 7103  df-nqqs 7104  df-plqqs 7105  df-mqqs 7106  df-1nqqs 7107  df-rq 7108  df-ltnqqs 7109  df-enq0 7180  df-nq0 7181  df-0nq0 7182  df-plq0 7183  df-mq0 7184  df-inp 7222  df-i1p 7223  df-iplp 7224  df-enr 7469  df-nr 7470  df-plr 7471  df-0r 7474  df-1r 7475  df-c 7553  df-1 7555  df-r 7557  df-add 7558
This theorem is referenced by:  nnindnn  7628
  Copyright terms: Public domain W3C validator