| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > spnfw | Structured version Visualization version Unicode version | ||
| Description: Weak version of sp 2053. 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 1926 |
1
|
| Colors of variables: wff setvar class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-6 1888 |
| This theorem depends on definitions: df-bi 197 df-ex 1705 |
| This theorem is referenced by: spfalw 1929 |
| Copyright terms: Public domain | W3C validator |