Theorem opeq12i 4810

Description: Equality inference for ordered pairs. (Contributed by NM, 16-Dec-2006.) (Proof shortened by Eric Schmidt, 4-Apr-2007.)

Hypotheses

Ref	Expression
opeq1i.1	⊢ 𝐴 = 𝐵
opeq12i.2	⊢ 𝐶 = 𝐷

Assertion

Ref	Expression
opeq12i	⊢ ⟨𝐴, 𝐶⟩ = ⟨𝐵, 𝐷⟩

Proof of Theorem opeq12i

Step	Hyp	Ref	Expression
1		opeq1i.1	. 2 ⊢ 𝐴 = 𝐵
2		opeq12i.2	. 2 ⊢ 𝐶 = 𝐷
3		opeq12 4807	. 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → ⟨𝐴, 𝐶⟩ = ⟨𝐵, 𝐷⟩)
4	1, 2, 3	mp2an 698	1 ⊢ ⟨𝐴, 𝐶⟩ = ⟨𝐵, 𝐷⟩

Syntax hints:   = wceq 1547  ⟨cop 4562

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-ss 3900  df-nul 4263  df-if 4456  df-sn 4557  df-pr 4559  df-op 4563

This theorem is referenced by:  sbcop  5430  elxp6  7966  addcompq  10865  mulcompq  10867  addassnq  10873  mulassnq  10874  distrnq  10876  1lt2nq  10888  axi2m1  11074  om2uzrdg  13910  pzriprng1ALT  21472  pzriprng1  21474  precsexlemcbv  28217  axlowdimlem6  29035  clwlkclwwlkflem  30093  konigsbergvtx  30335  konigsbergiedg  30336  nvop2  30698  nvvop  30699  phop  30908  hhsssh  31359  cshw1s2  33040  rngoi  38275  isdrngo1  38332  dfswapf2  49759  swapfcoa  49779  diag1a  49803  funcsetc1o  49995