Theorem dmdju 33288

Description: Domain of a disjoint union of non-empty sets. (Contributed by Thierry Arnoux, 5-Oct-2025.)

Hypothesis

Ref	Expression
dmdju.1	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ≠ ∅)

Assertion

Ref	Expression
dmdju	⊢ (𝜑 → dom ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) = 𝐴)

Distinct variable groups:   𝑥,𝐴   𝜑,𝑥

Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem dmdju

Step	Hyp	Ref	Expression
1		dmiun 5894	. . 3 ⊢ dom ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) = ∪ 𝑥 ∈ 𝐴 dom ({𝑥} × 𝐵)
2		dmdju.1	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ≠ ∅)
3		dmxp 5910	. . . . 5 ⊢ (𝐵 ≠ ∅ → dom ({𝑥} × 𝐵) = {𝑥})
4	2, 3	syl 18	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → dom ({𝑥} × 𝐵) = {𝑥})
5	4	iuneq2dv 4975	. . 3 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 dom ({𝑥} × 𝐵) = ∪ 𝑥 ∈ 𝐴 {𝑥})
6	1, 5	eqtrid 2807	. 2 ⊢ (𝜑 → dom ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) = ∪ 𝑥 ∈ 𝐴 {𝑥})
7		iunid 5018	. 2 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑥} = 𝐴
8	6, 7	eqtrdi 2811	1 ⊢ (𝜑 → dom ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) = 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∅c0 4278  {csn 4584  ∪ ciun 4950   × cxp 5648  dom cdm 5650

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 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-11 2193  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-iun 4952  df-br 5103  df-opab 5167  df-xp 5656  df-dm 5660

This theorem is used by:  gsumwrd2dccat  33685