Theorem preq2 3475

Description: Equality theorem for unordered pairs. (Contributed by NM, 5-Aug-1993.)

Assertion

Ref	Expression
preq2	⊢ (𝐴 = 𝐵 → {𝐶, 𝐴} = {𝐶, 𝐵})

Proof of Theorem preq2

Step	Hyp	Ref	Expression
1		preq1 3474	. 2 ⊢ (𝐴 = 𝐵 → {𝐴, 𝐶} = {𝐵, 𝐶})
2		prcom 3473	. 2 ⊢ {𝐶, 𝐴} = {𝐴, 𝐶}
3		prcom 3473	. 2 ⊢ {𝐶, 𝐵} = {𝐵, 𝐶}
4	1, 2, 3	3eqtr4g 2113	1 ⊢ (𝐴 = 𝐵 → {𝐶, 𝐴} = {𝐶, 𝐵})

Syntax hints:   → wi 4   = wceq 1259  {cpr 3403

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038

This theorem depends on definitions:  df-bi 114  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-v 2576  df-un 2949  df-sn 3408  df-pr 3409

This theorem is referenced by:  preq12  3476  preq2i  3478  preq2d  3481  tpeq2  3484  preq12bg  3571  opeq2  3577  uniprg  3622  intprg  3675  prexgOLD  3973  prexg  3974  opth  4001  opeqsn  4016  relop  4513  funopg  4961  bj-prexg  10390