| 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 2425 with a distinct variable requirement instead of a bound-variable hypothesis. See spimfv 2281 and spimvw 2013 for versions requiring fewer axioms. (Contributed by NM, 31-Jul-1993.) Usage of this theorem is discouraged because it depends on ax-13 2410. Use spimvw 2013 instead. (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| spimv.1 | ⊢ (𝑥 = 𝑦 → (𝜑 → 𝜓)) |
| Ref | Expression |
|---|---|
| spimv | ⊢ (∀𝑥𝜑 → 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfv 1941 | . 2 ⊢ Ⅎ𝑥𝜓 | |
| 2 | spimv.1 | . 2 ⊢ (𝑥 = 𝑦 → (𝜑 → 𝜓)) | |
| 3 | 1, 2 | spim 2425 | 1 ⊢ (∀𝑥𝜑 → 𝜓) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∀wal 1565 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-12 2219 ax-13 2410 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1807 df-nf 1811 |
| This theorem is referenced by: spv 2431 |
| Copyright terms: Public domain | W3C validator |