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 2176 is provable from Tarski's FOL and ax13v 2373 only. Note that this reverts the implication in ax13lem1 2374, so in fact (¬ 𝑥 = 𝑦 → (∀𝑥𝑧 = 𝑦 ↔ 𝑧 = 𝑦)) holds. (Contributed by Wolf Lammen, 17-Apr-2021.) |
Ref | Expression |
---|---|
wl-speqv | ⊢ (¬ 𝑥 = 𝑦 → (∀𝑥 𝑧 = 𝑦 → 𝑧 = 𝑦)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 19.2 1980 | . 2 ⊢ (∀𝑥 𝑧 = 𝑦 → ∃𝑥 𝑧 = 𝑦) | |
2 | ax13lem2 2376 | . 2 ⊢ (¬ 𝑥 = 𝑦 → (∃𝑥 𝑧 = 𝑦 → 𝑧 = 𝑦)) | |
3 | 1, 2 | syl5 34 | 1 ⊢ (¬ 𝑥 = 𝑦 → (∀𝑥 𝑧 = 𝑦 → 𝑧 = 𝑦)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∀wal 1537 ∃wex 1782 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-13 2372 |
This theorem depends on definitions: df-bi 206 df-an 397 df-ex 1783 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |