| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hash2iun1dif1 | Structured version Visualization version GIF version | ||
| Description: The cardinality of a nested disjoint indexed union. (Contributed by AV, 9-Jan-2022.) |
| Ref | Expression |
|---|---|
| hash2iun1dif1.a | ⊢ (𝜑 → 𝐴 ∈ Fin) |
| hash2iun1dif1.b | ⊢ 𝐵 = (𝐴 ∖ {𝑥}) |
| hash2iun1dif1.c | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝐶 ∈ Fin) |
| hash2iun1dif1.da | ⊢ (𝜑 → Disj 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 𝐶) |
| hash2iun1dif1.db | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → Disj 𝑦 ∈ 𝐵 𝐶) |
| hash2iun1dif1.1 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (♯‘𝐶) = 1) |
| Ref | Expression |
|---|---|
| hash2iun1dif1 | ⊢ (𝜑 → (♯‘∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 𝐶) = ((♯‘𝐴) · ((♯‘𝐴) − 1))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hash2iun1dif1.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
| 2 | hash2iun1dif1.b | . . . 4 ⊢ 𝐵 = (𝐴 ∖ {𝑥}) | |
| 3 | diffi 9084 | . . . . . 6 ⊢ (𝐴 ∈ Fin → (𝐴 ∖ {𝑥}) ∈ Fin) | |
| 4 | 1, 3 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝐴 ∖ {𝑥}) ∈ Fin) |
| 5 | 4 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐴 ∖ {𝑥}) ∈ Fin) |
| 6 | 2, 5 | eqeltrid 2835 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ Fin) |
| 7 | hash2iun1dif1.c | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝐶 ∈ Fin) | |
| 8 | hash2iun1dif1.da | . . 3 ⊢ (𝜑 → Disj 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 𝐶) | |
| 9 | hash2iun1dif1.db | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → Disj 𝑦 ∈ 𝐵 𝐶) | |
| 10 | 1, 6, 7, 8, 9 | hash2iun 15730 | . 2 ⊢ (𝜑 → (♯‘∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 𝐶) = Σ𝑥 ∈ 𝐴 Σ𝑦 ∈ 𝐵 (♯‘𝐶)) |
| 11 | hash2iun1dif1.1 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (♯‘𝐶) = 1) | |
| 12 | 11 | 2sumeq2dv 15612 | . 2 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 Σ𝑦 ∈ 𝐵 (♯‘𝐶) = Σ𝑥 ∈ 𝐴 Σ𝑦 ∈ 𝐵 1) |
| 13 | 1cnd 11107 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 1 ∈ ℂ) | |
| 14 | fsumconst 15697 | . . . . 5 ⊢ ((𝐵 ∈ Fin ∧ 1 ∈ ℂ) → Σ𝑦 ∈ 𝐵 1 = ((♯‘𝐵) · 1)) | |
| 15 | 6, 13, 14 | syl2anc 584 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → Σ𝑦 ∈ 𝐵 1 = ((♯‘𝐵) · 1)) |
| 16 | 15 | sumeq2dv 15609 | . . 3 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 Σ𝑦 ∈ 𝐵 1 = Σ𝑥 ∈ 𝐴 ((♯‘𝐵) · 1)) |
| 17 | 2 | a1i 11 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = (𝐴 ∖ {𝑥})) |
| 18 | 17 | fveq2d 6826 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (♯‘𝐵) = (♯‘(𝐴 ∖ {𝑥}))) |
| 19 | hashdifsn 14321 | . . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝐴) → (♯‘(𝐴 ∖ {𝑥})) = ((♯‘𝐴) − 1)) | |
| 20 | 1, 19 | sylan 580 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (♯‘(𝐴 ∖ {𝑥})) = ((♯‘𝐴) − 1)) |
| 21 | 18, 20 | eqtrd 2766 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (♯‘𝐵) = ((♯‘𝐴) − 1)) |
| 22 | 21 | oveq1d 7361 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((♯‘𝐵) · 1) = (((♯‘𝐴) − 1) · 1)) |
| 23 | 22 | sumeq2dv 15609 | . . 3 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 ((♯‘𝐵) · 1) = Σ𝑥 ∈ 𝐴 (((♯‘𝐴) − 1) · 1)) |
| 24 | hashcl 14263 | . . . . . . . . 9 ⊢ (𝐴 ∈ Fin → (♯‘𝐴) ∈ ℕ0) | |
| 25 | 1, 24 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → (♯‘𝐴) ∈ ℕ0) |
| 26 | 25 | nn0cnd 12444 | . . . . . . 7 ⊢ (𝜑 → (♯‘𝐴) ∈ ℂ) |
| 27 | peano2cnm 11427 | . . . . . . 7 ⊢ ((♯‘𝐴) ∈ ℂ → ((♯‘𝐴) − 1) ∈ ℂ) | |
| 28 | 26, 27 | syl 17 | . . . . . 6 ⊢ (𝜑 → ((♯‘𝐴) − 1) ∈ ℂ) |
| 29 | 28 | mulridd 11129 | . . . . 5 ⊢ (𝜑 → (((♯‘𝐴) − 1) · 1) = ((♯‘𝐴) − 1)) |
| 30 | 29 | sumeq2sdv 15610 | . . . 4 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 (((♯‘𝐴) − 1) · 1) = Σ𝑥 ∈ 𝐴 ((♯‘𝐴) − 1)) |
| 31 | fsumconst 15697 | . . . . 5 ⊢ ((𝐴 ∈ Fin ∧ ((♯‘𝐴) − 1) ∈ ℂ) → Σ𝑥 ∈ 𝐴 ((♯‘𝐴) − 1) = ((♯‘𝐴) · ((♯‘𝐴) − 1))) | |
| 32 | 1, 28, 31 | syl2anc 584 | . . . 4 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 ((♯‘𝐴) − 1) = ((♯‘𝐴) · ((♯‘𝐴) − 1))) |
| 33 | 30, 32 | eqtrd 2766 | . . 3 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 (((♯‘𝐴) − 1) · 1) = ((♯‘𝐴) · ((♯‘𝐴) − 1))) |
| 34 | 16, 23, 33 | 3eqtrd 2770 | . 2 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 Σ𝑦 ∈ 𝐵 1 = ((♯‘𝐴) · ((♯‘𝐴) − 1))) |
| 35 | 10, 12, 34 | 3eqtrd 2770 | 1 ⊢ (𝜑 → (♯‘∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 𝐶) = ((♯‘𝐴) · ((♯‘𝐴) − 1))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2111 ∖ cdif 3894 {csn 4573 ∪ ciun 4939 Disj wdisj 5056 ‘cfv 6481 (class class class)co 7346 Fincfn 8869 ℂcc 11004 1c1 11007 · cmul 11011 − cmin 11344 ℕ0cn0 12381 ♯chash 14237 Σcsu 15593 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 ax-inf2 9531 ax-cnex 11062 ax-resscn 11063 ax-1cn 11064 ax-icn 11065 ax-addcl 11066 ax-addrcl 11067 ax-mulcl 11068 ax-mulrcl 11069 ax-mulcom 11070 ax-addass 11071 ax-mulass 11072 ax-distr 11073 ax-i2m1 11074 ax-1ne0 11075 ax-1rid 11076 ax-rnegex 11077 ax-rrecex 11078 ax-cnre 11079 ax-pre-lttri 11080 ax-pre-lttrn 11081 ax-pre-ltadd 11082 ax-pre-mulgt0 11083 ax-pre-sup 11084 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-int 4896 df-iun 4941 df-disj 5057 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-se 5568 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-isom 6490 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-om 7797 df-1st 7921 df-2nd 7922 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-1o 8385 df-oadd 8389 df-er 8622 df-en 8870 df-dom 8871 df-sdom 8872 df-fin 8873 df-sup 9326 df-oi 9396 df-dju 9794 df-card 9832 df-pnf 11148 df-mnf 11149 df-xr 11150 df-ltxr 11151 df-le 11152 df-sub 11346 df-neg 11347 df-div 11775 df-nn 12126 df-2 12188 df-3 12189 df-n0 12382 df-z 12469 df-uz 12733 df-rp 12891 df-fz 13408 df-fzo 13555 df-seq 13909 df-exp 13969 df-hash 14238 df-cj 15006 df-re 15007 df-im 15008 df-sqrt 15142 df-abs 15143 df-clim 15395 df-sum 15594 |
| This theorem is referenced by: frgrhash2wsp 30312 fusgreghash2wspv 30315 |
| Copyright terms: Public domain | W3C validator |