Theorem preq12i 4704

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

Syntax hints:   = wceq 1570  {cpr 4591

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1573  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-v 3457  df-un 3910  df-sn 4590  df-pr 4592

This theorem is referenced by:  grpbasex  17340  grpplusgx  17341  indistpsx  23167  lgsdir2lem5  27493  neg1s  28220  wlk2v2elem2  30507  tgrpset  41519  nregmodelf1o  45724  stgr0  48725  stgr1  48726  gpgprismgr4cycllem10  48869  grlimedgnedg  48896  zlmodzxzadd  49138  zlmodzxzequa  49276  zlmodzxzequap  49279