Metamath Proof Explorer


Theorem elneldisj

Description: The set of elements s determining classes C (which may depend on s ) containing a special element and the set of elements s determining classes C 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)

Ref Expression
Hypotheses elneldisj.e ⊢ E = s ∈ A | B ∈ C
elneldisj.n ⊢ N = s ∈ A | B ∉ C
Assertion elneldisj ⊢ E ∩ N = ∅

Proof

Step Hyp Ref Expression
1 elneldisj.e ⊢ E = s ∈ A | B ∈ C
2 elneldisj.n ⊢ N = s ∈ A | B ∉ C
3 df-nel ⊢ B ∉ C ↔ ¬ B ∈ C
4 2 3 rabbieq ⊢ N = s ∈ A | ¬ B ∈ C
5 1 4 ineq12i ⊢ E ∩ N = s ∈ A | B ∈ C ∩ s ∈ A | ¬ B ∈ C
6 rabnc ⊢ s ∈ A | B ∈ C ∩ s ∈ A | ¬ B ∈ C = ∅
7 5 6 eqtri ⊢ E ∩ N = ∅