| 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 9101 | . . . . . 6 ⊢ (𝐴 ∈ Fin → (𝐴 ∖ {𝑥}) ∈ Fin) | |
| 4 | 1, 3 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝐴 ∖ {𝑥}) ∈ Fin) |
| 5 | 4 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐴 ∖ {𝑥}) ∈ Fin) |
| 6 | 2, 5 | eqeltrid 2839 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ Fin) |
| 7 | hash2iun1dif1.c | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝐶 ∈ Fin) | |
| 8 | hash2iun1dif1.da | . . 3 ⊢ (𝜑 → Disj 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 𝐶) | |
| 9 | hash2iun1dif1.db | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → Disj 𝑦 ∈ 𝐵 𝐶) | |
| 10 | 1, 6, 7, 8, 9 | hash2iun 15748 | . 2 ⊢ (𝜑 → (♯‘∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 𝐶) = Σ𝑥 ∈ 𝐴 Σ𝑦 ∈ 𝐵 (♯‘𝐶)) |
| 11 | hash2iun1dif1.1 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (♯‘𝐶) = 1) | |
| 12 | 11 | 2sumeq2dv 15630 | . 2 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 Σ𝑦 ∈ 𝐵 (♯‘𝐶) = Σ𝑥 ∈ 𝐴 Σ𝑦 ∈ 𝐵 1) |
| 13 | 1cnd 11129 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 1 ∈ ℂ) | |
| 14 | fsumconst 15715 | . . . . 5 ⊢ ((𝐵 ∈ Fin ∧ 1 ∈ ℂ) → Σ𝑦 ∈ 𝐵 1 = ((♯‘𝐵) · 1)) | |
| 15 | 6, 13, 14 | syl2anc 585 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → Σ𝑦 ∈ 𝐵 1 = ((♯‘𝐵) · 1)) |
| 16 | 15 | sumeq2dv 15627 | . . 3 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 Σ𝑦 ∈ 𝐵 1 = Σ𝑥 ∈ 𝐴 ((♯‘𝐵) · 1)) |
| 17 | 2 | a1i 11 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = (𝐴 ∖ {𝑥})) |
| 18 | 17 | fveq2d 6837 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (♯‘𝐵) = (♯‘(𝐴 ∖ {𝑥}))) |
| 19 | hashdifsn 14339 | . . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝐴) → (♯‘(𝐴 ∖ {𝑥})) = ((♯‘𝐴) − 1)) | |
| 20 | 1, 19 | sylan 581 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (♯‘(𝐴 ∖ {𝑥})) = ((♯‘𝐴) − 1)) |
| 21 | 18, 20 | eqtrd 2770 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (♯‘𝐵) = ((♯‘𝐴) − 1)) |
| 22 | 21 | oveq1d 7373 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((♯‘𝐵) · 1) = (((♯‘𝐴) − 1) · 1)) |
| 23 | 22 | sumeq2dv 15627 | . . 3 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 ((♯‘𝐵) · 1) = Σ𝑥 ∈ 𝐴 (((♯‘𝐴) − 1) · 1)) |
| 24 | hashcl 14281 | . . . . . . . . 9 ⊢ (𝐴 ∈ Fin → (♯‘𝐴) ∈ ℕ0) | |
| 25 | 1, 24 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → (♯‘𝐴) ∈ ℕ0) |
| 26 | 25 | nn0cnd 12466 | . . . . . . 7 ⊢ (𝜑 → (♯‘𝐴) ∈ ℂ) |
| 27 | peano2cnm 11449 | . . . . . . 7 ⊢ ((♯‘𝐴) ∈ ℂ → ((♯‘𝐴) − 1) ∈ ℂ) | |
| 28 | 26, 27 | syl 17 | . . . . . 6 ⊢ (𝜑 → ((♯‘𝐴) − 1) ∈ ℂ) |
| 29 | 28 | mulridd 11151 | . . . . 5 ⊢ (𝜑 → (((♯‘𝐴) − 1) · 1) = ((♯‘𝐴) − 1)) |
| 30 | 29 | sumeq2sdv 15628 | . . . 4 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 (((♯‘𝐴) − 1) · 1) = Σ𝑥 ∈ 𝐴 ((♯‘𝐴) − 1)) |
| 31 | fsumconst 15715 | . . . . 5 ⊢ ((𝐴 ∈ Fin ∧ ((♯‘𝐴) − 1) ∈ ℂ) → Σ𝑥 ∈ 𝐴 ((♯‘𝐴) − 1) = ((♯‘𝐴) · ((♯‘𝐴) − 1))) | |
| 32 | 1, 28, 31 | syl2anc 585 | . . . 4 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 ((♯‘𝐴) − 1) = ((♯‘𝐴) · ((♯‘𝐴) − 1))) |
| 33 | 30, 32 | eqtrd 2770 | . . 3 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 (((♯‘𝐴) − 1) · 1) = ((♯‘𝐴) · ((♯‘𝐴) − 1))) |
| 34 | 16, 23, 33 | 3eqtrd 2774 | . 2 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 Σ𝑦 ∈ 𝐵 1 = ((♯‘𝐴) · ((♯‘𝐴) − 1))) |
| 35 | 10, 12, 34 | 3eqtrd 2774 | 1 ⊢ (𝜑 → (♯‘∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 𝐶) = ((♯‘𝐴) · ((♯‘𝐴) − 1))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∖ cdif 3897 {csn 4579 ∪ ciun 4945 Disj wdisj 5064 ‘cfv 6491 (class class class)co 7358 Fincfn 8885 ℂcc 11026 1c1 11029 · cmul 11033 − cmin 11366 ℕ0cn0 12403 ♯chash 14255 Σcsu 15611 |
| 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 2183 ax-ext 2707 ax-rep 5223 ax-sep 5240 ax-nul 5250 ax-pow 5309 ax-pr 5376 ax-un 7680 ax-inf2 9552 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 ax-pre-sup 11106 |
| 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 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3349 df-reu 3350 df-rab 3399 df-v 3441 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-int 4902 df-iun 4947 df-disj 5065 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-se 5577 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6258 df-ord 6319 df-on 6320 df-lim 6321 df-suc 6322 df-iota 6447 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-fv 6499 df-isom 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-oadd 8401 df-er 8635 df-en 8886 df-dom 8887 df-sdom 8888 df-fin 8889 df-sup 9347 df-oi 9417 df-dju 9815 df-card 9853 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-div 11797 df-nn 12148 df-2 12210 df-3 12211 df-n0 12404 df-z 12491 df-uz 12754 df-rp 12908 df-fz 13426 df-fzo 13573 df-seq 13927 df-exp 13987 df-hash 14256 df-cj 15024 df-re 15025 df-im 15026 df-sqrt 15160 df-abs 15161 df-clim 15413 df-sum 15612 |
| This theorem is referenced by: frgrhash2wsp 30388 fusgreghash2wspv 30391 |
| Copyright terms: Public domain | W3C validator |