![]() |
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 4866 | . 2 ⊢ (𝐴 = 𝐵 → 〈𝐴, 𝐶〉 = 〈𝐵, 𝐶〉) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ 〈𝐴, 𝐶〉 = 〈𝐵, 𝐶〉 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1533 〈cop 4627 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-ext 2695 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-sb 2060 df-clab 2702 df-cleq 2716 df-clel 2802 df-rab 3425 df-v 3468 df-dif 3944 df-un 3946 df-in 3948 df-ss 3958 df-nul 4316 df-if 4522 df-sn 4622 df-pr 4624 df-op 4628 |
This theorem is referenced by: axi2m1 11151 s3tpop 14858 2strstr1OLD 17171 2strop1 17173 grpbasex 17237 grpplusgx 17238 mat1dimelbas 22297 mat1dim0 22299 mat1dimid 22300 mat1dimscm 22301 mat1dimmul 22302 indistpsx 22837 nosupcbv 27554 noinfcbv 27569 setsiedg 28768 cusgrsize 29183 mapfzcons 41968 |
Copyright terms: Public domain | W3C validator |