| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > opeq1i | Structured version Visualization version GIF version | ||
| Description: Equality inference for ordered pairs. (Contributed by NM, 16-Dec-2006.) |
| Ref | Expression |
|---|---|
| opeq1i.1 | ⊢ 𝐴 = 𝐵 |
| Ref | Expression |
|---|---|
| opeq1i | ⊢ 〈𝐴, 𝐶〉 = 〈𝐵, 𝐶〉 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opeq1i.1 | . 2 ⊢ 𝐴 = 𝐵 | |
| 2 | opeq1 4833 | . 2 ⊢ (𝐴 = 𝐵 → 〈𝐴, 𝐶〉 = 〈𝐵, 𝐶〉) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ 〈𝐴, 𝐶〉 = 〈𝐵, 𝐶〉 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 〈cop 4590 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 |
| This theorem is used by: axi2m1 11168 s3tpop 14980 2strop 17321 grpbasex 17377 grpplusgx 17378 mat1dimelbas 22693 mat1dim0 22695 mat1dimid 22696 mat1dimscm 22697 mat1dimmul 22698 indistpsx 23235 nosupcbv 27938 noinfcbv 27953 setsiedg 29493 cusgrsize 29914 mapfzcons 43561 |
| Copyright terms: Public domain | W3C validator |