Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > equtrr | Structured version Visualization version GIF version |
Description: A transitive law for equality. Lemma L17 in [Megill] p. 446 (p. 14 of the preprint). (Contributed by NM, 23-Aug-1993.) |
Ref | Expression |
---|---|
equtrr | ⊢ (𝑥 = 𝑦 → (𝑧 = 𝑥 → 𝑧 = 𝑦)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | equtr 2025 | . 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 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 |
This theorem depends on definitions: df-bi 206 df-an 396 df-ex 1784 |
This theorem is referenced by: equeuclr 2027 equequ2 2030 ax12v2 2175 2ax6elem 2470 axprlem3 5343 wl-spae 35607 ax12eq 36882 sn-axprlem3 40114 ax6e2eq 42066 ax6e2eqVD 42416 |
Copyright terms: Public domain | W3C validator |