| 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 4840 | . 2 ⊢ (𝐴 = 𝐵 → 〈𝐴, 𝐶〉 = 〈𝐵, 𝐶〉) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ 〈𝐴, 𝐶〉 = 〈𝐵, 𝐶〉 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 〈cop 4597 |
| 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 2148 ax-9 2156 ax-ext 2737 |
| 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 2744 df-cleq 2757 df-clel 2840 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 |
| This theorem is used by: axi2m1 11155 s3tpop 14966 2strop 17307 grpbasex 17363 grpplusgx 17364 mat1dimelbas 22658 mat1dim0 22660 mat1dimid 22661 mat1dimscm 22662 mat1dimmul 22663 indistpsx 23197 nosupcbv 27897 noinfcbv 27912 setsiedg 29417 cusgrsize 29838 mapfzcons 43480 |
| Copyright terms: Public domain | W3C validator |