Theorem nelun 32485

Description: Negated membership for a union. (Contributed by Thierry Arnoux, 13-Dec-2023.)

Assertion

Ref	Expression
nelun	⊢ (𝐴 = (𝐵 ∪ 𝐶) → (¬ 𝑋 ∈ 𝐴 ↔ (¬ 𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ∈ 𝐶)))

Proof of Theorem nelun

Step	Hyp	Ref	Expression
1		eleq2 2820	. . . 4 ⊢ (𝐴 = (𝐵 ∪ 𝐶) → (𝑋 ∈ 𝐴 ↔ 𝑋 ∈ (𝐵 ∪ 𝐶)))
2		elun 4098	. . . 4 ⊢ (𝑋 ∈ (𝐵 ∪ 𝐶) ↔ (𝑋 ∈ 𝐵 ∨ 𝑋 ∈ 𝐶))
3	1, 2	bitrdi 287	. . 3 ⊢ (𝐴 = (𝐵 ∪ 𝐶) → (𝑋 ∈ 𝐴 ↔ (𝑋 ∈ 𝐵 ∨ 𝑋 ∈ 𝐶)))
4	3	notbid 318	. 2 ⊢ (𝐴 = (𝐵 ∪ 𝐶) → (¬ 𝑋 ∈ 𝐴 ↔ ¬ (𝑋 ∈ 𝐵 ∨ 𝑋 ∈ 𝐶)))
5		ioran 985	. 2 ⊢ (¬ (𝑋 ∈ 𝐵 ∨ 𝑋 ∈ 𝐶) ↔ (¬ 𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ∈ 𝐶))
6	4, 5	bitrdi 287	1 ⊢ (𝐴 = (𝐵 ∪ 𝐶) → (¬ 𝑋 ∈ 𝐴 ↔ (¬ 𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ∈ 𝐶)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   = wceq 1541   ∈ wcel 2111   ∪ 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-ext 2703

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1544  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-v 3438  df-un 3902

This theorem is referenced by:  cycpmco2  33094  elrgspnlem4  33204  rprmnz  33477  rprmnunit  33478  rsprprmprmidlb  33480  rprmirredb  33489