| 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 9106 | . . . . . 6 ⊢ (𝐴 ∈ Fin → (𝐴 ∖ {𝑥}) ∈ Fin) | |
| 4 | 1, 3 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝐴 ∖ {𝑥}) ∈ Fin) |
| 5 | 4 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐴 ∖ {𝑥}) ∈ Fin) |
| 6 | 2, 5 | eqeltrid 2841 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ Fin) |
| 7 | hash2iun1dif1.c | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝐶 ∈ Fin) | |
| 8 | hash2iun1dif1.da | . . 3 ⊢ (𝜑 → Disj 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 𝐶) | |
| 9 | hash2iun1dif1.db | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → Disj 𝑦 ∈ 𝐵 𝐶) | |
| 10 | 1, 6, 7, 8, 9 | hash2iun 15783 | . 2 ⊢ (𝜑 → (♯‘∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 𝐶) = Σ𝑥 ∈ 𝐴 Σ𝑦 ∈ 𝐵 (♯‘𝐶)) |
| 11 | hash2iun1dif1.1 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (♯‘𝐶) = 1) | |
| 12 | 11 | 2sumeq2dv 15664 | . 2 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 Σ𝑦 ∈ 𝐵 (♯‘𝐶) = Σ𝑥 ∈ 𝐴 Σ𝑦 ∈ 𝐵 1) |
| 13 | 1cnd 11136 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 1 ∈ ℂ) | |
| 14 | fsumconst 15749 | . . . . 5 ⊢ ((𝐵 ∈ Fin ∧ 1 ∈ ℂ) → Σ𝑦 ∈ 𝐵 1 = ((♯‘𝐵) · 1)) | |
| 15 | 6, 13, 14 | syl2anc 585 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → Σ𝑦 ∈ 𝐵 1 = ((♯‘𝐵) · 1)) |
| 16 | 15 | sumeq2dv 15661 | . . 3 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 Σ𝑦 ∈ 𝐵 1 = Σ𝑥 ∈ 𝐴 ((♯‘𝐵) · 1)) |
| 17 | 2 | a1i 11 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = (𝐴 ∖ {𝑥})) |
| 18 | 17 | fveq2d 6842 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (♯‘𝐵) = (♯‘(𝐴 ∖ {𝑥}))) |
| 19 | hashdifsn 14373 | . . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝐴) → (♯‘(𝐴 ∖ {𝑥})) = ((♯‘𝐴) − 1)) | |
| 20 | 1, 19 | sylan 581 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (♯‘(𝐴 ∖ {𝑥})) = ((♯‘𝐴) − 1)) |
| 21 | 18, 20 | eqtrd 2772 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (♯‘𝐵) = ((♯‘𝐴) − 1)) |
| 22 | 21 | oveq1d 7379 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((♯‘𝐵) · 1) = (((♯‘𝐴) − 1) · 1)) |
| 23 | 22 | sumeq2dv 15661 | . . 3 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 ((♯‘𝐵) · 1) = Σ𝑥 ∈ 𝐴 (((♯‘𝐴) − 1) · 1)) |
| 24 | hashcl 14315 | . . . . . . . . 9 ⊢ (𝐴 ∈ Fin → (♯‘𝐴) ∈ ℕ0) | |
| 25 | 1, 24 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → (♯‘𝐴) ∈ ℕ0) |
| 26 | 25 | nn0cnd 12497 | . . . . . . 7 ⊢ (𝜑 → (♯‘𝐴) ∈ ℂ) |
| 27 | peano2cnm 11457 | . . . . . . 7 ⊢ ((♯‘𝐴) ∈ ℂ → ((♯‘𝐴) − 1) ∈ ℂ) | |
| 28 | 26, 27 | syl 17 | . . . . . 6 ⊢ (𝜑 → ((♯‘𝐴) − 1) ∈ ℂ) |
| 29 | 28 | mulridd 11159 | . . . . 5 ⊢ (𝜑 → (((♯‘𝐴) − 1) · 1) = ((♯‘𝐴) − 1)) |
| 30 | 29 | sumeq2sdv 15662 | . . . 4 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 (((♯‘𝐴) − 1) · 1) = Σ𝑥 ∈ 𝐴 ((♯‘𝐴) − 1)) |
| 31 | fsumconst 15749 | . . . . 5 ⊢ ((𝐴 ∈ Fin ∧ ((♯‘𝐴) − 1) ∈ ℂ) → Σ𝑥 ∈ 𝐴 ((♯‘𝐴) − 1) = ((♯‘𝐴) · ((♯‘𝐴) − 1))) | |
| 32 | 1, 28, 31 | syl2anc 585 | . . . 4 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 ((♯‘𝐴) − 1) = ((♯‘𝐴) · ((♯‘𝐴) − 1))) |
| 33 | 30, 32 | eqtrd 2772 | . . 3 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 (((♯‘𝐴) − 1) · 1) = ((♯‘𝐴) · ((♯‘𝐴) − 1))) |
| 34 | 16, 23, 33 | 3eqtrd 2776 | . 2 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 Σ𝑦 ∈ 𝐵 1 = ((♯‘𝐴) · ((♯‘𝐴) − 1))) |
| 35 | 10, 12, 34 | 3eqtrd 2776 | 1 ⊢ (𝜑 → (♯‘∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 𝐶) = ((♯‘𝐴) · ((♯‘𝐴) − 1))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∖ cdif 3887 {csn 4568 ∪ ciun 4934 Disj wdisj 5053 ‘cfv 6496 (class class class)co 7364 Fincfn 8890 ℂcc 11033 1c1 11036 · cmul 11040 − cmin 11374 ℕ0cn0 12434 ♯chash 14289 Σcsu 15645 |
| 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-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5306 ax-pr 5374 ax-un 7686 ax-inf2 9559 ax-cnex 11091 ax-resscn 11092 ax-1cn 11093 ax-icn 11094 ax-addcl 11095 ax-addrcl 11096 ax-mulcl 11097 ax-mulrcl 11098 ax-mulcom 11099 ax-addass 11100 ax-mulass 11101 ax-distr 11102 ax-i2m1 11103 ax-1ne0 11104 ax-1rid 11105 ax-rnegex 11106 ax-rrecex 11107 ax-cnre 11108 ax-pre-lttri 11109 ax-pre-lttrn 11110 ax-pre-ltadd 11111 ax-pre-mulgt0 11112 ax-pre-sup 11113 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 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-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 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-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-disj 5054 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5523 df-eprel 5528 df-po 5536 df-so 5537 df-fr 5581 df-se 5582 df-we 5583 df-xp 5634 df-rel 5635 df-cnv 5636 df-co 5637 df-dm 5638 df-rn 5639 df-res 5640 df-ima 5641 df-pred 6263 df-ord 6324 df-on 6325 df-lim 6326 df-suc 6327 df-iota 6452 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-isom 6505 df-riota 7321 df-ov 7367 df-oprab 7368 df-mpo 7369 df-om 7815 df-1st 7939 df-2nd 7940 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-1o 8402 df-oadd 8406 df-er 8640 df-en 8891 df-dom 8892 df-sdom 8893 df-fin 8894 df-sup 9352 df-oi 9422 df-dju 9822 df-card 9860 df-pnf 11178 df-mnf 11179 df-xr 11180 df-ltxr 11181 df-le 11182 df-sub 11376 df-neg 11377 df-div 11805 df-nn 12172 df-2 12241 df-3 12242 df-n0 12435 df-z 12522 df-uz 12786 df-rp 12940 df-fz 13459 df-fzo 13606 df-seq 13961 df-exp 14021 df-hash 14290 df-cj 15058 df-re 15059 df-im 15060 df-sqrt 15194 df-abs 15195 df-clim 15447 df-sum 15646 |
| This theorem is referenced by: frgrhash2wsp 30423 fusgreghash2wspv 30426 |
| Copyright terms: Public domain | W3C validator |