| 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 1943 | . 2 ⊢ (𝑦 = 𝑥 → (𝑦 = 𝑧 → 𝑥 = 𝑧)) | |
| 2 | 1 | equcoms 1947 | 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: equtrr 1949 equequ1 1952 equviniva 1960 ax6e 2250 equvini 2346 sbequi 2375 axsep 4780 bj-axsep 32793 |
| Copyright terms: Public domain | W3C validator |