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

Theorem difsn 4761
Description: An element not in a set can be removed without affecting the set. (Contributed by NM, 16-Mar-2006.) (Proof shortened by Andrew Salmon, 29-Jun-2011.)
Assertion
Ref Expression
difsn 𝐴𝐵 → (𝐵 ∖ {𝐴}) = 𝐵)

Proof of Theorem difsn
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 eldifsn 4748 . . 3 (𝑥 ∈ (𝐵 ∖ {𝐴}) ↔ (𝑥𝐵𝑥𝐴))
2 simpl 488 . . . 4 ((𝑥𝐵𝑥𝐴) → 𝑥𝐵)
3 nelelne 3056 . . . . 5 𝐴𝐵 → (𝑥𝐵𝑥𝐴))
43ancld 560 . . . 4 𝐴𝐵 → (𝑥𝐵 → (𝑥𝐵𝑥𝐴)))
52, 4impbid2 229 . . 3 𝐴𝐵 → ((𝑥𝐵𝑥𝐴) ↔ 𝑥𝐵))
61, 5bitrid 286 . 2 𝐴𝐵 → (𝑥 ∈ (𝐵 ∖ {𝐴}) ↔ 𝑥𝐵))
76eqrdv 2758 1 𝐴𝐵 → (𝐵 ∖ {𝐴}) = 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 401   = wceq 1570  wcel 2145  wne 2955  cdif 3896  {csn 4584
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-v 3452  df-dif 3902  df-sn 4585
This theorem is used by:  difsnb  4769  difsnexi  7761  domdifsn  9061  domunsncan  9078  frfi  9258  infdifsn  9639  dfn2  12544  hashgt23el  14492  chnccat  18717  lindsenlbs  22067  clslp  23376  xrge00  33457  lindsadd  38370  poimirlem2  38374  poimirlem4  38376  poimirlem6  38378  poimirlem7  38379  poimirlem8  38380  poimirlem19  38391  poimirlem23  38395  supxrmnf2  46264  infxrpnf2  46294  dvmptfprodlem  46775  hoiprodp1  47419
  Copyright terms: Public domain W3C validator