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

Theorem eldiftp 4584
Description: Membership in a set with three elements removed. Similar to eldifsn 4680 and eldifpr 4557. (Contributed by David A. Wheeler, 22-Jul-2017.)
Assertion
Ref Expression
eldiftp (𝐴 ∈ (𝐵 ∖ {𝐶, 𝐷, 𝐸}) ↔ (𝐴𝐵 ∧ (𝐴𝐶𝐴𝐷𝐴𝐸)))

Proof of Theorem eldiftp
StepHypRef Expression
1 eldif 3891 . 2 (𝐴 ∈ (𝐵 ∖ {𝐶, 𝐷, 𝐸}) ↔ (𝐴𝐵 ∧ ¬ 𝐴 ∈ {𝐶, 𝐷, 𝐸}))
2 eltpg 4583 . . . . 5 (𝐴𝐵 → (𝐴 ∈ {𝐶, 𝐷, 𝐸} ↔ (𝐴 = 𝐶𝐴 = 𝐷𝐴 = 𝐸)))
32notbid 321 . . . 4 (𝐴𝐵 → (¬ 𝐴 ∈ {𝐶, 𝐷, 𝐸} ↔ ¬ (𝐴 = 𝐶𝐴 = 𝐷𝐴 = 𝐸)))
4 ne3anior 3080 . . . 4 ((𝐴𝐶𝐴𝐷𝐴𝐸) ↔ ¬ (𝐴 = 𝐶𝐴 = 𝐷𝐴 = 𝐸))
53, 4syl6bbr 292 . . 3 (𝐴𝐵 → (¬ 𝐴 ∈ {𝐶, 𝐷, 𝐸} ↔ (𝐴𝐶𝐴𝐷𝐴𝐸)))
65pm5.32i 578 . 2 ((𝐴𝐵 ∧ ¬ 𝐴 ∈ {𝐶, 𝐷, 𝐸}) ↔ (𝐴𝐵 ∧ (𝐴𝐶𝐴𝐷𝐴𝐸)))
71, 6bitri 278 1 (𝐴 ∈ (𝐵 ∖ {𝐶, 𝐷, 𝐸}) ↔ (𝐴𝐵 ∧ (𝐴𝐶𝐴𝐷𝐴𝐸)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 209  wa 399  w3o 1083  w3a 1084   = wceq 1538  wcel 2111  wne 2987  cdif 3878  {ctp 4529
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-ext 2770
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-ne 2988  df-v 3443  df-dif 3884  df-un 3886  df-sn 4526  df-pr 4528  df-tp 4530
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator