Theorem disjxun0 32721

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 4291	. . . . 5 ⊢ (𝐶 = ∅ → ¬ 𝑦 ∈ 𝐶)
3	1, 2	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ¬ 𝑦 ∈ 𝐶)
4	3	rmounid 32640	. . 3 ⊢ (𝜑 → (∃*𝑥 ∈ (𝐴 ∪ 𝐵)𝑦 ∈ 𝐶 ↔ ∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶))
5	4	albidv 1939	. 2 ⊢ (𝜑 → (∀𝑦∃*𝑥 ∈ (𝐴 ∪ 𝐵)𝑦 ∈ 𝐶 ↔ ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶))
6		df-disj 5067	. 2 ⊢ (Disj 𝑥 ∈ (𝐴 ∪ 𝐵)𝐶 ↔ ∀𝑦∃*𝑥 ∈ (𝐴 ∪ 𝐵)𝑦 ∈ 𝐶)
7		df-disj 5067	. 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)
8	5, 6, 7	3bitr4g 316	1 ⊢ (𝜑 → (Disj 𝑥 ∈ (𝐴 ∪ 𝐵)𝐶 ↔ Disj 𝑥 ∈ 𝐴 𝐶))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 399  ∀wal 1557   = wceq 1559   ∈ wcel 2141  ∃*wrmo 3365   ∪ cun 3902  ∅c0 4285  Disj wdisj 5066

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-mo 2565  df-clab 2740  df-cleq 2753  df-clel 2836  df-rmo 3366  df-v 3455  df-dif 3907  df-un 3909  df-nul 4286  df-disj 5067

This theorem is referenced by:  tocyccntz  33283