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

Theorem finds1 7938
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 2763 . 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 7937 . 2 (𝑥 ∈ ω → (∅ = ∅ → 𝜑))
101, 9mpi 21 1 (𝑥 ∈ ω → 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2147  ∅c0 4281  suc csuc 6385  ωcom 7904
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pr 5396  ax-un 7778
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-tr 5217  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-om 7905
This theorem is used by:  findcard  9210  findcard2  9211  alephfplem3  10215  pwsdompw  10311  hsmexlem4  10537
  Copyright terms: Public domain W3C validator