Theorem elnelun 4347

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.)

Hypotheses

Ref	Expression
elneldisj.e	⊢ 𝐸 = {𝑠 ∈ 𝐴 ∣ 𝐵 ∈ 𝐶}
elneldisj.n	⊢ 𝑁 = {𝑠 ∈ 𝐴 ∣ 𝐵 ∉ 𝐶}

Assertion

Ref	Expression
elnelun	⊢ (𝐸 ∪ 𝑁) = 𝐴

Distinct variable group:   𝐴,𝑠

Allowed substitution hints:   𝐵(𝑠)   𝐶(𝑠)   𝐸(𝑠)   𝑁(𝑠)

Proof of Theorem elnelun

Step	Hyp	Ref	Expression
1		elneldisj.e	. . 3 ⊢ 𝐸 = {𝑠 ∈ 𝐴 ∣ 𝐵 ∈ 𝐶}
2		elneldisj.n	. . . 4 ⊢ 𝑁 = {𝑠 ∈ 𝐴 ∣ 𝐵 ∉ 𝐶}
3		df-nel 3062	. . . 4 ⊢ (𝐵 ∉ 𝐶 ↔ ¬ 𝐵 ∈ 𝐶)
4	2, 3	rabbieq 3422	. . 3 ⊢ 𝑁 = {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶}
5	1, 4	uneq12i 4119	. 2 ⊢ (𝐸 ∪ 𝑁) = ({𝑠 ∈ 𝐴 ∣ 𝐵 ∈ 𝐶} ∪ {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶})
6		rabxm 4344	. 2 ⊢ 𝐴 = ({𝑠 ∈ 𝐴 ∣ 𝐵 ∈ 𝐶} ∪ {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶})
7	5, 6	eqtr4i 2788	1 ⊢ (𝐸 ∪ 𝑁) = 𝐴

Syntax hints:  ¬ wn 3   = wceq 1560   ∈ wcel 2142   ∉ wnel 3061  {crab 3414   ∪ cun 3902

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-12 2212  ax-ext 2734

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-tru 1563  df-ex 1800  df-nf 1804  df-sb 2091  df-clab 2741  df-cleq 2754  df-clel 2837  df-nel 3062  df-ral 3077  df-rab 3415  df-v 3456  df-un 3909

This theorem is referenced by:  usgrfilem  29528  cusgrsizeinds  29653  vtxdginducedm1  29744