Theorem dmiun 4964

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 2836	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑧⟨𝑦, 𝑧⟩ ∈ 𝐵 ↔ ∃𝑧∃𝑥 ∈ 𝐴 ⟨𝑦, 𝑧⟩ ∈ 𝐵)
2		vex 2815	. . . . . 6 ⊢ 𝑦 ∈ V
3	2	eldm2 4953	. . . . 5 ⊢ (𝑦 ∈ dom 𝐵 ↔ ∃𝑧⟨𝑦, 𝑧⟩ ∈ 𝐵)
4	3	rexbii 2549	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ dom 𝐵 ↔ ∃𝑥 ∈ 𝐴 ∃𝑧⟨𝑦, 𝑧⟩ ∈ 𝐵)
5		eliun 3994	. . . . 5 ⊢ (⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 ⟨𝑦, 𝑧⟩ ∈ 𝐵)
6	5	exbii 1654	. . . 4 ⊢ (∃𝑧⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑧∃𝑥 ∈ 𝐴 ⟨𝑦, 𝑧⟩ ∈ 𝐵)
7	1, 4, 6	3bitr4ri 213	. . 3 ⊢ (∃𝑧⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ dom 𝐵)
8	2	eldm2 4953	. . 3 ⊢ (𝑦 ∈ dom ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑧⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝐴 𝐵)
9		eliun 3994	. . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 dom 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ dom 𝐵)
10	7, 8, 9	3bitr4i 212	. 2 ⊢ (𝑦 ∈ dom ∪ 𝑥 ∈ 𝐴 𝐵 ↔ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 dom 𝐵)
11	10	eqriv 2229	1 ⊢ dom ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ 𝐴 dom 𝐵

Syntax hints:   = wceq 1398  ∃wex 1541   ∈ wcel 2203  ∃wrex 2521  ⟨cop 3691  ∪ ciun 3990  dom cdm 4748

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2814  df-un 3214  df-sn 3694  df-pr 3695  df-op 3697  df-iun 3992  df-br 4109  df-dm 4758

This theorem is referenced by:  ennnfonelemdm  13160