Theorem preq12 3770

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

Assertion

Ref	Expression
preq12	|- ( ( A = C /\ B = D ) -> { A , B } = { C , D } )

Proof of Theorem preq12

Step	Hyp	Ref	Expression
1		preq1 3768	. 2 |- ( A = C -> { A , B } = { C , B } )
2		preq2 3769	. 2 |- ( B = D -> { C , B } = { C , D } )
3	1, 2	sylan9eq 2285	1 |- ( ( A = C /\ B = D ) -> { A , B } = { C , D } )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1398   {cpr 3690

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-v 2815  df-un 3215  df-sn 3695  df-pr 3696

This theorem is referenced by:  preq12i  3773  preq12d  3776  ssprsseq  3856  preq12b  3874  elpr2elpr  3880  opthreg  4678  relop  4905  qtopbasss  15386  uspgr2wlkeq  16360  wlkres  16374