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

Theorem elneldisj 4349
Description: The set of elements 𝑠 determining classes 𝐶 (which may depend on 𝑠) containing a special element and the set of elements 𝑠 determining classes 𝐶 not containing the special element are disjoint. (Contributed by Alexander van der Vekens, 11-Jan-2018.) (Revised by AV, 9-Nov-2020.) (Revised by AV, 17-Dec-2021.)
Hypotheses
Ref Expression
elneldisj.e 𝐸 = {𝑠𝐴𝐵𝐶}
elneldisj.n 𝑁 = {𝑠𝐴𝐵𝐶}
Assertion
Ref Expression
elneldisj (𝐸𝑁) = ∅
Distinct variable group:   𝐴,𝑠
Allowed substitution hints:   𝐵(𝑠)   𝐶(𝑠)   𝐸(𝑠)   𝑁(𝑠)

Proof of Theorem elneldisj
StepHypRef Expression
1 elneldisj.e . . 3 𝐸 = {𝑠𝐴𝐵𝐶}
2 elneldisj.n . . . 4 𝑁 = {𝑠𝐴𝐵𝐶}
3 df-nel 3065 . . . 4 (𝐵𝐶 ↔ ¬ 𝐵𝐶)
42, 3rabbieq 3424 . . 3 𝑁 = {𝑠𝐴 ∣ ¬ 𝐵𝐶}
51, 4ineq12i 4171 . 2 (𝐸𝑁) = ({𝑠𝐴𝐵𝐶} ∩ {𝑠𝐴 ∣ ¬ 𝐵𝐶})
6 rabnc 4348 . 2 ({𝑠𝐴𝐵𝐶} ∩ {𝑠𝐴 ∣ ¬ 𝐵𝐶}) = ∅
75, 6eqtri 2786 1 (𝐸𝑁) = ∅
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1570  wcel 2143  wnel 3064  {crab 3416  cin 3904  c0 4286
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-nel 3065  df-ral 3080  df-rab 3417  df-v 3457  df-dif 3908  df-in 3912  df-nul 4287
This theorem is referenced by:  cusgrsizeinds  29802  vtxdginducedm1  29893
  Copyright terms: Public domain W3C validator