Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > elneldisj | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
elneldisj.e | ⊢ 𝐸 = {𝑠 ∈ 𝐴 ∣ 𝐵 ∈ 𝐶} |
elneldisj.n | ⊢ 𝑁 = {𝑠 ∈ 𝐴 ∣ 𝐵 ∉ 𝐶} |
Ref | Expression |
---|---|
elneldisj | ⊢ (𝐸 ∩ 𝑁) = ∅ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elneldisj.e | . . 3 ⊢ 𝐸 = {𝑠 ∈ 𝐴 ∣ 𝐵 ∈ 𝐶} | |
2 | elneldisj.n | . . . 4 ⊢ 𝑁 = {𝑠 ∈ 𝐴 ∣ 𝐵 ∉ 𝐶} | |
3 | df-nel 3050 | . . . . 5 ⊢ (𝐵 ∉ 𝐶 ↔ ¬ 𝐵 ∈ 𝐶) | |
4 | 3 | rabbii 3408 | . . . 4 ⊢ {𝑠 ∈ 𝐴 ∣ 𝐵 ∉ 𝐶} = {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶} |
5 | 2, 4 | eqtri 2766 | . . 3 ⊢ 𝑁 = {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶} |
6 | 1, 5 | ineq12i 4144 | . 2 ⊢ (𝐸 ∩ 𝑁) = ({𝑠 ∈ 𝐴 ∣ 𝐵 ∈ 𝐶} ∩ {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶}) |
7 | rabnc 4321 | . 2 ⊢ ({𝑠 ∈ 𝐴 ∣ 𝐵 ∈ 𝐶} ∩ {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶}) = ∅ | |
8 | 6, 7 | eqtri 2766 | 1 ⊢ (𝐸 ∩ 𝑁) = ∅ |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 = wceq 1539 ∈ wcel 2106 ∉ wnel 3049 {crab 3068 ∩ cin 3886 ∅c0 4256 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-nel 3050 df-ral 3069 df-rab 3073 df-v 3434 df-dif 3890 df-in 3894 df-nul 4257 |
This theorem is referenced by: cusgrsizeinds 27819 vtxdginducedm1 27910 |
Copyright terms: Public domain | W3C validator |