Theorem preq1i 4271

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

Hypothesis

Ref	Expression
preq1i.1	|- A = B

Assertion

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

Proof of Theorem preq1i

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

Syntax hints:   = wceq 1483   {cpr 4179

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-v 3202  df-un 3579  df-sn 4178  df-pr 4180

This theorem is referenced by:  funopg  5922  frcond1  27130  n4cyclfrgr  27155  disjdifprg2  29389