![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > spimfv | Structured version Visualization version GIF version |
Description: Specialization, using implicit substitution. Version of spim 2386 with a disjoint variable condition, which does not require ax-13 2371. See spimvw 2000 for a version with two disjoint variable conditions, requiring fewer axioms, and spimv 2389 for another variant. (Contributed by NM, 10-Jan-1993.) (Revised by BJ, 31-May-2019.) |
Ref | Expression |
---|---|
spimfv.nf | ⊢ Ⅎ𝑥𝜓 |
spimfv.1 | ⊢ (𝑥 = 𝑦 → (𝜑 → 𝜓)) |
Ref | Expression |
---|---|
spimfv | ⊢ (∀𝑥𝜑 → 𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | spimfv.nf | . 2 ⊢ Ⅎ𝑥𝜓 | |
2 | ax6ev 1974 | . . 3 ⊢ ∃𝑥 𝑥 = 𝑦 | |
3 | spimfv.1 | . . 3 ⊢ (𝑥 = 𝑦 → (𝜑 → 𝜓)) | |
4 | 2, 3 | eximii 1840 | . 2 ⊢ ∃𝑥(𝜑 → 𝜓) |
5 | 1, 4 | 19.36i 2225 | 1 ⊢ (∀𝑥𝜑 → 𝜓) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∀wal 1540 Ⅎwnf 1786 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-12 2172 |
This theorem depends on definitions: df-bi 206 df-ex 1783 df-nf 1787 |
This theorem is referenced by: chvarfv 2234 cbv3v2 2235 cbv3v 2332 setrec2fun 47211 |
Copyright terms: Public domain | W3C validator |