Theorem preq2i 3752

Description: Equality inference for unordered pairs. (Contributed by NM, 19-Oct-2012.)

Hypothesis

Ref	Expression
preq1i.1	|- A = B

Assertion

Ref	Expression
preq2i	|- { C , A } = { C , B }

Proof of Theorem preq2i

Step	Hyp	Ref	Expression
1		preq1i.1	. 2 |- A = B
2		preq2 3749	. 2 |- ( A = B -> { C , A } = { C , B } )
3	1, 2	ax-mp 5	1 |- { C , A } = { C , B }

Syntax hints:   = wceq 1397   {cpr 3670

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213

This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-v 2804  df-un 3204  df-sn 3675  df-pr 3676

This theorem is referenced by:  opid  3880  funopg  5360  df2o2  6597  fzprval  10316  fz0to3un2pr  10357  fz0to4untppr  10358  fzo0to2pr  10462  fzo0to42pr  10464  2strstr1g  13204  setsvtx  15901