Theorem dmdju 32725

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 5862	. . 3 ⊢ dom ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) = ∪ 𝑥 ∈ 𝐴 dom ({𝑥} × 𝐵)
2		dmdju.1	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ≠ ∅)
3		dmxp 5878	. . . . 5 ⊢ (𝐵 ≠ ∅ → dom ({𝑥} × 𝐵) = {𝑥})
4	2, 3	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → dom ({𝑥} × 𝐵) = {𝑥})
5	4	iuneq2dv 4971	. . 3 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 dom ({𝑥} × 𝐵) = ∪ 𝑥 ∈ 𝐴 {𝑥})
6	1, 5	eqtrid 2783	. 2 ⊢ (𝜑 → dom ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) = ∪ 𝑥 ∈ 𝐴 {𝑥})
7		iunid 5016	. 2 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑥} = 𝐴
8	6, 7	eqtrdi 2787	1 ⊢ (𝜑 → dom ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) = 𝐴)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2113   ≠ wne 2932  ∅c0 4285  {csn 4580  ∪ ciun 4946   × cxp 5622  dom cdm 5624

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 2115  ax-9 2123  ax-11 2162  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-iun 4948  df-br 5099  df-opab 5161  df-xp 5630  df-dm 5634

This theorem is referenced by:  gsumwrd2dccat  33160