| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ax6dgen | Structured version Visualization version GIF version | ||
| Description: Tarski's system uses the weaker ax6v 1969 instead of the bundled ax-6 1968, so here we show that the degenerate case of ax-6 1968 can be derived. Even though ax-6 1968 is in the list of axioms used, recall that in set.mm, the only statement referencing ax-6 1968 is ax6v 1969. We later rederive from ax6v 1969 the bundled form as ax6 2384 with the help of the auxiliary axiom schemes. (Contributed by NM, 23-Apr-2017.) |
| Ref | Expression |
|---|---|
| ax6dgen | ⊢ ¬ ∀𝑥 ¬ 𝑥 = 𝑥 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | equid 2013 | . 2 ⊢ 𝑥 = 𝑥 | |
| 2 | 1 | notnoti 143 | . . 3 ⊢ ¬ ¬ 𝑥 = 𝑥 |
| 3 | 2 | spfalw 1981 | . 2 ⊢ (∀𝑥 ¬ 𝑥 = 𝑥 → ¬ 𝑥 = 𝑥) |
| 4 | 1, 3 | mt2 200 | 1 ⊢ ¬ ∀𝑥 ¬ 𝑥 = 𝑥 |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∀wal 1539 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 |
| This theorem depends on definitions: df-bi 207 df-ex 1781 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |