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

Theorem tfis3 7099
Description: Transfinite Induction Schema, using implicit substitution. (Contributed by NM, 4-Nov-2003.)
Hypotheses
Ref Expression
tfis3.1 (𝑥 = 𝑦 → (𝜑𝜓))
tfis3.2 (𝑥 = 𝐴 → (𝜑𝜒))
tfis3.3 (𝑥 ∈ On → (∀𝑦𝑥 𝜓𝜑))
Assertion
Ref Expression
tfis3 (𝐴 ∈ On → 𝜒)
Distinct variable groups:   𝜓,𝑥   𝜑,𝑦   𝜒,𝑥   𝑥,𝐴   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝜒(𝑦)   𝐴(𝑦)

Proof of Theorem tfis3
StepHypRef Expression
1 tfis3.2 . 2 (𝑥 = 𝐴 → (𝜑𝜒))
2 tfis3.1 . . 3 (𝑥 = 𝑦 → (𝜑𝜓))
3 tfis3.3 . . 3 (𝑥 ∈ On → (∀𝑦𝑥 𝜓𝜑))
42, 3tfis2 7098 . 2 (𝑥 ∈ On → 𝜑)
51, 4vtoclga 3303 1 (𝐴 ∈ On → 𝜒)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196   = wceq 1523  wcel 2030  wral 2941  Oncon0 5761
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pr 4936  ax-un 6991
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-sbc 3469  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-pss 3623  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-tp 4215  df-op 4217  df-uni 4469  df-br 4686  df-opab 4746  df-tr 4786  df-eprel 5058  df-po 5064  df-so 5065  df-fr 5102  df-we 5104  df-ord 5764  df-on 5765
This theorem is referenced by:  tfisi  7100  tfinds  7101  tfrlem1  7517  ordtypelem7  8470  rankonidlem  8729  tcrank  8785  infxpenlem  8874  alephle  8949  dfac12lem3  9005  ttukeylem5  9373  ttukeylem6  9374  tskord  9640  grudomon  9677  aomclem6  37946
  Copyright terms: Public domain W3C validator