| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > opeq12i | Structured version Visualization version GIF version | ||
| Description: Equality inference for ordered pairs. (Contributed by NM, 16-Dec-2006.) (Proof shortened by Eric Schmidt, 4-Apr-2007.) |
| Ref | Expression |
|---|---|
| opeq1i.1 | ⊢ 𝐴 = 𝐵 |
| opeq12i.2 | ⊢ 𝐶 = 𝐷 |
| Ref | Expression |
|---|---|
| opeq12i | ⊢ 〈𝐴, 𝐶〉 = 〈𝐵, 𝐷〉 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opeq1i.1 | . 2 ⊢ 𝐴 = 𝐵 | |
| 2 | opeq12i.2 | . 2 ⊢ 𝐶 = 𝐷 | |
| 3 | opeq12 4847 | . 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → 〈𝐴, 𝐶〉 = 〈𝐵, 𝐷〉) | |
| 4 | 1, 2, 3 | mp2an 705 | 1 ⊢ 〈𝐴, 𝐶〉 = 〈𝐵, 𝐷〉 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 〈cop 4840 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| 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 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 |
| This theorem is used by: sbcop 5466 elxp6 8069 addcompq 11074 mulcompq 11076 addassnq 11082 mulassnq 11083 distrnq 11085 1lt2nq 11097 axi2m1 11283 om2uzrdg 14139 pzriprng1ALT 21857 pzriprng1 21859 precsexlemcbv 28649 axlowdimlem6 29582 clwlkclwwlkflem 30652 konigsbergvtx 30904 konigsbergiedg 30905 nvop2 31267 nvvop 31268 phop 31477 hhsssh 31928 cshw1s2 33617 rngoi 39099 isdrngo1 39156 dfswapf2 50775 swapfcoa 50795 diag1a 50819 funcsetc1o 51024 |
| Copyright terms: Public domain | W3C validator |