Theorem preq12i 4714

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

Hypotheses

Ref	Expression
preq1i.1	⊢ 𝐴 = 𝐵
preq12i.2	⊢ 𝐶 = 𝐷

Assertion

Ref	Expression
preq12i	⊢ {𝐴, 𝐶} = {𝐵, 𝐷}

Proof of Theorem preq12i

Step	Hyp	Ref	Expression
1		preq1i.1	. 2 ⊢ 𝐴 = 𝐵
2		preq12i.2	. 2 ⊢ 𝐶 = 𝐷
3		preq12 4711	. 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → {𝐴, 𝐶} = {𝐵, 𝐷})
4	1, 2, 3	mp2an 692	1 ⊢ {𝐴, 𝐶} = {𝐵, 𝐷}

Syntax hints:   = wceq 1540  {cpr 4603

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2707

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1543  df-ex 1780  df-sb 2065  df-clab 2714  df-cleq 2727  df-clel 2809  df-v 3461  df-un 3931  df-sn 4602  df-pr 4604

This theorem is referenced by:  grpbasex  17306  grpplusgx  17307  indistpsx  22948  lgsdir2lem5  27292  negs1s  27985  wlk2v2elem2  30137  tgrpset  40764  stgr0  47972  stgr1  47973  gpgprismgr4cycllem10  48103  zlmodzxzadd  48333  zlmodzxzequa  48472  zlmodzxzequap  48475