ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  preq12 Unicode version

Theorem preq12 3750
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
StepHypRef Expression
1 preq1 3748 . 2  |-  ( A  =  C  ->  { A ,  B }  =  { C ,  B }
)
2 preq2 3749 . 2  |-  ( B  =  D  ->  { C ,  B }  =  { C ,  D }
)
31, 2sylan9eq 2284 1  |-  ( ( A  =  C  /\  B  =  D )  ->  { A ,  B }  =  { C ,  D } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1397   {cpr 3670
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-v 2804  df-un 3204  df-sn 3675  df-pr 3676
This theorem is referenced by:  preq12i  3753  preq12d  3756  ssprsseq  3835  preq12b  3853  elpr2elpr  3859  opthreg  4654  relop  4880  qtopbasss  15244  uspgr2wlkeq  16215  wlkres  16229
  Copyright terms: Public domain W3C validator