Theorem preq12 3668

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 3666	. 2 |- ( A = C -> { A , B } = { C , B } )
2		preq2 3667	. 2 |- ( B = D -> { C , B } = { C , D } )
3	1, 2	sylan9eq 2228	1 |- ( ( A = C /\ B = D ) -> { A , B } = { C , D } )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1353   {cpr 3590

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 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-ext 2157

This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1459  df-sb 1761  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-v 2737  df-un 3131  df-sn 3595  df-pr 3596

This theorem is referenced by:  preq12i  3671  preq12d  3674  preq12b  3766  opthreg  4549  relop  4770  qtopbasss  13590