Theorem dmdju 33316

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 5903	. . 3 ⊢ dom ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) = ∪ 𝑥 ∈ 𝐴 dom ({𝑥} × 𝐵)
2		dmdju.1	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ≠ ∅)
3		dmxp 5919	. . . . 5 ⊢ (𝐵 ≠ ∅ → dom ({𝑥} × 𝐵) = {𝑥})
4	2, 3	syl 18	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → dom ({𝑥} × 𝐵) = {𝑥})
5	4	iuneq2dv 4979	. . 3 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 dom ({𝑥} × 𝐵) = ∪ 𝑥 ∈ 𝐴 {𝑥})
6	1, 5	eqtrid 2810	. 2 ⊢ (𝜑 → dom ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) = ∪ 𝑥 ∈ 𝐴 {𝑥})
7		iunid 5022	. 2 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑥} = 𝐴
8	6, 7	eqtrdi 2814	1 ⊢ (𝜑 → dom ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) = 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∅c0 4281  {csn 4588  ∪ ciun 4954   × cxp 5654  dom cdm 5656

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-11 2197  ax-ext 2735  ax-sep 5253  ax-pr 5396

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-iun 4956  df-br 5107  df-opab 5172  df-xp 5662  df-dm 5666

This theorem is used by:  gsumwrd2dccat  33715