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

Theorem tfinds3 7857
Description: Principle of Transfinite Induction (inference schema), using implicit substitutions. The first four hypotheses establish the substitutions we need. The last three are the basis, the induction step for successors, and the induction step for limit ordinals. (Contributed by NM, 6-Jan-2005.) (Revised by David Abernethy, 21-Jun-2011.)
Hypotheses
Ref Expression
tfinds3.1 (𝑥 = ∅ → (𝜑𝜓))
tfinds3.2 (𝑥 = 𝑦 → (𝜑𝜒))
tfinds3.3 (𝑥 = suc 𝑦 → (𝜑𝜃))
tfinds3.4 (𝑥 = 𝐴 → (𝜑𝜏))
tfinds3.5 (𝜂𝜓)
tfinds3.6 (𝑦 ∈ On → (𝜂 → (𝜒𝜃)))
tfinds3.7 (Lim 𝑥 → (𝜂 → (∀𝑦𝑥 𝜒𝜑)))
Assertion
Ref Expression
tfinds3 (𝐴 ∈ On → (𝜂𝜏))
Distinct variable groups:   𝑥,𝐴   𝜑,𝑦   𝜒,𝑥   𝜏,𝑥   𝑥,𝑦,𝜂
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥,𝑦)   𝜒(𝑦)   𝜃(𝑥,𝑦)   𝜏(𝑦)   𝐴(𝑦)

Proof of Theorem tfinds3
StepHypRef Expression
1 tfinds3.1 . . 3 (𝑥 = ∅ → (𝜑𝜓))
21imbi2d 340 . 2 (𝑥 = ∅ → ((𝜂𝜑) ↔ (𝜂𝜓)))
3 tfinds3.2 . . 3 (𝑥 = 𝑦 → (𝜑𝜒))
43imbi2d 340 . 2 (𝑥 = 𝑦 → ((𝜂𝜑) ↔ (𝜂𝜒)))
5 tfinds3.3 . . 3 (𝑥 = suc 𝑦 → (𝜑𝜃))
65imbi2d 340 . 2 (𝑥 = suc 𝑦 → ((𝜂𝜑) ↔ (𝜂𝜃)))
7 tfinds3.4 . . 3 (𝑥 = 𝐴 → (𝜑𝜏))
87imbi2d 340 . 2 (𝑥 = 𝐴 → ((𝜂𝜑) ↔ (𝜂𝜏)))
9 tfinds3.5 . 2 (𝜂𝜓)
10 tfinds3.6 . . 3 (𝑦 ∈ On → (𝜂 → (𝜒𝜃)))
1110a2d 29 . 2 (𝑦 ∈ On → ((𝜂𝜒) → (𝜂𝜃)))
12 r19.21v 3178 . . 3 (∀𝑦𝑥 (𝜂𝜒) ↔ (𝜂 → ∀𝑦𝑥 𝜒))
13 tfinds3.7 . . . 4 (Lim 𝑥 → (𝜂 → (∀𝑦𝑥 𝜒𝜑)))
1413a2d 29 . . 3 (Lim 𝑥 → ((𝜂 → ∀𝑦𝑥 𝜒) → (𝜂𝜑)))
1512, 14biimtrid 241 . 2 (Lim 𝑥 → (∀𝑦𝑥 (𝜂𝜒) → (𝜂𝜑)))
162, 4, 6, 8, 9, 11, 15tfinds 7852 1 (𝐴 ∈ On → (𝜂𝜏))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205   = wceq 1540  wcel 2105  wral 3060  c0 4322  Oncon0 6364  Lim wlim 6365  suc csuc 6366
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-sep 5299  ax-nul 5306  ax-pr 5427  ax-un 7728
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3432  df-v 3475  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-tr 5266  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370
This theorem is referenced by:  oacl  8538  omcl  8539  oecl  8540  oawordri  8553  oaass  8564  oarec  8565  omordi  8569  omwordri  8575  odi  8582  omass  8583  oen0  8589  oewordri  8595  oeworde  8596  oeoelem  8601  omabs  8653  tfindsd  43267
  Copyright terms: Public domain W3C validator