| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fprodsplit1f | Structured version Visualization version GIF version | ||
| Description: Separate out a term in a finite product. A version of fprodsplit1 45589 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 5-Apr-2020.) |
| Ref | Expression |
|---|---|
| fprodsplit1f.kph | ⊢ Ⅎ𝑘𝜑 |
| fprodsplit1f.fk | ⊢ (𝜑 → Ⅎ𝑘𝐷) |
| fprodsplit1f.a | ⊢ (𝜑 → 𝐴 ∈ Fin) |
| fprodsplit1f.b | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
| fprodsplit1f.c | ⊢ (𝜑 → 𝐶 ∈ 𝐴) |
| fprodsplit1f.d | ⊢ ((𝜑 ∧ 𝑘 = 𝐶) → 𝐵 = 𝐷) |
| Ref | Expression |
|---|---|
| fprodsplit1f | ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 = (𝐷 · ∏𝑘 ∈ (𝐴 ∖ {𝐶})𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fprodsplit1f.kph | . . 3 ⊢ Ⅎ𝑘𝜑 | |
| 2 | disjdif 4452 | . . . 4 ⊢ ({𝐶} ∩ (𝐴 ∖ {𝐶})) = ∅ | |
| 3 | 2 | a1i 11 | . . 3 ⊢ (𝜑 → ({𝐶} ∩ (𝐴 ∖ {𝐶})) = ∅) |
| 4 | fprodsplit1f.c | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ 𝐴) | |
| 5 | 4 | snssd 4790 | . . . . 5 ⊢ (𝜑 → {𝐶} ⊆ 𝐴) |
| 6 | undif 4462 | . . . . 5 ⊢ ({𝐶} ⊆ 𝐴 ↔ ({𝐶} ∪ (𝐴 ∖ {𝐶})) = 𝐴) | |
| 7 | 5, 6 | sylib 218 | . . . 4 ⊢ (𝜑 → ({𝐶} ∪ (𝐴 ∖ {𝐶})) = 𝐴) |
| 8 | 7 | eqcomd 2742 | . . 3 ⊢ (𝜑 → 𝐴 = ({𝐶} ∪ (𝐴 ∖ {𝐶}))) |
| 9 | fprodsplit1f.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
| 10 | fprodsplit1f.b | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) | |
| 11 | 1, 3, 8, 9, 10 | fprodsplitf 16009 | . 2 ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 = (∏𝑘 ∈ {𝐶}𝐵 · ∏𝑘 ∈ (𝐴 ∖ {𝐶})𝐵)) |
| 12 | 4 | ancli 548 | . . . . . 6 ⊢ (𝜑 → (𝜑 ∧ 𝐶 ∈ 𝐴)) |
| 13 | nfv 1914 | . . . . . . . . 9 ⊢ Ⅎ𝑘 𝐶 ∈ 𝐴 | |
| 14 | 1, 13 | nfan 1899 | . . . . . . . 8 ⊢ Ⅎ𝑘(𝜑 ∧ 𝐶 ∈ 𝐴) |
| 15 | nfcsb1v 3903 | . . . . . . . . 9 ⊢ Ⅎ𝑘⦋𝐶 / 𝑘⦌𝐵 | |
| 16 | 15 | nfel1 2916 | . . . . . . . 8 ⊢ Ⅎ𝑘⦋𝐶 / 𝑘⦌𝐵 ∈ ℂ |
| 17 | 14, 16 | nfim 1896 | . . . . . . 7 ⊢ Ⅎ𝑘((𝜑 ∧ 𝐶 ∈ 𝐴) → ⦋𝐶 / 𝑘⦌𝐵 ∈ ℂ) |
| 18 | eleq1 2823 | . . . . . . . . 9 ⊢ (𝑘 = 𝐶 → (𝑘 ∈ 𝐴 ↔ 𝐶 ∈ 𝐴)) | |
| 19 | 18 | anbi2d 630 | . . . . . . . 8 ⊢ (𝑘 = 𝐶 → ((𝜑 ∧ 𝑘 ∈ 𝐴) ↔ (𝜑 ∧ 𝐶 ∈ 𝐴))) |
| 20 | csbeq1a 3893 | . . . . . . . . 9 ⊢ (𝑘 = 𝐶 → 𝐵 = ⦋𝐶 / 𝑘⦌𝐵) | |
| 21 | 20 | eleq1d 2820 | . . . . . . . 8 ⊢ (𝑘 = 𝐶 → (𝐵 ∈ ℂ ↔ ⦋𝐶 / 𝑘⦌𝐵 ∈ ℂ)) |
| 22 | 19, 21 | imbi12d 344 | . . . . . . 7 ⊢ (𝑘 = 𝐶 → (((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) ↔ ((𝜑 ∧ 𝐶 ∈ 𝐴) → ⦋𝐶 / 𝑘⦌𝐵 ∈ ℂ))) |
| 23 | 17, 22, 10 | vtoclg1f 3554 | . . . . . 6 ⊢ (𝐶 ∈ 𝐴 → ((𝜑 ∧ 𝐶 ∈ 𝐴) → ⦋𝐶 / 𝑘⦌𝐵 ∈ ℂ)) |
| 24 | 4, 12, 23 | sylc 65 | . . . . 5 ⊢ (𝜑 → ⦋𝐶 / 𝑘⦌𝐵 ∈ ℂ) |
| 25 | prodsns 15993 | . . . . 5 ⊢ ((𝐶 ∈ 𝐴 ∧ ⦋𝐶 / 𝑘⦌𝐵 ∈ ℂ) → ∏𝑘 ∈ {𝐶}𝐵 = ⦋𝐶 / 𝑘⦌𝐵) | |
| 26 | 4, 24, 25 | syl2anc 584 | . . . 4 ⊢ (𝜑 → ∏𝑘 ∈ {𝐶}𝐵 = ⦋𝐶 / 𝑘⦌𝐵) |
| 27 | fprodsplit1f.fk | . . . . 5 ⊢ (𝜑 → Ⅎ𝑘𝐷) | |
| 28 | fprodsplit1f.d | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 = 𝐶) → 𝐵 = 𝐷) | |
| 29 | 1, 27, 4, 28 | csbiedf 3909 | . . . 4 ⊢ (𝜑 → ⦋𝐶 / 𝑘⦌𝐵 = 𝐷) |
| 30 | 26, 29 | eqtrd 2771 | . . 3 ⊢ (𝜑 → ∏𝑘 ∈ {𝐶}𝐵 = 𝐷) |
| 31 | 30 | oveq1d 7425 | . 2 ⊢ (𝜑 → (∏𝑘 ∈ {𝐶}𝐵 · ∏𝑘 ∈ (𝐴 ∖ {𝐶})𝐵) = (𝐷 · ∏𝑘 ∈ (𝐴 ∖ {𝐶})𝐵)) |
| 32 | 11, 31 | eqtrd 2771 | 1 ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 = (𝐷 · ∏𝑘 ∈ (𝐴 ∖ {𝐶})𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 Ⅎwnf 1783 ∈ wcel 2109 Ⅎwnfc 2884 ⦋csb 3879 ∖ cdif 3928 ∪ cun 3929 ∩ cin 3930 ⊆ wss 3931 ∅c0 4313 {csn 4606 (class class class)co 7410 Fincfn 8964 ℂcc 11132 · cmul 11139 ∏cprod 15924 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-rep 5254 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 ax-inf2 9660 ax-cnex 11190 ax-resscn 11191 ax-1cn 11192 ax-icn 11193 ax-addcl 11194 ax-addrcl 11195 ax-mulcl 11196 ax-mulrcl 11197 ax-mulcom 11198 ax-addass 11199 ax-mulass 11200 ax-distr 11201 ax-i2m1 11202 ax-1ne0 11203 ax-1rid 11204 ax-rnegex 11205 ax-rrecex 11206 ax-cnre 11207 ax-pre-lttri 11208 ax-pre-lttrn 11209 ax-pre-ltadd 11210 ax-pre-mulgt0 11211 ax-pre-sup 11212 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3364 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-int 4928 df-iun 4974 df-br 5125 df-opab 5187 df-mpt 5207 df-tr 5235 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-se 5612 df-we 5613 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6295 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7867 df-1st 7993 df-2nd 7994 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-er 8724 df-en 8965 df-dom 8966 df-sdom 8967 df-fin 8968 df-sup 9459 df-oi 9529 df-card 9958 df-pnf 11276 df-mnf 11277 df-xr 11278 df-ltxr 11279 df-le 11280 df-sub 11473 df-neg 11474 df-div 11900 df-nn 12246 df-2 12308 df-3 12309 df-n0 12507 df-z 12594 df-uz 12858 df-rp 13014 df-fz 13530 df-fzo 13677 df-seq 14025 df-exp 14085 df-hash 14354 df-cj 15123 df-re 15124 df-im 15125 df-sqrt 15259 df-abs 15260 df-clim 15509 df-prod 15925 |
| This theorem is referenced by: fprodeq0g 16015 fprodsplit1 45589 fprod0 45592 dvmptfprodlem 45940 |
| Copyright terms: Public domain | W3C validator |