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

Theorem peano5nni 7993
Description: Peano's inductive postulate. Theorem I.36 (principle of mathematical induction) of [Apostol] p. 34. (Contributed by NM, 10-Jan-1997.) (Revised by Mario Carneiro, 17-Nov-2014.)
Assertion
Ref Expression
peano5nni ((1 ∈ 𝐴 ∧ ∀𝑥𝐴 (𝑥 + 1) ∈ 𝐴) → ℕ ⊆ 𝐴)
Distinct variable group:   𝑥,𝐴

Proof of Theorem peano5nni
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 1re 7084 . . . 4 1 ∈ ℝ
2 elin 3154 . . . . 5 (1 ∈ (𝐴 ∩ ℝ) ↔ (1 ∈ 𝐴 ∧ 1 ∈ ℝ))
32biimpri 128 . . . 4 ((1 ∈ 𝐴 ∧ 1 ∈ ℝ) → 1 ∈ (𝐴 ∩ ℝ))
41, 3mpan2 409 . . 3 (1 ∈ 𝐴 → 1 ∈ (𝐴 ∩ ℝ))
5 inss1 3185 . . . . 5 (𝐴 ∩ ℝ) ⊆ 𝐴
6 ssralv 3032 . . . . 5 ((𝐴 ∩ ℝ) ⊆ 𝐴 → (∀𝑥𝐴 (𝑥 + 1) ∈ 𝐴 → ∀𝑥 ∈ (𝐴 ∩ ℝ)(𝑥 + 1) ∈ 𝐴))
75, 6ax-mp 7 . . . 4 (∀𝑥𝐴 (𝑥 + 1) ∈ 𝐴 → ∀𝑥 ∈ (𝐴 ∩ ℝ)(𝑥 + 1) ∈ 𝐴)
8 inss2 3186 . . . . . . . 8 (𝐴 ∩ ℝ) ⊆ ℝ
98sseli 2969 . . . . . . 7 (𝑥 ∈ (𝐴 ∩ ℝ) → 𝑥 ∈ ℝ)
10 1red 7100 . . . . . . 7 (𝑥 ∈ (𝐴 ∩ ℝ) → 1 ∈ ℝ)
119, 10readdcld 7114 . . . . . 6 (𝑥 ∈ (𝐴 ∩ ℝ) → (𝑥 + 1) ∈ ℝ)
12 elin 3154 . . . . . . 7 ((𝑥 + 1) ∈ (𝐴 ∩ ℝ) ↔ ((𝑥 + 1) ∈ 𝐴 ∧ (𝑥 + 1) ∈ ℝ))
1312simplbi2com 1349 . . . . . 6 ((𝑥 + 1) ∈ ℝ → ((𝑥 + 1) ∈ 𝐴 → (𝑥 + 1) ∈ (𝐴 ∩ ℝ)))
1411, 13syl 14 . . . . 5 (𝑥 ∈ (𝐴 ∩ ℝ) → ((𝑥 + 1) ∈ 𝐴 → (𝑥 + 1) ∈ (𝐴 ∩ ℝ)))
1514ralimia 2399 . . . 4 (∀𝑥 ∈ (𝐴 ∩ ℝ)(𝑥 + 1) ∈ 𝐴 → ∀𝑥 ∈ (𝐴 ∩ ℝ)(𝑥 + 1) ∈ (𝐴 ∩ ℝ))
167, 15syl 14 . . 3 (∀𝑥𝐴 (𝑥 + 1) ∈ 𝐴 → ∀𝑥 ∈ (𝐴 ∩ ℝ)(𝑥 + 1) ∈ (𝐴 ∩ ℝ))
17 reex 7073 . . . . 5 ℝ ∈ V
1817inex2 3920 . . . 4 (𝐴 ∩ ℝ) ∈ V
19 eleq2 2117 . . . . . . 7 (𝑦 = (𝐴 ∩ ℝ) → (1 ∈ 𝑦 ↔ 1 ∈ (𝐴 ∩ ℝ)))
20 eleq2 2117 . . . . . . . 8 (𝑦 = (𝐴 ∩ ℝ) → ((𝑥 + 1) ∈ 𝑦 ↔ (𝑥 + 1) ∈ (𝐴 ∩ ℝ)))
2120raleqbi1dv 2530 . . . . . . 7 (𝑦 = (𝐴 ∩ ℝ) → (∀𝑥𝑦 (𝑥 + 1) ∈ 𝑦 ↔ ∀𝑥 ∈ (𝐴 ∩ ℝ)(𝑥 + 1) ∈ (𝐴 ∩ ℝ)))
2219, 21anbi12d 450 . . . . . 6 (𝑦 = (𝐴 ∩ ℝ) → ((1 ∈ 𝑦 ∧ ∀𝑥𝑦 (𝑥 + 1) ∈ 𝑦) ↔ (1 ∈ (𝐴 ∩ ℝ) ∧ ∀𝑥 ∈ (𝐴 ∩ ℝ)(𝑥 + 1) ∈ (𝐴 ∩ ℝ))))
2322elabg 2711 . . . . 5 ((𝐴 ∩ ℝ) ∈ V → ((𝐴 ∩ ℝ) ∈ {𝑦 ∣ (1 ∈ 𝑦 ∧ ∀𝑥𝑦 (𝑥 + 1) ∈ 𝑦)} ↔ (1 ∈ (𝐴 ∩ ℝ) ∧ ∀𝑥 ∈ (𝐴 ∩ ℝ)(𝑥 + 1) ∈ (𝐴 ∩ ℝ))))
24 dfnn2 7992 . . . . . 6 ℕ = {𝑦 ∣ (1 ∈ 𝑦 ∧ ∀𝑥𝑦 (𝑥 + 1) ∈ 𝑦)}
25 intss1 3658 . . . . . 6 ((𝐴 ∩ ℝ) ∈ {𝑦 ∣ (1 ∈ 𝑦 ∧ ∀𝑥𝑦 (𝑥 + 1) ∈ 𝑦)} → {𝑦 ∣ (1 ∈ 𝑦 ∧ ∀𝑥𝑦 (𝑥 + 1) ∈ 𝑦)} ⊆ (𝐴 ∩ ℝ))
2624, 25syl5eqss 3017 . . . . 5 ((𝐴 ∩ ℝ) ∈ {𝑦 ∣ (1 ∈ 𝑦 ∧ ∀𝑥𝑦 (𝑥 + 1) ∈ 𝑦)} → ℕ ⊆ (𝐴 ∩ ℝ))
2723, 26syl6bir 157 . . . 4 ((𝐴 ∩ ℝ) ∈ V → ((1 ∈ (𝐴 ∩ ℝ) ∧ ∀𝑥 ∈ (𝐴 ∩ ℝ)(𝑥 + 1) ∈ (𝐴 ∩ ℝ)) → ℕ ⊆ (𝐴 ∩ ℝ)))
2818, 27ax-mp 7 . . 3 ((1 ∈ (𝐴 ∩ ℝ) ∧ ∀𝑥 ∈ (𝐴 ∩ ℝ)(𝑥 + 1) ∈ (𝐴 ∩ ℝ)) → ℕ ⊆ (𝐴 ∩ ℝ))
294, 16, 28syl2an 277 . 2 ((1 ∈ 𝐴 ∧ ∀𝑥𝐴 (𝑥 + 1) ∈ 𝐴) → ℕ ⊆ (𝐴 ∩ ℝ))
3029, 5syl6ss 2985 1 ((1 ∈ 𝐴 ∧ ∀𝑥𝐴 (𝑥 + 1) ∈ 𝐴) → ℕ ⊆ 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 101   = wceq 1259  wcel 1409  {cab 2042  wral 2323  Vcvv 2574  cin 2944  wss 2945   cint 3643  (class class class)co 5540  cr 6946  1c1 6948   + caddc 6950  cn 7990
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-sep 3903  ax-cnex 7033  ax-resscn 7034  ax-1re 7036  ax-addrcl 7039
This theorem depends on definitions:  df-bi 114  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328  df-v 2576  df-in 2952  df-ss 2959  df-int 3644  df-inn 7991
This theorem is referenced by:  nnssre  7994  nnind  8006
  Copyright terms: Public domain W3C validator