| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eqtr | Structured version Visualization version GIF version | ||
| Description: Transitive law for class equality. Proposition 4.7(3) of [TakeutiZaring] p. 13. (Contributed by NM, 25-Jan-2004.) |
| Ref | Expression |
|---|---|
| eqtr | ⊢ ((𝐴 = 𝐵 ∧ 𝐵 = 𝐶) → 𝐴 = 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeq1 2770 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 = 𝐶 ↔ 𝐵 = 𝐶)) | |
| 2 | 1 | biimpar 483 | 1 ⊢ ((𝐴 = 𝐵 ∧ 𝐵 = 𝐶) → 𝐴 = 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1572 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-9 2160 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1815 df-cleq 2758 |
| This theorem is used by: sylan9eq 2821 eqvincg 3604 disjeq0 4411 uneqdifeq 4450 propeqop 5485 relresfldOLD 6302 unixpid 6310 fvmptdf 7030 mpt3fvot2d 7721 poseq 8211 soseq 8212 eqer 8791 xpider 8846 undifixp 8999 wemaplem2 9577 infeq5 9674 ficard 10687 winalim2 10819 addlsub 11770 pospo 18569 istos 18642 symg2bas 19660 dmatmul 22869 uhgr2edg 29848 clwlkclwwlkf1lem3 30656 eqtrb 33171 bnj545 35637 bnj934 35677 bnj953 35681 mpofvop2d 35841 scottrankeqel 35874 acwer1prclem 35893 ordcmp 37451 bj-snmoore 38306 bj-isclm 38482 bj-bary1lem1 38502 wl-dfcleq 38707 poimirlem26 38834 heicant 38843 ismblfin 38849 volsupnfl 38853 itg2addnclem2 38860 itg2addnc 38862 rngodm1dm2 39134 rngoidmlem 39138 rngo1cl 39141 rngoueqz 39142 zerdivemp1x 39149 disjdmqsss 40105 dvheveccl 42437 rp-isfinite5 44839 clcnvlem 44944 relexpxpmin 45038 gneispace 45455 resipos 50510 |
| Copyright terms: Public domain | W3C validator |