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

Theorem tfinds3 7231
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 329 . 2 (𝑥 = ∅ → ((𝜂𝜑) ↔ (𝜂𝜓)))
3 tfinds3.2 . . 3 (𝑥 = 𝑦 → (𝜑𝜒))
43imbi2d 329 . 2 (𝑥 = 𝑦 → ((𝜂𝜑) ↔ (𝜂𝜒)))
5 tfinds3.3 . . 3 (𝑥 = suc 𝑦 → (𝜑𝜃))
65imbi2d 329 . 2 (𝑥 = suc 𝑦 → ((𝜂𝜑) ↔ (𝜂𝜃)))
7 tfinds3.4 . . 3 (𝑥 = 𝐴 → (𝜑𝜏))
87imbi2d 329 . 2 (𝑥 = 𝐴 → ((𝜂𝜑) ↔ (𝜂𝜏)))
9 tfinds3.5 . 2 (𝜂𝜓)
10 tfinds3.6 . . 3 (𝑦 ∈ On → (𝜂 → (𝜒𝜃)))
1110a2d 29 . 2 (𝑦 ∈ On → ((𝜂𝜒) → (𝜂𝜃)))
12 r19.21v 3099 . . 3 (∀𝑦𝑥 (𝜂𝜒) ↔ (𝜂 → ∀𝑦𝑥 𝜒))
13 tfinds3.7 . . . 4 (Lim 𝑥 → (𝜂 → (∀𝑦𝑥 𝜒𝜑)))
1413a2d 29 . . 3 (Lim 𝑥 → ((𝜂 → ∀𝑦𝑥 𝜒) → (𝜂𝜑)))
1512, 14syl5bi 232 . 2 (Lim 𝑥 → (∀𝑦𝑥 (𝜂𝜒) → (𝜂𝜑)))
162, 4, 6, 8, 9, 11, 15tfinds 7226 1 (𝐴 ∈ On → (𝜂𝜏))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196   = wceq 1632  wcel 2140  wral 3051  c0 4059  Oncon0 5885  Lim wlim 5886  suc csuc 5887
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1989  ax-6 2055  ax-7 2091  ax-8 2142  ax-9 2149  ax-10 2169  ax-11 2184  ax-12 2197  ax-13 2392  ax-ext 2741  ax-sep 4934  ax-nul 4942  ax-pr 5056  ax-un 7116
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2048  df-eu 2612  df-mo 2613  df-clab 2748  df-cleq 2754  df-clel 2757  df-nfc 2892  df-ne 2934  df-ral 3056  df-rex 3057  df-rab 3060  df-v 3343  df-sbc 3578  df-dif 3719  df-un 3721  df-in 3723  df-ss 3730  df-pss 3732  df-nul 4060  df-if 4232  df-pw 4305  df-sn 4323  df-pr 4325  df-tp 4327  df-op 4329  df-uni 4590  df-br 4806  df-opab 4866  df-tr 4906  df-eprel 5180  df-po 5188  df-so 5189  df-fr 5226  df-we 5228  df-ord 5888  df-on 5889  df-lim 5890  df-suc 5891
This theorem is referenced by:  oacl  7787  omcl  7788  oecl  7789  oawordri  7802  oaass  7813  oarec  7814  omordi  7818  omwordri  7824  odi  7831  omass  7832  oen0  7838  oewordri  7844  oeworde  7845  oeoelem  7850  omabs  7899
  Copyright terms: Public domain W3C validator