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

Theorem tfis2f 7554
 Description: Transfinite Induction Schema, using implicit substitution. (Contributed by NM, 18-Aug-1994.)
Hypotheses
Ref Expression
tfis2f.1 𝑥𝜓
tfis2f.2 (𝑥 = 𝑦 → (𝜑𝜓))
tfis2f.3 (𝑥 ∈ On → (∀𝑦𝑥 𝜓𝜑))
Assertion
Ref Expression
tfis2f (𝑥 ∈ On → 𝜑)
Distinct variable groups:   𝜑,𝑦   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥,𝑦)

Proof of Theorem tfis2f
StepHypRef Expression
1 tfis2f.1 . . . . 5 𝑥𝜓
2 tfis2f.2 . . . . 5 (𝑥 = 𝑦 → (𝜑𝜓))
31, 2sbiev 2324 . . . 4 ([𝑦 / 𝑥]𝜑𝜓)
43ralbii 3136 . . 3 (∀𝑦𝑥 [𝑦 / 𝑥]𝜑 ↔ ∀𝑦𝑥 𝜓)
5 tfis2f.3 . . 3 (𝑥 ∈ On → (∀𝑦𝑥 𝜓𝜑))
64, 5syl5bi 245 . 2 (𝑥 ∈ On → (∀𝑦𝑥 [𝑦 / 𝑥]𝜑𝜑))
76tfis 7553 1 (𝑥 ∈ On → 𝜑)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209  Ⅎwnf 1785  [wsb 2069   ∈ wcel 2112  ∀wral 3109  Oncon0 6163 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773  ax-sep 5170  ax-nul 5177  ax-pr 5298  ax-un 7445 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2601  df-eu 2632  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ne 2991  df-ral 3114  df-rex 3115  df-rab 3118  df-v 3446  df-sbc 3724  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-pss 3903  df-nul 4247  df-if 4429  df-sn 4529  df-pr 4531  df-tp 4533  df-op 4535  df-uni 4804  df-br 5034  df-opab 5096  df-tr 5140  df-eprel 5433  df-po 5442  df-so 5443  df-fr 5482  df-we 5484  df-ord 6166  df-on 6167 This theorem is referenced by:  tfis2  7555  tfr3  8022
 Copyright terms: Public domain W3C validator