hashiun - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > hashiun		GIF version

Theorem hashiun 12032

Description: The cardinality of a disjoint indexed union. (Contributed by Mario Carneiro, 24-Jan-2015.) (Revised by Mario Carneiro, 10-Dec-2016.)

**Hypotheses**
Ref	Expression
fsumiun.1	⊢ (𝜑 → 𝐴 ∈ Fin)
fsumiun.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ Fin)
fsumiun.3	⊢ (𝜑 → Disj 𝑥 ∈ 𝐴 𝐵)

**Assertion**
Ref	Expression
hashiun	⊢ (𝜑 → (♯‘∪ 𝑥 ∈ 𝐴 𝐵) = Σ𝑥 ∈ 𝐴 (♯‘𝐵))

Distinct variable groups: 𝑥,𝐴 𝜑,𝑥 Allowed substitution hint: 𝐵(𝑥)

Proof of Theorem hashiun Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fsumiun.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ Fin)
2		fsumiun.2	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ Fin)
3		fsumiun.3	. . 3 ⊢ (𝜑 → Disj 𝑥 ∈ 𝐴 𝐵)
4		1cnd 8188	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑘 ∈ 𝐵)) → 1 ∈ ℂ)
5	1, 2, 3, 4	fsumiun 12031	. 2 ⊢ (𝜑 → Σ𝑘 ∈ ∪ 𝑥 ∈ 𝐴 𝐵1 = Σ𝑥 ∈ 𝐴 Σ𝑘 ∈ 𝐵 1)
6	2	ralrimiva 2603	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ∈ Fin)
7		iunfidisj 7139	. . . . 5 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ Fin ∧ Disj 𝑥 ∈ 𝐴 𝐵) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ Fin)
8	1, 6, 3, 7	syl3anc 1271	. . . 4 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ Fin)
9		ax-1cn 8118	. . . 4 ⊢ 1 ∈ ℂ
10		fsumconst 12008	. . . 4 ⊢ ((∪ 𝑥 ∈ 𝐴 𝐵 ∈ Fin ∧ 1 ∈ ℂ) → Σ𝑘 ∈ ∪ 𝑥 ∈ 𝐴 𝐵1 = ((♯‘∪ 𝑥 ∈ 𝐴 𝐵) · 1))
11	8, 9, 10	sylancl 413	. . 3 ⊢ (𝜑 → Σ𝑘 ∈ ∪ 𝑥 ∈ 𝐴 𝐵1 = ((♯‘∪ 𝑥 ∈ 𝐴 𝐵) · 1))
12		hashcl 11036	. . . 4 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ∈ Fin → (♯‘∪ 𝑥 ∈ 𝐴 𝐵) ∈ ℕ₀)
13		nn0cn 9405	. . . 4 ⊢ ((♯‘∪ 𝑥 ∈ 𝐴 𝐵) ∈ ℕ₀ → (♯‘∪ 𝑥 ∈ 𝐴 𝐵) ∈ ℂ)
14		mulrid 8169	. . . 4 ⊢ ((♯‘∪ 𝑥 ∈ 𝐴 𝐵) ∈ ℂ → ((♯‘∪ 𝑥 ∈ 𝐴 𝐵) · 1) = (♯‘∪ 𝑥 ∈ 𝐴 𝐵))
15	8, 12, 13, 14	4syl 18	. . 3 ⊢ (𝜑 → ((♯‘∪ 𝑥 ∈ 𝐴 𝐵) · 1) = (♯‘∪ 𝑥 ∈ 𝐴 𝐵))
16	11, 15	eqtrd 2262	. 2 ⊢ (𝜑 → Σ𝑘 ∈ ∪ 𝑥 ∈ 𝐴 𝐵1 = (♯‘∪ 𝑥 ∈ 𝐴 𝐵))
17		fsumconst 12008	. . . . 5 ⊢ ((𝐵 ∈ Fin ∧ 1 ∈ ℂ) → Σ𝑘 ∈ 𝐵 1 = ((♯‘𝐵) · 1))
18	2, 9, 17	sylancl 413	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → Σ𝑘 ∈ 𝐵 1 = ((♯‘𝐵) · 1))
19		hashcl 11036	. . . . 5 ⊢ (𝐵 ∈ Fin → (♯‘𝐵) ∈ ℕ₀)
20		nn0cn 9405	. . . . 5 ⊢ ((♯‘𝐵) ∈ ℕ₀ → (♯‘𝐵) ∈ ℂ)
21		mulrid 8169	. . . . 5 ⊢ ((♯‘𝐵) ∈ ℂ → ((♯‘𝐵) · 1) = (♯‘𝐵))
22	2, 19, 20, 21	4syl 18	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((♯‘𝐵) · 1) = (♯‘𝐵))
23	18, 22	eqtrd 2262	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → Σ𝑘 ∈ 𝐵 1 = (♯‘𝐵))
24	23	sumeq2dv 11922	. 2 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 Σ𝑘 ∈ 𝐵 1 = Σ𝑥 ∈ 𝐴 (♯‘𝐵))
25	5, 16, 24	3eqtr3d 2270	1 ⊢ (𝜑 → (♯‘∪ 𝑥 ∈ 𝐴 𝐵) = Σ𝑥 ∈ 𝐴 (♯‘𝐵))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 ∀wral 2508 ∪ ciun 3968 Disj wdisj 4062 ‘cfv 5324 (class class class)co 6013 Fincfn 6904 ℂcc 8023 1c1 8026 · cmul 8030 ℕ₀cn0 9395 ♯chash 11030 Σcsu 11907

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-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4202 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-iinf 4684 ax-cnex 8116 ax-resscn 8117 ax-1cn 8118 ax-1re 8119 ax-icn 8120 ax-addcl 8121 ax-addrcl 8122 ax-mulcl 8123 ax-mulrcl 8124 ax-addcom 8125 ax-mulcom 8126 ax-addass 8127 ax-mulass 8128 ax-distr 8129 ax-i2m1 8130 ax-0lt1 8131 ax-1rid 8132 ax-0id 8133 ax-rnegex 8134 ax-precex 8135 ax-cnre 8136 ax-pre-ltirr 8137 ax-pre-ltwlin 8138 ax-pre-lttrn 8139 ax-pre-apti 8140 ax-pre-ltadd 8141 ax-pre-mulgt0 8142 ax-pre-mulext 8143 ax-arch 8144 ax-caucvg 8145

This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-if 3604 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-disj 4063 df-br 4087 df-opab 4149 df-mpt 4150 df-tr 4186 df-id 4388 df-po 4391 df-iso 4392 df-iord 4461 df-on 4463 df-ilim 4464 df-suc 4466 df-iom 4687 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-isom 5333 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-recs 6466 df-irdg 6531 df-frec 6552 df-1o 6577 df-oadd 6581 df-er 6697 df-en 6905 df-dom 6906 df-fin 6907 df-pnf 8209 df-mnf 8210 df-xr 8211 df-ltxr 8212 df-le 8213 df-sub 8345 df-neg 8346 df-reap 8748 df-ap 8755 df-div 8846 df-inn 9137 df-2 9195 df-3 9196 df-4 9197 df-n0 9396 df-z 9473 df-uz 9749 df-q 9847 df-rp 9882 df-fz 10237 df-fzo 10371 df-seqfrec 10703 df-exp 10794 df-ihash 11031 df-cj 11396 df-re 11397 df-im 11398 df-rsqrt 11552 df-abs 11553 df-clim 11833 df-sumdc 11908

This theorem is referenced by: hash2iun 12033 hashrabrex 12035 hashuni 12036 phisum 12806 lgsquadlem1 15799 lgsquadlem2 15800

W3C validator