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

Theorem indpi 7562
Description: Principle of Finite Induction on positive integers. (Contributed by NM, 23-Mar-1996.)
Hypotheses
Ref Expression
indpi.1 (𝑥 = 1o → (𝜑𝜓))
indpi.2 (𝑥 = 𝑦 → (𝜑𝜒))
indpi.3 (𝑥 = (𝑦 +N 1o) → (𝜑𝜃))
indpi.4 (𝑥 = 𝐴 → (𝜑𝜏))
indpi.5 𝜓
indpi.6 (𝑦N → (𝜒𝜃))
Assertion
Ref Expression
indpi (𝐴N𝜏)
Distinct variable groups:   𝑥,𝑦   𝑥,𝐴   𝜓,𝑥   𝜒,𝑥   𝜃,𝑥   𝜏,𝑥   𝜑,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝜒(𝑦)   𝜃(𝑦)   𝜏(𝑦)   𝐴(𝑦)

Proof of Theorem indpi
StepHypRef Expression
1 indpi.4 . 2 (𝑥 = 𝐴 → (𝜑𝜏))
2 elni 7528 . . 3 (𝑥N ↔ (𝑥 ∈ ω ∧ 𝑥 ≠ ∅))
3 eqid 2231 . . . . . . . . . 10 ∅ = ∅
43orci 738 . . . . . . . . 9 (∅ = ∅ ∨ [∅ / 𝑥]𝜑)
5 nfv 1576 . . . . . . . . . . 11 𝑥∅ = ∅
6 nfsbc1v 3050 . . . . . . . . . . 11 𝑥[∅ / 𝑥]𝜑
75, 6nfor 1622 . . . . . . . . . 10 𝑥(∅ = ∅ ∨ [∅ / 𝑥]𝜑)
8 0ex 4216 . . . . . . . . . 10 ∅ ∈ V
9 eqeq1 2238 . . . . . . . . . . 11 (𝑥 = ∅ → (𝑥 = ∅ ↔ ∅ = ∅))
10 sbceq1a 3041 . . . . . . . . . . 11 (𝑥 = ∅ → (𝜑[∅ / 𝑥]𝜑))
119, 10orbi12d 800 . . . . . . . . . 10 (𝑥 = ∅ → ((𝑥 = ∅ ∨ 𝜑) ↔ (∅ = ∅ ∨ [∅ / 𝑥]𝜑)))
127, 8, 11elabf 2949 . . . . . . . . 9 (∅ ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)} ↔ (∅ = ∅ ∨ [∅ / 𝑥]𝜑))
134, 12mpbir 146 . . . . . . . 8 ∅ ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)}
14 suceq 4499 . . . . . . . . . . . . . 14 (𝑦 = ∅ → suc 𝑦 = suc ∅)
15 df-1o 6582 . . . . . . . . . . . . . 14 1o = suc ∅
1614, 15eqtr4di 2282 . . . . . . . . . . . . 13 (𝑦 = ∅ → suc 𝑦 = 1o)
17 indpi.5 . . . . . . . . . . . . . . 15 𝜓
1817olci 739 . . . . . . . . . . . . . 14 (1o = ∅ ∨ 𝜓)
19 1oex 6590 . . . . . . . . . . . . . . 15 1o ∈ V
20 eqeq1 2238 . . . . . . . . . . . . . . . 16 (𝑥 = 1o → (𝑥 = ∅ ↔ 1o = ∅))
21 indpi.1 . . . . . . . . . . . . . . . 16 (𝑥 = 1o → (𝜑𝜓))
2220, 21orbi12d 800 . . . . . . . . . . . . . . 15 (𝑥 = 1o → ((𝑥 = ∅ ∨ 𝜑) ↔ (1o = ∅ ∨ 𝜓)))
2319, 22elab 2950 . . . . . . . . . . . . . 14 (1o ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)} ↔ (1o = ∅ ∨ 𝜓))
2418, 23mpbir 146 . . . . . . . . . . . . 13 1o ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)}
2516, 24eqeltrdi 2322 . . . . . . . . . . . 12 (𝑦 = ∅ → suc 𝑦 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)})
2625a1d 22 . . . . . . . . . . 11 (𝑦 = ∅ → (𝑦 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)} → suc 𝑦 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)}))
2726a1i 9 . . . . . . . . . 10 (𝑦 ∈ ω → (𝑦 = ∅ → (𝑦 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)} → suc 𝑦 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)})))
28 indpi.6 . . . . . . . . . . . 12 (𝑦N → (𝜒𝜃))
29 elni 7528 . . . . . . . . . . . . . . . 16 (𝑦N ↔ (𝑦 ∈ ω ∧ 𝑦 ≠ ∅))
3029simprbi 275 . . . . . . . . . . . . . . 15 (𝑦N𝑦 ≠ ∅)
3130neneqd 2423 . . . . . . . . . . . . . 14 (𝑦N → ¬ 𝑦 = ∅)
32 biorf 751 . . . . . . . . . . . . . 14 𝑦 = ∅ → (𝜒 ↔ (𝑦 = ∅ ∨ 𝜒)))
3331, 32syl 14 . . . . . . . . . . . . 13 (𝑦N → (𝜒 ↔ (𝑦 = ∅ ∨ 𝜒)))
34 vex 2805 . . . . . . . . . . . . . 14 𝑦 ∈ V
35 eqeq1 2238 . . . . . . . . . . . . . . 15 (𝑥 = 𝑦 → (𝑥 = ∅ ↔ 𝑦 = ∅))
36 indpi.2 . . . . . . . . . . . . . . 15 (𝑥 = 𝑦 → (𝜑𝜒))
3735, 36orbi12d 800 . . . . . . . . . . . . . 14 (𝑥 = 𝑦 → ((𝑥 = ∅ ∨ 𝜑) ↔ (𝑦 = ∅ ∨ 𝜒)))
3834, 37elab 2950 . . . . . . . . . . . . 13 (𝑦 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)} ↔ (𝑦 = ∅ ∨ 𝜒))
3933, 38bitr4di 198 . . . . . . . . . . . 12 (𝑦N → (𝜒𝑦 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)}))
40 1pi 7535 . . . . . . . . . . . . . . . . . 18 1oN
41 addclpi 7547 . . . . . . . . . . . . . . . . . 18 ((𝑦N ∧ 1oN) → (𝑦 +N 1o) ∈ N)
4240, 41mpan2 425 . . . . . . . . . . . . . . . . 17 (𝑦N → (𝑦 +N 1o) ∈ N)
43 elni 7528 . . . . . . . . . . . . . . . . 17 ((𝑦 +N 1o) ∈ N ↔ ((𝑦 +N 1o) ∈ ω ∧ (𝑦 +N 1o) ≠ ∅))
4442, 43sylib 122 . . . . . . . . . . . . . . . 16 (𝑦N → ((𝑦 +N 1o) ∈ ω ∧ (𝑦 +N 1o) ≠ ∅))
4544simprd 114 . . . . . . . . . . . . . . 15 (𝑦N → (𝑦 +N 1o) ≠ ∅)
4645neneqd 2423 . . . . . . . . . . . . . 14 (𝑦N → ¬ (𝑦 +N 1o) = ∅)
47 biorf 751 . . . . . . . . . . . . . 14 (¬ (𝑦 +N 1o) = ∅ → (𝜃 ↔ ((𝑦 +N 1o) = ∅ ∨ 𝜃)))
4846, 47syl 14 . . . . . . . . . . . . 13 (𝑦N → (𝜃 ↔ ((𝑦 +N 1o) = ∅ ∨ 𝜃)))
49 eqeq1 2238 . . . . . . . . . . . . . . . 16 (𝑥 = (𝑦 +N 1o) → (𝑥 = ∅ ↔ (𝑦 +N 1o) = ∅))
50 indpi.3 . . . . . . . . . . . . . . . 16 (𝑥 = (𝑦 +N 1o) → (𝜑𝜃))
5149, 50orbi12d 800 . . . . . . . . . . . . . . 15 (𝑥 = (𝑦 +N 1o) → ((𝑥 = ∅ ∨ 𝜑) ↔ ((𝑦 +N 1o) = ∅ ∨ 𝜃)))
5251elabg 2952 . . . . . . . . . . . . . 14 ((𝑦 +N 1o) ∈ N → ((𝑦 +N 1o) ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)} ↔ ((𝑦 +N 1o) = ∅ ∨ 𝜃)))
5342, 52syl 14 . . . . . . . . . . . . 13 (𝑦N → ((𝑦 +N 1o) ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)} ↔ ((𝑦 +N 1o) = ∅ ∨ 𝜃)))
54 addpiord 7536 . . . . . . . . . . . . . . . 16 ((𝑦N ∧ 1oN) → (𝑦 +N 1o) = (𝑦 +o 1o))
5540, 54mpan2 425 . . . . . . . . . . . . . . 15 (𝑦N → (𝑦 +N 1o) = (𝑦 +o 1o))
56 pion 7530 . . . . . . . . . . . . . . . 16 (𝑦N𝑦 ∈ On)
57 oa1suc 6635 . . . . . . . . . . . . . . . 16 (𝑦 ∈ On → (𝑦 +o 1o) = suc 𝑦)
5856, 57syl 14 . . . . . . . . . . . . . . 15 (𝑦N → (𝑦 +o 1o) = suc 𝑦)
5955, 58eqtrd 2264 . . . . . . . . . . . . . 14 (𝑦N → (𝑦 +N 1o) = suc 𝑦)
6059eleq1d 2300 . . . . . . . . . . . . 13 (𝑦N → ((𝑦 +N 1o) ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)} ↔ suc 𝑦 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)}))
6148, 53, 603bitr2d 216 . . . . . . . . . . . 12 (𝑦N → (𝜃 ↔ suc 𝑦 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)}))
6228, 39, 613imtr3d 202 . . . . . . . . . . 11 (𝑦N → (𝑦 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)} → suc 𝑦 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)}))
6362a1i 9 . . . . . . . . . 10 (𝑦 ∈ ω → (𝑦N → (𝑦 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)} → suc 𝑦 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)})))
64 nndceq0 4716 . . . . . . . . . . . 12 (𝑦 ∈ ω → DECID 𝑦 = ∅)
65 df-dc 842 . . . . . . . . . . . 12 (DECID 𝑦 = ∅ ↔ (𝑦 = ∅ ∨ ¬ 𝑦 = ∅))
6664, 65sylib 122 . . . . . . . . . . 11 (𝑦 ∈ ω → (𝑦 = ∅ ∨ ¬ 𝑦 = ∅))
67 idd 21 . . . . . . . . . . . . . . 15 (𝑦 ∈ ω → (𝑦 = ∅ → 𝑦 = ∅))
6867necon3bd 2445 . . . . . . . . . . . . . 14 (𝑦 ∈ ω → (¬ 𝑦 = ∅ → 𝑦 ≠ ∅))
6968anc2li 329 . . . . . . . . . . . . 13 (𝑦 ∈ ω → (¬ 𝑦 = ∅ → (𝑦 ∈ ω ∧ 𝑦 ≠ ∅)))
7069, 29imbitrrdi 162 . . . . . . . . . . . 12 (𝑦 ∈ ω → (¬ 𝑦 = ∅ → 𝑦N))
7170orim2d 795 . . . . . . . . . . 11 (𝑦 ∈ ω → ((𝑦 = ∅ ∨ ¬ 𝑦 = ∅) → (𝑦 = ∅ ∨ 𝑦N)))
7266, 71mpd 13 . . . . . . . . . 10 (𝑦 ∈ ω → (𝑦 = ∅ ∨ 𝑦N))
7327, 63, 72mpjaod 725 . . . . . . . . 9 (𝑦 ∈ ω → (𝑦 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)} → suc 𝑦 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)}))
7473rgen 2585 . . . . . . . 8 𝑦 ∈ ω (𝑦 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)} → suc 𝑦 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)})
75 peano5 4696 . . . . . . . 8 ((∅ ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)} ∧ ∀𝑦 ∈ ω (𝑦 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)} → suc 𝑦 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)})) → ω ⊆ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)})
7613, 74, 75mp2an 426 . . . . . . 7 ω ⊆ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)}
7776sseli 3223 . . . . . 6 (𝑥 ∈ ω → 𝑥 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)})
78 abid 2219 . . . . . 6 (𝑥 ∈ {𝑥 ∣ (𝑥 = ∅ ∨ 𝜑)} ↔ (𝑥 = ∅ ∨ 𝜑))
7977, 78sylib 122 . . . . 5 (𝑥 ∈ ω → (𝑥 = ∅ ∨ 𝜑))
8079adantr 276 . . . 4 ((𝑥 ∈ ω ∧ 𝑥 ≠ ∅) → (𝑥 = ∅ ∨ 𝜑))
81 df-ne 2403 . . . . . 6 (𝑥 ≠ ∅ ↔ ¬ 𝑥 = ∅)
82 biorf 751 . . . . . 6 𝑥 = ∅ → (𝜑 ↔ (𝑥 = ∅ ∨ 𝜑)))
8381, 82sylbi 121 . . . . 5 (𝑥 ≠ ∅ → (𝜑 ↔ (𝑥 = ∅ ∨ 𝜑)))
8483adantl 277 . . . 4 ((𝑥 ∈ ω ∧ 𝑥 ≠ ∅) → (𝜑 ↔ (𝑥 = ∅ ∨ 𝜑)))
8580, 84mpbird 167 . . 3 ((𝑥 ∈ ω ∧ 𝑥 ≠ ∅) → 𝜑)
862, 85sylbi 121 . 2 (𝑥N𝜑)
871, 86vtoclga 2870 1 (𝐴N𝜏)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  wo 715  DECID wdc 841   = wceq 1397  wcel 2202  {cab 2217  wne 2402  wral 2510  [wsbc 3031  wss 3200  c0 3494  Oncon0 4460  suc csuc 4462  ωcom 4688  (class class class)co 6018  1oc1o 6575   +o coa 6579  Ncnpi 7492   +N cpli 7493
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-recs 6471  df-irdg 6536  df-1o 6582  df-oadd 6586  df-ni 7524  df-pli 7525
This theorem is referenced by:  pitonn  8068
  Copyright terms: Public domain W3C validator