Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > equeucl | Structured version Visualization version Unicode version |
Description: Equality is a left-Euclidean binary relation. (Right-Euclideanness is stated in ax-7 1935.) Curried (exported) form of equtr2 1954. (Contributed by BJ, 11-Apr-2021.) |
Ref | Expression |
---|---|
equeucl |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | equeuclr 1950 | . 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 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 |
This theorem depends on definitions: df-bi 197 df-an 386 df-ex 1705 |
This theorem is referenced by: equtr2 1954 ax13lem1 2248 ax13lem2 2296 bj-ax6elem2 32652 wl-ax13lem1 33287 |
Copyright terms: Public domain | W3C validator |