Theorem opeq1i 3803

Description: Equality inference for ordered pairs. (Contributed by NM, 16-Dec-2006.)

Hypothesis

Ref	Expression
opeq1i.1	|- A = B

Assertion

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

Proof of Theorem opeq1i

Step	Hyp	Ref	Expression
1		opeq1i.1	. 2 |- A = B
2		opeq1 3800	. 2 |- ( A = B -> <. A , C >. = <. B , C >. )
3	1, 2	ax-mp 5	1 |- <. A , C >. = <. B , C >.

Syntax hints:   = wceq 1364   <.cop 3617

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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2171

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-v 2758  df-un 3153  df-sn 3620  df-pr 3621  df-op 3623

This theorem is referenced by:  caucvgsrlemfv  7837  caucvgsr  7848  pitonnlem1  7891  axi2m1  7921  axcaucvg  7946  ennnfonelem1  12538  2strstr1g  12713  2strop1g  12715