| 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 2046 | . 2 ⊢ (𝑦 = 𝑥 → (𝑦 = 𝑧 → 𝑥 = 𝑧)) | |
| 2 | 1 | equcoms 2050 | 1 ⊢ (𝑥 = 𝑦 → (𝑦 = 𝑧 → 𝑥 = 𝑧)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 |
| This proof depends on definitions: df-bi 210 df-an 401 df-ex 1810 |
| This theorem is used by: equtrr 2052 equequ1 2055 equvinva 2060 ax6e 2415 equvini 2487 axprlem3OLD 5400 |
| Copyright terms: Public domain | W3C validator |