Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > spnfw | Structured version Visualization version GIF version |
Description: Weak version of sp 2041. Uses only Tarski's FOL axiom schemes. (Contributed by NM, 1-Aug-2017.) (Proof shortened by Wolf Lammen, 13-Aug-2017.) |
Ref | Expression |
---|---|
spnfw.1 | ⊢ (¬ 𝜑 → ∀𝑥 ¬ 𝜑) |
Ref | Expression |
---|---|
spnfw | ⊢ (∀𝑥𝜑 → 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | spnfw.1 | . 2 ⊢ (¬ 𝜑 → ∀𝑥 ¬ 𝜑) | |
2 | idd 24 | . 2 ⊢ (𝑥 = 𝑦 → (𝜑 → 𝜑)) | |
3 | 1, 2 | spimw 1913 | 1 ⊢ (∀𝑥𝜑 → 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∀wal 1473 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-6 1875 |
This theorem depends on definitions: df-bi 196 df-ex 1696 |
This theorem is referenced by: spfalw 1916 |
Copyright terms: Public domain | W3C validator |