| 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 3065 | . . . 4 ⊢ (𝐵 ∉ 𝐶 ↔ ¬ 𝐵 ∈ 𝐶) | |
| 4 | 2, 3 | rabbieq 3423 | . . 3 ⊢ 𝑁 = {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶} |
| 5 | 1, 4 | ineq12i 4117 | . 2 ⊢ (𝐸 ∩ 𝑁) = ({𝑠 ∈ 𝐴 ∣ 𝐵 ∈ 𝐶} ∩ {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶}) |
| 6 | rabnc 4343 | . 2 ⊢ ({𝑠 ∈ 𝐴 ∣ 𝐵 ∈ 𝐶} ∩ {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶}) = ∅ | |
| 7 | 5, 6 | eqtri 2786 | 1 ⊢ (𝐸 ∩ 𝑁) = ∅ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1569 ∈ wcel 2146 ∉ wnel 3064 {crab 3415 ∩ cin 4091 ∅c0 4280 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-clab 2742 df-cleq 2755 df-clel 2838 df-nel 3065 df-ral 3080 df-rab 3416 df-v 3455 df-dif 4049 df-in 4093 df-nul 4281 |
| This theorem is used by: cusgrsizeinds 30045 vtxdginducedm1 30136 |
| Copyright terms: Public domain | W3C validator |