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

Theorem elneldisj 4342
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 3063 . . . 4 (𝐵 ∉ 𝐶 ↔ ¬ 𝐵 ∈ 𝐶)
42, 3rabbieq 3421 . . 3 𝑁 = {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶}
51, 4ineq12i 4164 . 2 (𝐸 ∩ 𝑁) = ({𝑠 ∈ 𝐴 ∣ 𝐵 ∈ 𝐶} ∩ {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶})
6 rabnc 4341 . 2 ({𝑠 ∈ 𝐴 ∣ 𝐵 ∈ 𝐶} ∩ {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶}) = ∅
75, 6eqtri 2784 1 (𝐸 ∩ 𝑁) = ∅
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2145   ∉ wnel 3062  {crab 3413   ∩ cin 3898  ∅c0 4279
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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-nel 3063  df-ral 3078  df-rab 3414  df-v 3453  df-dif 3902  df-in 3906  df-nul 4280
This theorem is used by:  cusgrsizeinds  30033  vtxdginducedm1  30124
  Copyright terms: Public domain W3C validator