iunmapdisj - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > iunmapdisj		Structured version Visualization version GIF version

Theorem iunmapdisj 10063

Description: The union ∪ 𝑛 ∈ 𝐶(𝐴 ↑_m 𝑛) is a disjoint union. (Contributed by Mario Carneiro, 17-May-2015.) (Revised by NM, 16-Jun-2017.)

**Assertion**
Ref	Expression
iunmapdisj	⊢ ∃*𝑛 ∈ 𝐶 𝐵 ∈ (𝐴 ↑_m 𝑛)

Distinct variable group: 𝐵,𝑛 Allowed substitution hints: 𝐴(𝑛) 𝐶(𝑛)

**Proof of Theorem iunmapdisj**
Step	Hyp	Ref	Expression
1		moeq 3713	. . . 4 ⊢ ∃*𝑛 𝑛 = dom 𝐵
2		elmapi 8889	. . . . . 6 ⊢ (𝐵 ∈ (𝐴 ↑_m 𝑛) → 𝐵:𝑛⟶𝐴)
3		fdm 6745	. . . . . . 7 ⊢ (𝐵:𝑛⟶𝐴 → dom 𝐵 = 𝑛)
4	3	eqcomd 2743	. . . . . 6 ⊢ (𝐵:𝑛⟶𝐴 → 𝑛 = dom 𝐵)
5	2, 4	syl 17	. . . . 5 ⊢ (𝐵 ∈ (𝐴 ↑_m 𝑛) → 𝑛 = dom 𝐵)
6	5	moimi 2545	. . . 4 ⊢ (∃𝑛 𝑛 = dom 𝐵 → ∃𝑛 𝐵 ∈ (𝐴 ↑_m 𝑛))
7	1, 6	ax-mp 5	. . 3 ⊢ ∃*𝑛 𝐵 ∈ (𝐴 ↑_m 𝑛)
8	7	moani 2553	. 2 ⊢ ∃*𝑛(𝑛 ∈ 𝐶 ∧ 𝐵 ∈ (𝐴 ↑_m 𝑛))
9		df-rmo 3380	. 2 ⊢ (∃𝑛 ∈ 𝐶 𝐵 ∈ (𝐴 ↑_m 𝑛) ↔ ∃𝑛(𝑛 ∈ 𝐶 ∧ 𝐵 ∈ (𝐴 ↑_m 𝑛)))
10	8, 9	mpbir 231	1 ⊢ ∃*𝑛 ∈ 𝐶 𝐵 ∈ (𝐴 ↑_m 𝑛)

Colors of variables: wff setvar class

Syntax hints: ∧ wa 395 = wceq 1540 ∈ wcel 2108 ∃*wmo 2538 ∃*wrmo 3379 dom cdm 5685 ⟶wf 6557 (class class class)co 7431 ↑_m cmap 8866

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ral 3062 df-rex 3071 df-rmo 3380 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-id 5578 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-fv 6569 df-ov 7434 df-oprab 7435 df-mpo 7436 df-1st 8014 df-2nd 8015 df-map 8868

This theorem is referenced by: (None)