![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > elnelun | Structured version Visualization version GIF version |
Description: The union of 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 yields the original set. (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 |
---|---|
elnelun | ⊢ (𝐸 ∪ 𝑁) = 𝐴 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elneldisj.e | . . 3 ⊢ 𝐸 = {𝑠 ∈ 𝐴 ∣ 𝐵 ∈ 𝐶} | |
2 | elneldisj.n | . . . 4 ⊢ 𝑁 = {𝑠 ∈ 𝐴 ∣ 𝐵 ∉ 𝐶} | |
3 | df-nel 3047 | . . . . 5 ⊢ (𝐵 ∉ 𝐶 ↔ ¬ 𝐵 ∈ 𝐶) | |
4 | 3 | rabbii 3412 | . . . 4 ⊢ {𝑠 ∈ 𝐴 ∣ 𝐵 ∉ 𝐶} = {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶} |
5 | 2, 4 | eqtri 2761 | . . 3 ⊢ 𝑁 = {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶} |
6 | 1, 5 | uneq12i 4122 | . 2 ⊢ (𝐸 ∪ 𝑁) = ({𝑠 ∈ 𝐴 ∣ 𝐵 ∈ 𝐶} ∪ {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶}) |
7 | rabxm 4347 | . 2 ⊢ 𝐴 = ({𝑠 ∈ 𝐴 ∣ 𝐵 ∈ 𝐶} ∪ {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶}) | |
8 | 6, 7 | eqtr4i 2764 | 1 ⊢ (𝐸 ∪ 𝑁) = 𝐴 |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 = wceq 1542 ∈ wcel 2107 ∉ wnel 3046 {crab 3406 ∪ cun 3909 |
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 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-tru 1545 df-ex 1783 df-nf 1787 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-nel 3047 df-ral 3062 df-rab 3407 df-v 3446 df-un 3916 |
This theorem is referenced by: usgrfilem 28317 cusgrsizeinds 28442 vtxdginducedm1 28533 |
Copyright terms: Public domain | W3C validator |