Theorem opeq2i 3887

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

Hypothesis

Ref	Expression
opeq1i.1	|- A = B

Assertion

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

Proof of Theorem opeq2i

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

Syntax hints:   = wceq 1398   <.cop 3692

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 2214

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-v 2815  df-un 3215  df-sn 3695  df-pr 3696  df-op 3698

This theorem is referenced by:  fnressn  5870  fressnfv  5871  nqprlu  7862  suplocexpr  8040  addresr  8152  iseqvalcbv  10821  pfx1  11395  pfxccatpfx2  11429  ressval2  13279  imasplusg  13521  eupth2lembfi  16472