| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ax13fromc9 | Structured version Visualization version GIF version | ||
| Description: Derive ax-13 2246 from ax-c9 34175 and other older axioms.
This proof uses newer axioms ax-4 1737 and ax-6 1888, but since these are proved from the older axioms above, this is acceptable and lets us avoid having to reprove several earlier theorems to use ax-c4 34169 and ax-c10 34171. (Contributed by NM, 21-Dec-2015.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| ax13fromc9 | ⊢ (¬ 𝑥 = 𝑦 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-c5 34168 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → 𝑥 = 𝑦) | |
| 2 | 1 | con3i 150 | . . 3 ⊢ (¬ 𝑥 = 𝑦 → ¬ ∀𝑥 𝑥 = 𝑦) |
| 3 | ax-c5 34168 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑧 → 𝑥 = 𝑧) | |
| 4 | 3 | con3i 150 | . . 3 ⊢ (¬ 𝑥 = 𝑧 → ¬ ∀𝑥 𝑥 = 𝑧) |
| 5 | ax-c9 34175 | . . 3 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (¬ ∀𝑥 𝑥 = 𝑧 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧))) | |
| 6 | 2, 4, 5 | syl2im 40 | . 2 ⊢ (¬ 𝑥 = 𝑦 → (¬ 𝑥 = 𝑧 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧))) |
| 7 | ax13b 1964 | . 2 ⊢ ((¬ 𝑥 = 𝑦 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧)) ↔ (¬ 𝑥 = 𝑦 → (¬ 𝑥 = 𝑧 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧)))) | |
| 8 | 6, 7 | mpbir 221 | 1 ⊢ (¬ 𝑥 = 𝑦 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∀wal 1481 |
| 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-5 1839 ax-6 1888 ax-7 1935 ax-c5 34168 ax-c9 34175 |
| This theorem depends on definitions: df-bi 197 df-an 386 df-ex 1705 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |