Theorem preq2d 3667

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

Hypothesis

Ref	Expression
preq1d.1	|- ( ph -> A = B )

Assertion

Ref	Expression
preq2d	|- ( ph -> { C , A } = { C , B } )

Proof of Theorem preq2d

Step	Hyp	Ref	Expression
1		preq1d.1	. 2 |- ( ph -> A = B )
2		preq2 3661	. 2 |- ( A = B -> { C , A } = { C , B } )
3	1, 2	syl 14	1 |- ( ph -> { C , A } = { C , B } )

Syntax hints:   -> wi 4   = wceq 1348   {cpr 3584

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152

This theorem depends on definitions:  df-bi 116  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-v 2732  df-un 3125  df-sn 3589  df-pr 3590

This theorem is referenced by:  opthreg  4540