HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem nn1suc 4435
Description: If a statement holds for 1 and also holds for a successor, it holds for all natural numbers. The first three hypotheses give us the substitution instances we need; the last two show that it holds for 1 and for a successor.
Hypotheses
Ref Expression
nn1suc.1 (x = 1 → (φψ))
nn1suc.3 (x = (y + 1) → (φχ))
nn1suc.4 (x = A → (φθ))
nn1suc.5 ψ
nn1suc.6 (y ∈ ℕ → χ)
Assertion
Ref Expression
nn1suc (A ∈ ℕ → θ)
Distinct variable group(s):   x,y,A   ψ,x   χ,x   θ,x   φ,y

Proof of Theorem nn1suc
StepHypRef Expression
1 dfsbcq 1442 . . 3 (z = 1 → ([z / x](A ∈ ℕ → φ) ↔ [1 / x](A ∈ ℕ → φ)))
2 sbequ 877 . . 3 (z = y → ([z / x](A ∈ ℕ → φ) ↔ [y / x](A ∈ ℕ → φ)))
3 dfsbcq 1442 . . 3 (z = (y + 1) → ([z / x](A ∈ ℕ → φ) ↔ [(y + 1) / x](A ∈ ℕ → φ)))
4 dfsbcq 1442 . . . . . . . 8 (z = A → ([z / x]φ ↔ [A / x]φ))
5 elex 1356 . . . . . . . . . . 11 (A ∈ ℕ → ∃x x = A)
6 ax-17 925 . . . . . . . . . . . . . 14 (zA → ∀x zA)
76hbsbc 1446 . . . . . . . . . . . . 13 ((A ∈ ℕ → [A / x]φ) → ∀x(A ∈ ℕ → [A / x]φ))
8 ax-17 925 . . . . . . . . . . . . 13 ((A ∈ ℕ → θ) → ∀x(A ∈ ℕ → θ))
97, 8hbbi 705 . . . . . . . . . . . 12 (((A ∈ ℕ → [A / x]φ) ↔ (A ∈ ℕ → θ)) → ∀x((A ∈ ℕ → [A / x]φ) ↔ (A ∈ ℕ → θ)))
10 sbceq1 1443 . . . . . . . . . . . . . 14 (x = A → (φ ↔ [A / x]φ))
11 nn1suc.4 . . . . . . . . . . . . . 14 (x = A → (φθ))
1210, 11bitr3d 408 . . . . . . . . . . . . 13 (x = A → ([A / x]φθ))
1312imbi2d 464 . . . . . . . . . . . 12 (x = A → ((A ∈ ℕ → [A / x]φ) ↔ (A ∈ ℕ → θ)))
149, 1319.23ai 746 . . . . . . . . . . 11 (∃x x = A → ((A ∈ ℕ → [A / x]φ) ↔ (A ∈ ℕ → θ)))
155, 14syl 12 . . . . . . . . . 10 (A ∈ ℕ → ((A ∈ ℕ → [A / x]φ) ↔ (A ∈ ℕ → θ)))
1615pm5.74rd 446 . . . . . . . . 9 (A ∈ ℕ → (A ∈ ℕ → ([A / x]φθ)))
1716pm2.43i 58 . . . . . . . 8 (A ∈ ℕ → ([A / x]φθ))
184, 17sylan9bbr 419 . . . . . . 7 ((A ∈ ℕ ∧ z = A) → ([z / x]φθ))
1918exp 291 . . . . . 6 (A ∈ ℕ → (z = A → ([z / x]φθ)))
2019com12 13 . . . . 5 (z = A → (A ∈ ℕ → ([z / x]φθ)))
2120pm5.74d 444 . . . 4 (z = A → ((A ∈ ℕ → [z / x]φ) ↔ (A ∈ ℕ → θ)))
22 ax-17 925 . . . . 5 (A ∈ ℕ → ∀x A ∈ ℕ)
2322sb19.21 888 . . . 4 ([z / x](A ∈ ℕ → φ) ↔ (A ∈ ℕ → [z / x]φ))
2421, 23syl5bb 410 . . 3 (z = A → ([z / x](A ∈ ℕ → φ) ↔ (A ∈ ℕ → θ)))
25 1nn 4432 . . . . . . . 8 1 ∈ ℕ
2625elisseti 1355 . . . . . . 7 1 ∈ V
2726isseti 1352 . . . . . 6 x x = 1
2826hbsbcv 1447 . . . . . . 7 ([1 / x]φ → ∀x[1 / x]φ)
29 nn1suc.5 . . . . . . . . 9 ψ
30 nn1suc.1 . . . . . . . . 9 (x = 1 → (φψ))
3129, 30mpbiri 169 . . . . . . . 8 (x = 1 → φ)
32 sbceq1 1443 . . . . . . . 8 (x = 1 → (φ ↔ [1 / x]φ))
3331, 32mpbid 170 . . . . . . 7 (x = 1 → [1 / x]φ)
3428, 3319.23ai 746 . . . . . 6 (∃x x = 1 → [1 / x]φ)
3527, 34ax-mp 6 . . . . 5 [1 / x]φ
3635a1i 7 . . . 4 (A ∈ ℕ → [1 / x]φ)
3722sbc19.21g 1470 . . . . 5 (1 ∈ V → ([1 / x](A ∈ ℕ → φ) ↔ (A ∈ ℕ → [1 / x]φ)))
3826, 37ax-mp 6 . . . 4 ([1 / x](A ∈ ℕ → φ) ↔ (A ∈ ℕ → [1 / x]φ))
3936, 38mpbir 165 . . 3 [1 / x](A ∈ ℕ → φ)
40 nn1suc.6 . . . . . . 7 (y ∈ ℕ → χ)
41 oprex 3018 . . . . . . . . 9 (y + 1) ∈ V
4241isseti 1352 . . . . . . . 8 x x = (y + 1)
43 ax-17 925 . . . . . . . . . 10 (χ → ∀xχ)
4441hbsbcv 1447 . . . . . . . . . 10 ([(y + 1) / x]φ → ∀x[(y + 1) / x]φ)
4543, 44hbbi 705 . . . . . . . . 9 ((χ ↔ [(y + 1) / x]φ) → ∀x(χ ↔ [(y + 1) / x]φ))
46 nn1suc.3 . . . . . . . . . 10 (x = (y + 1) → (φχ))
47 sbceq1 1443 . . . . . . . . . 10 (x = (y + 1) → (φ ↔ [(y + 1) / x]φ))
4846, 47bitr3d 408 . . . . . . . . 9 (x = (y + 1) → (χ ↔ [(y + 1) / x]φ))
4945, 4819.23ai 746 . . . . . . . 8 (∃x x = (y + 1) → (χ ↔ [(y + 1) / x]φ))
5042, 49ax-mp 6 . . . . . . 7 (χ ↔ [(y + 1) / x]φ)
5140, 50sylib 173 . . . . . 6 (y ∈ ℕ → [(y + 1) / x]φ)
5251a1d 14 . . . . 5 (y ∈ ℕ → (A ∈ ℕ → [(y + 1) / x]φ))
5322sbc19.21g 1470 . . . . . 6 ((y + 1) ∈ V → ([(y + 1) / x](A ∈ ℕ → φ) ↔ (A ∈ ℕ → [(y + 1) / x]φ)))
5441, 53ax-mp 6 . . . . 5 ([(y + 1) / x](A ∈ ℕ → φ) ↔ (A ∈ ℕ → [(y + 1) / x]φ))
5552, 54sylibr 175 . . . 4 (y ∈ ℕ → [(y + 1) / x](A ∈ ℕ → φ))
5655a1d 14 . . 3 (y ∈ ℕ → ([y / x](A ∈ ℕ → φ) → [(y + 1) / x](A ∈ ℕ → φ)))
571, 2, 3, 24, 39, 56nnind 4434 . 2 (A ∈ ℕ → (A ∈ ℕ → θ))
5857pm2.43i 58 1 (A ∈ ℕ → θ)
Colors of variables: wff set class
Syntax hints:   → wi 2   ↔ wb 127  ∃wex 678  [wsb 852   = wceq 1091   ∈ wcel 1092  Vcvv 1348  [wsbc 1440  (class class class)co 3001  1c1 4029   + caddc 4031  ℕcn 4093
This theorem is referenced by:  ruclem29 4913
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077  ax-reg 1078  ax-inf 1079
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3or 582  df-3an 583  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-ne 1192  df-ral 1205  df-rex 1206  df-reu 1207  df-rab 1208  df-v 1349  df-sbc 1441  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-pss 1494  df-nul 1708  df-if 1777  df-pw 1799  df-sn 1811  df-pr 1812  df-tp 1814  df-op 1815  df-uni 1920  df-int 1966  df-iun 1996  df-tr 2042  df-br 2063  df-opab 2098  df-eprel 2122  df-id 2125  df-po 2128  df-so 2138  df-fr 2169  df-we 2186  df-ord 2202  df-on 2203  df-lim 2204  df-suc 2205  df-om 2373  df-xp 2424  df-rel 2425  df-cnv 2426  df-co 2427  df-dm 2428  df-rn 2429  df-res 2430  df-ima 2431  df-fun 2432  df-fn 2433  df-f 2434  df-f1 2435  df-fv 2438  df-rdg 2970  df-opr 3003  df-oprab 3004  df-1o 3104  df-oadd 3106  df-omul 3107  df-er 3200  df-ec 3202  df-qs 3205  df-ni 3794  df-pli 3795  df-mi 3796  df-lti 3797  df-plpq 3829  df-mpq 3830  df-enq 3831  df-nq 3832  df-plq 3833  df-mq 3834  df-rq 3835  df-ltq 3836  df-1q 3837  df-np 3880  df-1p 3881  df-plp 3882  df-ltp 3884  df-plpr 3958  df-enr 3960  df-nr 3961  df-plr 3962  df-0r 3965  df-1r 3966  df-c 4034  df-1 4036  df-r 4038  df-plus 4039  df-n 4423
metamath.org