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 9939

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 3654	. . . 4 ⊢ ∃*𝑛 𝑛 = dom 𝐵
2		elmapi 8790	. . . . . 6 ⊢ (𝐵 ∈ (𝐴 ↑_m 𝑛) → 𝐵:𝑛⟶𝐴)
3		fdm 6672	. . . . . . 7 ⊢ (𝐵:𝑛⟶𝐴 → dom 𝐵 = 𝑛)
4	3	eqcomd 2743	. . . . . 6 ⊢ (𝐵:𝑛⟶𝐴 → 𝑛 = dom 𝐵)
5	2, 4	syl 17	. . . . 5 ⊢ (𝐵 ∈ (𝐴 ↑_m 𝑛) → 𝑛 = dom 𝐵)
6	5	moimi 2546	. . . 4 ⊢ (∃𝑛 𝑛 = dom 𝐵 → ∃𝑛 𝐵 ∈ (𝐴 ↑_m 𝑛))
7	1, 6	ax-mp 5	. . 3 ⊢ ∃*𝑛 𝐵 ∈ (𝐴 ↑_m 𝑛)
8	7	moani 2554	. 2 ⊢ ∃*𝑛(𝑛 ∈ 𝐶 ∧ 𝐵 ∈ (𝐴 ↑_m 𝑛))
9		df-rmo 3343	. 2 ⊢ (∃𝑛 ∈ 𝐶 𝐵 ∈ (𝐴 ↑_m 𝑛) ↔ ∃𝑛(𝑛 ∈ 𝐶 ∧ 𝐵 ∈ (𝐴 ↑_m 𝑛)))
10	8, 9	mpbir 231	1 ⊢ ∃*𝑛 ∈ 𝐶 𝐵 ∈ (𝐴 ↑_m 𝑛)

Colors of variables: wff setvar class

Syntax hints: ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∃*wmo 2538 ∃*wrmo 3342 dom cdm 5625 ⟶wf 6489 (class class class)co 7361 ↑_m cmap 8767

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3343 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-fv 6501 df-ov 7364 df-oprab 7365 df-mpo 7366 df-1st 7936 df-2nd 7937 df-map 8769

This theorem is referenced by: (None)