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

Theorem tfinds3 7910
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 343 . 2 (𝑥 = ∅ → ((𝜂 → 𝜑) ↔ (𝜂 → 𝜓)))
3 tfinds3.2 . . 3 (𝑥 = 𝑦 → (𝜑 ↔ 𝜒))
43imbi2d 343 . 2 (𝑥 = 𝑦 → ((𝜂 → 𝜑) ↔ (𝜂 → 𝜒)))
5 tfinds3.3 . . 3 (𝑥 = suc 𝑦 → (𝜑 ↔ 𝜃))
65imbi2d 343 . 2 (𝑥 = suc 𝑦 → ((𝜂 → 𝜑) ↔ (𝜂 → 𝜃)))
7 tfinds3.4 . . 3 (𝑥 = 𝐴 → (𝜑 ↔ 𝜏))
87imbi2d 343 . 2 (𝑥 = 𝐴 → ((𝜂 → 𝜑) ↔ (𝜂 → 𝜏)))
9 tfinds3.5 . 2 (𝜂 → 𝜓)
10 tfinds3.6 . . 3 (𝑦 ∈ On → (𝜂 → (𝜒 → 𝜃)))
1110a2d 30 . 2 (𝑦 ∈ On → ((𝜂 → 𝜒) → (𝜂 → 𝜃)))
12 r19.21v 3191 . . 3 (∀𝑦 ∈ 𝑥 (𝜂 → 𝜒) ↔ (𝜂 → ∀𝑦 ∈ 𝑥 𝜒))
13 tfinds3.7 . . . 4 (Lim 𝑥 → (𝜂 → (∀𝑦 ∈ 𝑥 𝜒 → 𝜑)))
1413a2d 30 . . 3 (Lim 𝑥 → ((𝜂 → ∀𝑦 ∈ 𝑥 𝜒) → (𝜂 → 𝜑)))
1512, 14biimtrid 245 . 2 (Lim 𝑥 → (∀𝑦 ∈ 𝑥 (𝜂 → 𝜒) → (𝜂 → 𝜑)))
162, 4, 6, 8, 9, 11, 15tfinds 7905 1 (𝐴 ∈ On → (𝜂 → 𝜏))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∅c0 4281  Oncon0 6388  Lim wlim 6389  suc csuc 6390
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-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
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-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  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 4841  df-uni 4873  df-br 5109  df-opab 5174  df-tr 5219  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394
This theorem is used by:  oacl  8581  omcl  8582  oecl  8583  oawordri  8596  oaass  8607  oarec  8608  omordi  8612  omwordri  8618  odi  8625  omass  8626  oen0  8633  oewordri  8639  oeworde  8640  oeoelem  8645  omabs  8698  tfindsd  45530
  Copyright terms: Public domain W3C validator