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

Theorem finds1 7900
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 2761 . 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 7899 . 2 (𝑥 ∈ ω → (∅ = ∅ → 𝜑))
101, 9mpi 21 1 (𝑥 ∈ ω → 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2145  ∅c0 4279  suc csuc 6357  ωcom 7866
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7740
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 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-tr 5213  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-om 7867
This theorem is used by:  findcard  9163  findcard2  9164  alephfplem3  10166  pwsdompw  10262  hsmexlem4  10488
  Copyright terms: Public domain W3C validator