Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > equtr2 | Structured version Visualization version Unicode version |
Description: Equality is a left-Euclidean binary relation. Uncurried (imported) form of equeucl 1951. (Contributed by NM, 12-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by BJ, 11-Apr-2021.) |
Ref | Expression |
---|---|
equtr2 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | equeucl 1951 | . 2 | |
2 | 1 | imp 445 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wa 384 |
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: nfeqf 2301 mo3 2507 madurid 20450 dchrisumlema 25177 funpartfun 32050 bj-ssbequ1 32644 bj-mo3OLD 32832 wl-mo3t 33358 |
Copyright terms: Public domain | W3C validator |