Theorem opeq12i 3893

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	|- A = B
opeq12i.2	|- C = D

Assertion

Ref	Expression
opeq12i	|- <. A , C >. = <. B , D >.

Proof of Theorem opeq12i

Step	Hyp	Ref	Expression
1		opeq1i.1	. 2 |- A = B
2		opeq12i.2	. 2 |- C = D
3		opeq12 3890	. 2 |- ( ( A = B /\ C = D ) -> <. A , C >. = <. B , D >. )
4	1, 2, 3	mp2an 426	1 |- <. A , C >. = <. B , D >.

Syntax hints:   = wceq 1398   <.cop 3697

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-v 2817  df-un 3218  df-sn 3700  df-pr 3701  df-op 3703

This theorem is referenced by:  addpinq1  7795  genipv  7840  ltexpri  7944  recexpr  7969  cauappcvgprlemladdru  7987  cauappcvgprlemladdrl  7988  cauappcvgpr  7993  caucvgprlemcl  8007  caucvgprlemladdrl  8009  caucvgpr  8013  caucvgprprlemval  8019  caucvgprprlemnbj  8024  caucvgprprlemmu  8026  caucvgprprlemclphr  8036  caucvgprprlemaddq  8039  caucvgprprlem1  8040  caucvgprprlem2  8041  caucvgsr  8133  pitonnlem1  8176  axi2m1  8206  axcaucvg  8231  konigsbergvtx  16603  konigsbergiedg  16604