Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > wfis2 | Structured version Visualization version GIF version |
Description: Well Founded Induction schema, using implicit substitution. (Contributed by Scott Fenton, 29-Jan-2011.) |
Ref | Expression |
---|---|
wfis2.1 | ⊢ 𝑅 We 𝐴 |
wfis2.2 | ⊢ 𝑅 Se 𝐴 |
wfis2.3 | ⊢ (𝑦 = 𝑧 → (𝜑 ↔ 𝜓)) |
wfis2.4 | ⊢ (𝑦 ∈ 𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)𝜓 → 𝜑)) |
Ref | Expression |
---|---|
wfis2 | ⊢ (𝑦 ∈ 𝐴 → 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wfis2.1 | . . 3 ⊢ 𝑅 We 𝐴 | |
2 | wfis2.2 | . . 3 ⊢ 𝑅 Se 𝐴 | |
3 | wfis2.3 | . . . 4 ⊢ (𝑦 = 𝑧 → (𝜑 ↔ 𝜓)) | |
4 | wfis2.4 | . . . 4 ⊢ (𝑦 ∈ 𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)𝜓 → 𝜑)) | |
5 | 3, 4 | wfis2g 6190 | . . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑦 ∈ 𝐴 𝜑) |
6 | 1, 2, 5 | mp2an 690 | . 2 ⊢ ∀𝑦 ∈ 𝐴 𝜑 |
7 | 6 | rspec 3210 | 1 ⊢ (𝑦 ∈ 𝐴 → 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∈ wcel 2113 ∀wral 3141 Se wse 5515 We wwe 5516 Predcpred 6150 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pr 5333 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-reu 3148 df-rmo 3149 df-rab 3150 df-v 3499 df-sbc 3776 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-sn 4571 df-pr 4573 df-op 4577 df-br 5070 df-opab 5132 df-po 5477 df-so 5478 df-fr 5517 df-se 5518 df-we 5519 df-xp 5564 df-cnv 5566 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 |
This theorem is referenced by: wfis3 6192 |
Copyright terms: Public domain | W3C validator |