| 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 2407 from ax-c9 39705 and other older axioms.
This proof uses newer axioms ax-4 1842 and ax-6 2000, 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 39699 and ax-c10 39701. (Contributed by NM, 21-Dec-2015.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| ax13fromc9 | ⊢ (¬ 𝑥 = 𝑦 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-c5 39698 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → 𝑥 = 𝑦) | |
| 2 | 1 | con3i 155 | . . 3 ⊢ (¬ 𝑥 = 𝑦 → ¬ ∀𝑥 𝑥 = 𝑦) |
| 3 | ax-c5 39698 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑧 → 𝑥 = 𝑧) | |
| 4 | 3 | con3i 155 | . . 3 ⊢ (¬ 𝑥 = 𝑧 → ¬ ∀𝑥 𝑥 = 𝑧) |
| 5 | ax-c9 39705 | . . 3 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (¬ ∀𝑥 𝑥 = 𝑧 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧))) | |
| 6 | 2, 4, 5 | syl2im 41 | . 2 ⊢ (¬ 𝑥 = 𝑦 → (¬ 𝑥 = 𝑧 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧))) |
| 7 | ax13b 2065 | . 2 ⊢ ((¬ 𝑥 = 𝑦 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧)) ↔ (¬ 𝑥 = 𝑦 → (¬ 𝑥 = 𝑧 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧)))) | |
| 8 | 6, 7 | mpbir 234 | 1 ⊢ (¬ 𝑥 = 𝑦 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∀wal 1568 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-c5 39698 ax-c9 39705 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |