Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > tfis2 | Structured version Visualization version GIF version |
Description: Transfinite Induction Schema, using implicit substitution. (Contributed by NM, 18-Aug-1994.) |
Ref | Expression |
---|---|
tfis2.1 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
tfis2.2 | ⊢ (𝑥 ∈ On → (∀𝑦 ∈ 𝑥 𝜓 → 𝜑)) |
Ref | Expression |
---|---|
tfis2 | ⊢ (𝑥 ∈ On → 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1915 | . 2 ⊢ Ⅎ𝑥𝜓 | |
2 | tfis2.1 | . 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
3 | tfis2.2 | . 2 ⊢ (𝑥 ∈ On → (∀𝑦 ∈ 𝑥 𝜓 → 𝜑)) | |
4 | 1, 2, 3 | tfis2f 7550 | 1 ⊢ (𝑥 ∈ On → 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∈ wcel 2111 ∀wral 3106 Oncon0 6159 |
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 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 ax-un 7441 |
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 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-tr 5137 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-ord 6162 df-on 6163 |
This theorem is referenced by: tfis3 7552 smogt 7987 findcard3 8745 ordiso2 8963 cantnf 9140 cfsmolem 9681 fpwwe2lem8 10048 nqereu 10340 tfis2d 45210 |
Copyright terms: Public domain | W3C validator |