![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > spimv | Structured version Visualization version GIF version |
Description: A version of spim 2386 with a distinct variable requirement instead of a bound-variable hypothesis. See spimfv 2233 and spimvw 2000 for versions requiring fewer axioms. (Contributed by NM, 31-Jul-1993.) Usage of this theorem is discouraged because it depends on ax-13 2371. Use spimvw 2000 instead. (New usage is discouraged.) |
Ref | Expression |
---|---|
spimv.1 | ⊢ (𝑥 = 𝑦 → (𝜑 → 𝜓)) |
Ref | Expression |
---|---|
spimv | ⊢ (∀𝑥𝜑 → 𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1918 | . 2 ⊢ Ⅎ𝑥𝜓 | |
2 | spimv.1 | . 2 ⊢ (𝑥 = 𝑦 → (𝜑 → 𝜓)) | |
3 | 1, 2 | spim 2386 | 1 ⊢ (∀𝑥𝜑 → 𝜓) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∀wal 1540 |
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 ax-13 2371 |
This theorem depends on definitions: df-bi 206 df-an 398 df-ex 1783 df-nf 1787 |
This theorem is referenced by: spv 2392 |
Copyright terms: Public domain | W3C validator |