MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  difprsn2 Structured version   Visualization version   GIF version

Theorem difprsn2 4755
Description: Removal of a singleton from an unordered pair. (Contributed by Alexander van der Vekens, 5-Oct-2017.)
Assertion
Ref Expression
difprsn2 (𝐴𝐵 → ({𝐴, 𝐵} ∖ {𝐵}) = {𝐴})

Proof of Theorem difprsn2
StepHypRef Expression
1 prcom 4686 . . 3 {𝐴, 𝐵} = {𝐵, 𝐴}
21difeq1i 4075 . 2 ({𝐴, 𝐵} ∖ {𝐵}) = ({𝐵, 𝐴} ∖ {𝐵})
3 necom 2978 . . 3 (𝐴𝐵𝐵𝐴)
4 difprsn1 4754 . . 3 (𝐵𝐴 → ({𝐵, 𝐴} ∖ {𝐵}) = {𝐴})
53, 4sylbi 217 . 2 (𝐴𝐵 → ({𝐵, 𝐴} ∖ {𝐵}) = {𝐴})
62, 5eqtrid 2776 1 (𝐴𝐵 → ({𝐴, 𝐵} ∖ {𝐵}) = {𝐴})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1540  wne 2925  cdif 3902  {csn 4579  {cpr 4581
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ne 2926  df-ral 3045  df-rab 3397  df-v 3440  df-dif 3908  df-un 3910  df-in 3912  df-nul 4287  df-sn 4580  df-pr 4582
This theorem is referenced by:  f12dfv  7214  pmtrprfval  19384  nbgr2vtx1edg  29313  nbuhgr2vtx1edgb  29315  nfrgr2v  30234  indsupp  32823  cycpm2tr  33074  drngmxidl  33424  ldepsnlinc  48494
  Copyright terms: Public domain W3C validator