MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  finds1 Structured version   Visualization version   GIF version

Theorem finds1 7912
Description: Principle of Finite Induction (inference schema), using implicit substitutions. The first three hypotheses establish the substitutions we need. The last two are the basis and the induction step. Theorem Schema 22 of [Suppes] p. 136. (Contributed by NM, 22-Mar-2006.)
Hypotheses
Ref Expression
finds1.1 (𝑥 = ∅ → (𝜑 ↔ 𝜓))
finds1.2 (𝑥 = 𝑦 → (𝜑 ↔ 𝜒))
finds1.3 (𝑥 = suc 𝑦 → (𝜑 ↔ 𝜃))
finds1.4 𝜓
finds1.5 (𝑦 ∈ ω → (𝜒 → 𝜃))
Assertion
Ref Expression
finds1 (𝑥 ∈ ω → 𝜑)
Distinct variable groups:   𝑥,𝑦   𝜓,𝑥   𝜒,𝑥   𝜃,𝑥   𝜑,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝜒(𝑦)   𝜃(𝑦)

Proof of Theorem finds1
StepHypRef Expression
1 eqid 2760 . 2 ∅ = ∅
2 finds1.1 . . 3 (𝑥 = ∅ → (𝜑 ↔ 𝜓))
3 finds1.2 . . 3 (𝑥 = 𝑦 → (𝜑 ↔ 𝜒))
4 finds1.3 . . 3 (𝑥 = suc 𝑦 → (𝜑 ↔ 𝜃))
5 finds1.4 . . . 4 𝜓
65a1i 11 . . 3 (∅ = ∅ → 𝜓)
7 finds1.5 . . . 4 (𝑦 ∈ ω → (𝜒 → 𝜃))
87a1d 26 . . 3 (𝑦 ∈ ω → (∅ = ∅ → (𝜒 → 𝜃)))
92, 3, 4, 6, 8finds2 7911 . 2 (𝑥 ∈ ω → (∅ = ∅ → 𝜑))
101, 9mpi 21 1 (𝑥 ∈ ω → 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569   ∈ wcel 2144  ∅c0 4278  suc csuc 6364  ωcom 7878
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7752
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-tr 5212  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-om 7879
This theorem is used by:  findcard  9183  findcard2  9184  alephfplem3  10189  pwsdompw  10285  hsmexlem4  10511
  Copyright terms: Public domain W3C validator