Theorem dmiun 5901

Description: The domain of an indexed union. (Contributed by Mario Carneiro, 26-Apr-2016.)

Assertion

Ref	Expression
dmiun	⊢ dom ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ 𝐴 dom 𝐵

Proof of Theorem dmiun

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rexcom4 3291	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑧⟨𝑦, 𝑧⟩ ∈ 𝐵 ↔ ∃𝑧∃𝑥 ∈ 𝐴 ⟨𝑦, 𝑧⟩ ∈ 𝐵)
2		vex 3457	. . . . . 6 ⊢ 𝑦 ∈ V
3	2	eldm2 5889	. . . . 5 ⊢ (𝑦 ∈ dom 𝐵 ↔ ∃𝑧⟨𝑦, 𝑧⟩ ∈ 𝐵)
4	3	rexbii 3111	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ dom 𝐵 ↔ ∃𝑥 ∈ 𝐴 ∃𝑧⟨𝑦, 𝑧⟩ ∈ 𝐵)
5		eliun 4958	. . . . 5 ⊢ (⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 ⟨𝑦, 𝑧⟩ ∈ 𝐵)
6	5	exbii 1881	. . . 4 ⊢ (∃𝑧⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑧∃𝑥 ∈ 𝐴 ⟨𝑦, 𝑧⟩ ∈ 𝐵)
7	1, 4, 6	3bitr4ri 307	. . 3 ⊢ (∃𝑧⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ dom 𝐵)
8	2	eldm2 5889	. . 3 ⊢ (𝑦 ∈ dom ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑧⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝐴 𝐵)
9		eliun 4958	. . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 dom 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ dom 𝐵)
10	7, 8, 9	3bitr4i 306	. 2 ⊢ (𝑦 ∈ dom ∪ 𝑥 ∈ 𝐴 𝐵 ↔ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 dom 𝐵)
11	10	eqriv 2759	1 ⊢ dom ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ 𝐴 dom 𝐵

This proof depends on syntax axioms:   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∃wrex 3088  ⟨cop 4593  ∪ ciun 4954  dom cdm 5659

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 2147  ax-9 2155  ax-11 2194  ax-ext 2734

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 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-iun 4956  df-br 5108  df-dm 5669

This theorem is used by:  dprd2d2  20174  dmdju  33107  gsumpart  33490  esum2d  34590  fmla  35947  iunrelexp0  44529