| Mathbox for Wolf Lammen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > wl-speqv | Structured version Visualization version GIF version | ||
| Description: Under the assumption ¬ 𝑥 = 𝑦 a specialized version of sp 2217 is provable from Tarski's FOL and ax13v 2403 only. Note that this reverts the implication in ax13lem1 2404, so in fact (¬ 𝑥 = 𝑦 → (∀𝑥𝑧 = 𝑦 ↔ 𝑧 = 𝑦)) holds. (Contributed by Wolf Lammen, 17-Apr-2021.) |
| Ref | Expression |
|---|---|
| wl-speqv | ⊢ (¬ 𝑥 = 𝑦 → (∀𝑥 𝑧 = 𝑦 → 𝑧 = 𝑦)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 19.2 1995 | . 2 ⊢ (∀𝑥 𝑧 = 𝑦 → ∃𝑥 𝑧 = 𝑦) | |
| 2 | ax13lem2 2406 | . 2 ⊢ (¬ 𝑥 = 𝑦 → (∃𝑥 𝑧 = 𝑦 → 𝑧 = 𝑦)) | |
| 3 | 1, 2 | syl5 34 | 1 ⊢ (¬ 𝑥 = 𝑦 → (∀𝑥 𝑧 = 𝑦 → 𝑧 = 𝑦)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∀wal 1557 ∃wex 1798 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-13 2402 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-ex 1799 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |