Theorem nelun 33163

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 2852	. . . 4 ⊢ (𝐴 = (𝐵 ∪ 𝐶) → (𝑋 ∈ 𝐴 ↔ 𝑋 ∈ (𝐵 ∪ 𝐶)))
2		elun 4154	. . . 4 ⊢ (𝑋 ∈ (𝐵 ∪ 𝐶) ↔ (𝑋 ∈ 𝐵 ∨ 𝑋 ∈ 𝐶))
3	1, 2	bitrdi 290	. . 3 ⊢ (𝐴 = (𝐵 ∪ 𝐶) → (𝑋 ∈ 𝐴 ↔ (𝑋 ∈ 𝐵 ∨ 𝑋 ∈ 𝐶)))
4	3	notbid 321	. 2 ⊢ (𝐴 = (𝐵 ∪ 𝐶) → (¬ 𝑋 ∈ 𝐴 ↔ ¬ (𝑋 ∈ 𝐵 ∨ 𝑋 ∈ 𝐶)))
5		ioran 999	. 2 ⊢ (¬ (𝑋 ∈ 𝐵 ∨ 𝑋 ∈ 𝐶) ↔ (¬ 𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ∈ 𝐶))
6	4, 5	bitrdi 290	1 ⊢ (𝐴 = (𝐵 ∪ 𝐶) → (¬ 𝑋 ∈ 𝐴 ↔ (¬ 𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ∈ 𝐶)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1569   ∈ wcel 2146   ∪ cun 4151

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-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-v 3455  df-un 4153

This theorem is used by:  cycpmco2  33747  elrgspnlem4  33859  rprmnz  34105  rprmnunit  34106  rsprprmprmidlb  34108  rprmirredb  34117