| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > equtr | Structured version Visualization version GIF version | ||
| Description: A transitive law for equality. (Contributed by NM, 23-Aug-1993.) |
| Ref | Expression |
|---|---|
| equtr | ⊢ (𝑥 = 𝑦 → (𝑦 = 𝑧 → 𝑥 = 𝑧)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax7 2038 | . 2 ⊢ (𝑦 = 𝑥 → (𝑦 = 𝑧 → 𝑥 = 𝑧)) | |
| 2 | 1 | equcoms 2042 | 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 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-ex 1802 |
| This theorem is referenced by: equtrr 2044 equequ1 2047 equvinva 2052 ax6e 2416 equvini 2488 axprlem3OLD 5388 |
| Copyright terms: Public domain | W3C validator |