Theorem preq12i 4682

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 4679	. 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → {𝐴, 𝐶} = {𝐵, 𝐷})
4	1, 2, 3	mp2an 693	1 ⊢ {𝐴, 𝐶} = {𝐵, 𝐷}

Syntax hints:   = wceq 1542  {cpr 4569

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-v 3431  df-un 3894  df-sn 4568  df-pr 4570

This theorem is referenced by:  grpbasex  17255  grpplusgx  17256  indistpsx  22975  lgsdir2lem5  27292  neg1s  28019  wlk2v2elem2  30226  tgrpset  41191  nregmodelf1o  45442  stgr0  48436  stgr1  48437  gpgprismgr4cycllem10  48580  grlimedgnedg  48607  zlmodzxzadd  48834  zlmodzxzequa  48972  zlmodzxzequap  48975