Theorem preq2 1871

Description: An equality theorem for unordered pairs.

Assertion

Ref	Expression
preq2	⊢ (A = B → {C, A} = {C, B})

Proof of Theorem preq2

Step	Hyp	Ref	Expression
1		preq1 1870	. 2 ⊢ (A = B → {A, C} = {B, C})
2		prcom 1840	. 2 ⊢ {C, A} = {A, C}
3		prcom 1840	. 2 ⊢ {C, B} = {B, C}
4	1, 2, 3	3eqtr4g 1147	1 ⊢ (A = B → {C, A} = {C, B})

Syntax hints:   → wi 2   = wceq 1091  {cpr 1809

This theorem is referenced by:  preq12b 1874  opeq1 1876  opeq2 1877  prex 1892  opprc1 1905  opprc2 1907  opprc3 1908  opthwiener 1914  dmsnsnsn 2548  aceq6b 3565  sshjval3t 5327

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074

This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-un 1490  df-sn 1811  df-pr 1812

metamath.org