| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fprodsplitsn | Structured version Visualization version GIF version | ||
| Description: Separate out a term in a finite product. (Contributed by Glauco Siliprandi, 5-Apr-2020.) |
| Ref | Expression |
|---|---|
| fprodsplitsn.ph | ⊢ Ⅎ𝑘𝜑 |
| fprodsplitsn.kd | ⊢ Ⅎ𝑘𝐷 |
| fprodsplitsn.a | ⊢ (𝜑 → 𝐴 ∈ Fin) |
| fprodsplitsn.b | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
| fprodsplitsn.ba | ⊢ (𝜑 → ¬ 𝐵 ∈ 𝐴) |
| fprodsplitsn.c | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ) |
| fprodsplitsn.d | ⊢ (𝑘 = 𝐵 → 𝐶 = 𝐷) |
| fprodsplitsn.dcn | ⊢ (𝜑 → 𝐷 ∈ ℂ) |
| Ref | Expression |
|---|---|
| fprodsplitsn | ⊢ (𝜑 → ∏𝑘 ∈ (𝐴 ∪ {𝐵})𝐶 = (∏𝑘 ∈ 𝐴 𝐶 · 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fprodsplitsn.ph | . . 3 ⊢ Ⅎ𝑘𝜑 | |
| 2 | fprodsplitsn.ba | . . . 4 ⊢ (𝜑 → ¬ 𝐵 ∈ 𝐴) | |
| 3 | disjsn 4675 | . . . 4 ⊢ ((𝐴 ∩ {𝐵}) = ∅ ↔ ¬ 𝐵 ∈ 𝐴) | |
| 4 | 2, 3 | sylibr 234 | . . 3 ⊢ (𝜑 → (𝐴 ∩ {𝐵}) = ∅) |
| 5 | eqidd 2730 | . . 3 ⊢ (𝜑 → (𝐴 ∪ {𝐵}) = (𝐴 ∪ {𝐵})) | |
| 6 | fprodsplitsn.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
| 7 | snfi 9014 | . . . 4 ⊢ {𝐵} ∈ Fin | |
| 8 | unfi 9135 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ {𝐵} ∈ Fin) → (𝐴 ∪ {𝐵}) ∈ Fin) | |
| 9 | 6, 7, 8 | sylancl 586 | . . 3 ⊢ (𝜑 → (𝐴 ∪ {𝐵}) ∈ Fin) |
| 10 | fprodsplitsn.c | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ) | |
| 11 | 10 | adantlr 715 | . . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ) |
| 12 | elunnel1 4117 | . . . . . . . 8 ⊢ ((𝑘 ∈ (𝐴 ∪ {𝐵}) ∧ ¬ 𝑘 ∈ 𝐴) → 𝑘 ∈ {𝐵}) | |
| 13 | elsni 4606 | . . . . . . . 8 ⊢ (𝑘 ∈ {𝐵} → 𝑘 = 𝐵) | |
| 14 | 12, 13 | syl 17 | . . . . . . 7 ⊢ ((𝑘 ∈ (𝐴 ∪ {𝐵}) ∧ ¬ 𝑘 ∈ 𝐴) → 𝑘 = 𝐵) |
| 15 | 14 | adantll 714 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑘 ∈ 𝐴) → 𝑘 = 𝐵) |
| 16 | fprodsplitsn.d | . . . . . 6 ⊢ (𝑘 = 𝐵 → 𝐶 = 𝐷) | |
| 17 | 15, 16 | syl 17 | . . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑘 ∈ 𝐴) → 𝐶 = 𝐷) |
| 18 | fprodsplitsn.dcn | . . . . . 6 ⊢ (𝜑 → 𝐷 ∈ ℂ) | |
| 19 | 18 | ad2antrr 726 | . . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑘 ∈ 𝐴) → 𝐷 ∈ ℂ) |
| 20 | 17, 19 | eqeltrd 2828 | . . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ) |
| 21 | 11, 20 | pm2.61dan 812 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∪ {𝐵})) → 𝐶 ∈ ℂ) |
| 22 | 1, 4, 5, 9, 21 | fprodsplitf 15954 | . 2 ⊢ (𝜑 → ∏𝑘 ∈ (𝐴 ∪ {𝐵})𝐶 = (∏𝑘 ∈ 𝐴 𝐶 · ∏𝑘 ∈ {𝐵}𝐶)) |
| 23 | fprodsplitsn.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
| 24 | fprodsplitsn.kd | . . . . 5 ⊢ Ⅎ𝑘𝐷 | |
| 25 | 24, 16 | prodsnf 15930 | . . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ ℂ) → ∏𝑘 ∈ {𝐵}𝐶 = 𝐷) |
| 26 | 23, 18, 25 | syl2anc 584 | . . 3 ⊢ (𝜑 → ∏𝑘 ∈ {𝐵}𝐶 = 𝐷) |
| 27 | 26 | oveq2d 7403 | . 2 ⊢ (𝜑 → (∏𝑘 ∈ 𝐴 𝐶 · ∏𝑘 ∈ {𝐵}𝐶) = (∏𝑘 ∈ 𝐴 𝐶 · 𝐷)) |
| 28 | 22, 27 | eqtrd 2764 | 1 ⊢ (𝜑 → ∏𝑘 ∈ (𝐴 ∪ {𝐵})𝐶 = (∏𝑘 ∈ 𝐴 𝐶 · 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1540 Ⅎwnf 1783 ∈ wcel 2109 Ⅎwnfc 2876 ∪ cun 3912 ∩ cin 3913 ∅c0 4296 {csn 4589 (class class class)co 7387 Fincfn 8918 ℂcc 11066 · cmul 11073 ∏cprod 15869 |
| 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 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-inf2 9594 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 ax-pre-sup 11146 |
| 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 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-int 4911 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-se 5592 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-isom 6520 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-1st 7968 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-1o 8434 df-er 8671 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 df-sup 9393 df-oi 9463 df-card 9892 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-div 11836 df-nn 12187 df-2 12249 df-3 12250 df-n0 12443 df-z 12530 df-uz 12794 df-rp 12952 df-fz 13469 df-fzo 13616 df-seq 13967 df-exp 14027 df-hash 14296 df-cj 15065 df-re 15066 df-im 15067 df-sqrt 15201 df-abs 15202 df-clim 15454 df-prod 15870 |
| This theorem is referenced by: fprodmodd 15963 coprmprod 16631 coprmproddvdslem 16632 breprexplema 34621 breprexplemc 34623 circlemethhgt 34634 fprodexp 45592 fprodabs2 45593 mccllem 45595 fprodcnlem 45597 fprodcncf 45898 dvmptfprodlem 45942 dvnprodlem2 45945 hspmbllem1 46624 |
| Copyright terms: Public domain | W3C validator |