Theorem elnelun 4338

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 3033	. . . . 5 ⊢ (𝐵 ∉ 𝐶 ↔ ¬ 𝐵 ∈ 𝐶)
4	3	rabbii 3400	. . . 4 ⊢ {𝑠 ∈ 𝐴 ∣ 𝐵 ∉ 𝐶} = {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶}
5	2, 4	eqtri 2754	. . 3 ⊢ 𝑁 = {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶}
6	1, 5	uneq12i 4111	. 2 ⊢ (𝐸 ∪ 𝑁) = ({𝑠 ∈ 𝐴 ∣ 𝐵 ∈ 𝐶} ∪ {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶})
7		rabxm 4335	. 2 ⊢ 𝐴 = ({𝑠 ∈ 𝐴 ∣ 𝐵 ∈ 𝐶} ∪ {𝑠 ∈ 𝐴 ∣ ¬ 𝐵 ∈ 𝐶})
8	6, 7	eqtr4i 2757	1 ⊢ (𝐸 ∪ 𝑁) = 𝐴

Syntax hints:  ¬ wn 3   = wceq 1541   ∈ wcel 2111   ∉ wnel 3032  {crab 3395   ∪ cun 3895

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-12 2180  ax-ext 2703

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1544  df-ex 1781  df-nf 1785  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-nel 3033  df-ral 3048  df-rab 3396  df-v 3438  df-un 3902

This theorem is referenced by:  usgrfilem  29300  cusgrsizeinds  29426  vtxdginducedm1  29517