Theorem disjxun0 32949

Description: Simplify a disjoint union. (Contributed by Thierry Arnoux, 27-Nov-2023.)

Hypothesis

Ref	Expression
disjxun0.1	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐶 = ∅)

Assertion

Ref	Expression
disjxun0	⊢ (𝜑 → (Disj 𝑥 ∈ (𝐴 ∪ 𝐵)𝐶 ↔ Disj 𝑥 ∈ 𝐴 𝐶))

Distinct variable group:   𝜑,𝑥

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐶(𝑥)

Proof of Theorem disjxun0

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		disjxun0.1	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐶 = ∅)
2		nel02 4295	. . . . 5 ⊢ (𝐶 = ∅ → ¬ 𝑦 ∈ 𝐶)
3	1, 2	syl 18	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ¬ 𝑦 ∈ 𝐶)
4	3	rmounid 32871	. . 3 ⊢ (𝜑 → (∃*𝑥 ∈ (𝐴 ∪ 𝐵)𝑦 ∈ 𝐶 ↔ ∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶))
5	4	albidv 1953	. 2 ⊢ (𝜑 → (∀𝑦∃*𝑥 ∈ (𝐴 ∪ 𝐵)𝑦 ∈ 𝐶 ↔ ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶))
6		df-disj 5082	. 2 ⊢ (Disj 𝑥 ∈ (𝐴 ∪ 𝐵)𝐶 ↔ ∀𝑦∃*𝑥 ∈ (𝐴 ∪ 𝐵)𝑦 ∈ 𝐶)
7		df-disj 5082	. 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)
8	5, 6, 7	3bitr4g 317	1 ⊢ (𝜑 → (Disj 𝑥 ∈ (𝐴 ∪ 𝐵)𝐶 ↔ Disj 𝑥 ∈ 𝐴 𝐶))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2146  ∃*wrmo 3371   ∪ cun 3906  ∅c0 4289  Disj wdisj 5081

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-mo 2570  df-clab 2745  df-cleq 2758  df-clel 2841  df-rmo 3372  df-v 3460  df-dif 3911  df-un 3913  df-nul 4290  df-disj 5082

This theorem is used by:  tocyccntz  33488