| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > equeucl | Structured version Visualization version GIF version | ||
| Description: Equality is a left-Euclidean binary relation. (Right-Euclideanness is stated in ax-7 2008.) Curried (exported) form of equtr2 2027. (Contributed by BJ, 11-Apr-2021.) |
| Ref | Expression |
|---|---|
| equeucl | ⊢ (𝑥 = 𝑧 → (𝑦 = 𝑧 → 𝑥 = 𝑦)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | equeuclr 2023 | . 2 ⊢ (𝑦 = 𝑧 → (𝑥 = 𝑧 → 𝑥 = 𝑦)) | |
| 2 | 1 | com12 32 | 1 ⊢ (𝑥 = 𝑧 → (𝑦 = 𝑧 → 𝑥 = 𝑦)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1780 |
| This theorem is referenced by: equtr2 2027 sbequ1 2249 ax13lem1 2379 ax13lem2 2381 bj-ax6elem2 36690 wl-ax13lem1 37517 |
| Copyright terms: Public domain | W3C validator |