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

Theorem preq2 3785
Description: Equality theorem for unordered pairs. (Contributed by NM, 5-Aug-1993.)
Assertion
Ref Expression
preq2 (𝐴 = 𝐵 → {𝐶, 𝐴} = {𝐶, 𝐵})

Proof of Theorem preq2
StepHypRef Expression
1 preq1 3784 . 2 (𝐴 = 𝐵 → {𝐴, 𝐶} = {𝐵, 𝐶})
2 prcom 3783 . 2 {𝐶, 𝐴} = {𝐴, 𝐶}
3 prcom 3783 . 2 {𝐶, 𝐵} = {𝐵, 𝐶}
41, 2, 33eqtr4g 2296 1 (𝐴 = 𝐵 → {𝐶, 𝐴} = {𝐶, 𝐵})
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1402  {cpr 3706
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-un 3224  df-sn 3711  df-pr 3712
This theorem is referenced by:  preq12  3786  preq2i  3788  preq2d  3791  tpeq2  3794  ifpprsnssdc  3815  preq12bg  3893  opeq2  3900  uniprg  3945  intprg  3998  prexg  4344  opth  4372  opeqsn  4388  relop  4925  funopg  5406  en2  7102  prfidceq  7225  pr2ne  7528  pr1or2  7530  hashprg  11227  upgrex  16258  usgredg4  16370  usgredgreu  16371  uspgredg2vtxeu  16373  uspgredg2v  16376  ifpsnprss  16498  upgriswlkdc  16515  clwwlknonex2  16594  eupth2lem3lem4fi  16628  bj-prexg  16851
  Copyright terms: Public domain W3C validator