| 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 9103 | . . . . . 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 15750 | . 2 ⊢ (𝜑 → (♯‘∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 𝐶) = Σ𝑥 ∈ 𝐴 Σ𝑦 ∈ 𝐵 (♯‘𝐶)) |
| 11 | hash2iun1dif1.1 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (♯‘𝐶) = 1) | |
| 12 | 11 | 2sumeq2dv 15632 | . 2 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 Σ𝑦 ∈ 𝐵 (♯‘𝐶) = Σ𝑥 ∈ 𝐴 Σ𝑦 ∈ 𝐵 1) |
| 13 | 1cnd 11131 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 1 ∈ ℂ) | |
| 14 | fsumconst 15717 | . . . . 5 ⊢ ((𝐵 ∈ Fin ∧ 1 ∈ ℂ) → Σ𝑦 ∈ 𝐵 1 = ((♯‘𝐵) · 1)) | |
| 15 | 6, 13, 14 | syl2anc 585 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → Σ𝑦 ∈ 𝐵 1 = ((♯‘𝐵) · 1)) |
| 16 | 15 | sumeq2dv 15629 | . . 3 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 Σ𝑦 ∈ 𝐵 1 = Σ𝑥 ∈ 𝐴 ((♯‘𝐵) · 1)) |
| 17 | 2 | a1i 11 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = (𝐴 ∖ {𝑥})) |
| 18 | 17 | fveq2d 6839 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (♯‘𝐵) = (♯‘(𝐴 ∖ {𝑥}))) |
| 19 | hashdifsn 14341 | . . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝐴) → (♯‘(𝐴 ∖ {𝑥})) = ((♯‘𝐴) − 1)) | |
| 20 | 1, 19 | sylan 581 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (♯‘(𝐴 ∖ {𝑥})) = ((♯‘𝐴) − 1)) |
| 21 | 18, 20 | eqtrd 2772 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (♯‘𝐵) = ((♯‘𝐴) − 1)) |
| 22 | 21 | oveq1d 7375 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((♯‘𝐵) · 1) = (((♯‘𝐴) − 1) · 1)) |
| 23 | 22 | sumeq2dv 15629 | . . 3 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 ((♯‘𝐵) · 1) = Σ𝑥 ∈ 𝐴 (((♯‘𝐴) − 1) · 1)) |
| 24 | hashcl 14283 | . . . . . . . . 9 ⊢ (𝐴 ∈ Fin → (♯‘𝐴) ∈ ℕ0) | |
| 25 | 1, 24 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → (♯‘𝐴) ∈ ℕ0) |
| 26 | 25 | nn0cnd 12468 | . . . . . . 7 ⊢ (𝜑 → (♯‘𝐴) ∈ ℂ) |
| 27 | peano2cnm 11451 | . . . . . . 7 ⊢ ((♯‘𝐴) ∈ ℂ → ((♯‘𝐴) − 1) ∈ ℂ) | |
| 28 | 26, 27 | syl 17 | . . . . . 6 ⊢ (𝜑 → ((♯‘𝐴) − 1) ∈ ℂ) |
| 29 | 28 | mulridd 11153 | . . . . 5 ⊢ (𝜑 → (((♯‘𝐴) − 1) · 1) = ((♯‘𝐴) − 1)) |
| 30 | 29 | sumeq2sdv 15630 | . . . 4 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 (((♯‘𝐴) − 1) · 1) = Σ𝑥 ∈ 𝐴 ((♯‘𝐴) − 1)) |
| 31 | fsumconst 15717 | . . . . 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 3899 {csn 4581 ∪ ciun 4947 Disj wdisj 5066 ‘cfv 6493 (class class class)co 7360 Fincfn 8887 ℂcc 11028 1c1 11031 · cmul 11035 − cmin 11368 ℕ0cn0 12405 ♯chash 14257 Σcsu 15613 |
| 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 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-inf2 9554 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107 ax-pre-sup 11108 |
| 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 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4904 df-iun 4949 df-disj 5067 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 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-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-isom 6502 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-oadd 8403 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-sup 9349 df-oi 9419 df-dju 9817 df-card 9855 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12150 df-2 12212 df-3 12213 df-n0 12406 df-z 12493 df-uz 12756 df-rp 12910 df-fz 13428 df-fzo 13575 df-seq 13929 df-exp 13989 df-hash 14258 df-cj 15026 df-re 15027 df-im 15028 df-sqrt 15162 df-abs 15163 df-clim 15415 df-sum 15614 |
| This theorem is referenced by: frgrhash2wsp 30411 fusgreghash2wspv 30414 |
| Copyright terms: Public domain | W3C validator |