HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem difsnOLD 3126
Description: An element not in a set can be removed without affecting the set.
Assertion
Ref Expression
difsnOLD |- (-. A e. B -> (B \ {A}) = B)

Proof of Theorem difsnOLD
StepHypRef Expression
1 difss 2735 . . 3 |- (B \ {A}) C_ B
21a1i 8 . 2 |- (-. A e. B -> (B \ {A}) C_ B)
3 nelneq 1985 . . . . . . 7 |- ((x e. B /\ -. A e. B) -> -. x = A)
4 df-ne 2019 . . . . . . 7 |- (x =/= A <-> -. x = A)
53, 4sylibr 217 . . . . . 6 |- ((x e. B /\ -. A e. B) -> x =/= A)
65expcom 403 . . . . 5 |- (-. A e. B -> (x e. B -> x =/= A))
76ancld 322 . . . 4 |- (-. A e. B -> (x e. B -> (x e. B /\ x =/= A)))
8 eldifsn 3123 . . . 4 |- (x e. (B \ {A}) <-> (x e. B /\ x =/= A))
97, 8syl6ibr 230 . . 3 |- (-. A e. B -> (x e. B -> x e. (B \ {A})))
109ssrdv 2622 . 2 |- (-. A e. B -> B C_ (B \ {A}))
112, 10eqssd 2633 1 |- (-. A e. B -> (B \ {A}) = B)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   /\ wa 240   = wceq 1298   e. wcel 1300   =/= wne 2017   \ cdif 2590   C_ wss 2593  {csn 3044
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327  df-sb 1536  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-v 2294  df-dif 2597  df-in 2603  df-ss 2605  df-sn 3049
Copyright terms: Public domain