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

Theorem difprsn2 4731
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 4665 . . 3 {𝐴, 𝐵} = {𝐵, 𝐴}
21difeq1i 4049 . 2 ({𝐴, 𝐵} ∖ {𝐵}) = ({𝐵, 𝐴} ∖ {𝐵})
3 necom 2996 . . 3 (𝐴𝐵𝐵𝐴)
4 difprsn1 4730 . . 3 (𝐵𝐴 → ({𝐵, 𝐴} ∖ {𝐵}) = {𝐴})
53, 4sylbi 216 . 2 (𝐴𝐵 → ({𝐵, 𝐴} ∖ {𝐵}) = {𝐴})
62, 5eqtrid 2790 1 (𝐴𝐵 → ({𝐴, 𝐵} ∖ {𝐵}) = {𝐴})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1539  wne 2942  cdif 3880  {csn 4558  {cpr 4560
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ne 2943  df-ral 3068  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-nul 4254  df-sn 4559  df-pr 4561
This theorem is referenced by:  f12dfv  7126  pmtrprfval  19010  nbgr2vtx1edg  27620  nbuhgr2vtx1edgb  27622  nfrgr2v  28537  cycpm2tr  31288  ldepsnlinc  45737
  Copyright terms: Public domain W3C validator