| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fprodsplitsn | GIF version | ||
| Description: Separate out a term in a finite product. See also fprodunsn 12226 which is the same but with a distinct variable condition in place of Ⅎ𝑘𝜑. (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 3735 | . . . 4 ⊢ ((𝐴 ∩ {𝐵}) = ∅ ↔ ¬ 𝐵 ∈ 𝐴) | |
| 4 | 2, 3 | sylibr 134 | . . 3 ⊢ (𝜑 → (𝐴 ∩ {𝐵}) = ∅) |
| 5 | eqidd 2232 | . . 3 ⊢ (𝜑 → (𝐴 ∪ {𝐵}) = (𝐴 ∪ {𝐵})) | |
| 6 | fprodsplitsn.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
| 7 | fprodsplitsn.b | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
| 8 | snfig 7032 | . . . . 5 ⊢ (𝐵 ∈ 𝑉 → {𝐵} ∈ Fin) | |
| 9 | 7, 8 | syl 14 | . . . 4 ⊢ (𝜑 → {𝐵} ∈ Fin) |
| 10 | unfidisj 7157 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ {𝐵} ∈ Fin ∧ (𝐴 ∩ {𝐵}) = ∅) → (𝐴 ∪ {𝐵}) ∈ Fin) | |
| 11 | 6, 9, 4, 10 | syl3anc 1274 | . . 3 ⊢ (𝜑 → (𝐴 ∪ {𝐵}) ∈ Fin) |
| 12 | fprodsplitsn.c | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ) | |
| 13 | 12 | ex 115 | . . . . 5 ⊢ (𝜑 → (𝑘 ∈ 𝐴 → 𝐶 ∈ ℂ)) |
| 14 | fprodsplitsn.d | . . . . . . . 8 ⊢ (𝑘 = 𝐵 → 𝐶 = 𝐷) | |
| 15 | 14 | adantl 277 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 = 𝐵) → 𝐶 = 𝐷) |
| 16 | fprodsplitsn.dcn | . . . . . . . 8 ⊢ (𝜑 → 𝐷 ∈ ℂ) | |
| 17 | 16 | adantr 276 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 = 𝐵) → 𝐷 ∈ ℂ) |
| 18 | 15, 17 | eqeltrd 2308 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 𝐵) → 𝐶 ∈ ℂ) |
| 19 | 18 | ex 115 | . . . . 5 ⊢ (𝜑 → (𝑘 = 𝐵 → 𝐶 ∈ ℂ)) |
| 20 | 13, 19 | jaod 725 | . . . 4 ⊢ (𝜑 → ((𝑘 ∈ 𝐴 ∨ 𝑘 = 𝐵) → 𝐶 ∈ ℂ)) |
| 21 | elun 3350 | . . . . 5 ⊢ (𝑘 ∈ (𝐴 ∪ {𝐵}) ↔ (𝑘 ∈ 𝐴 ∨ 𝑘 ∈ {𝐵})) | |
| 22 | elsni 3691 | . . . . . 6 ⊢ (𝑘 ∈ {𝐵} → 𝑘 = 𝐵) | |
| 23 | 22 | orim2i 769 | . . . . 5 ⊢ ((𝑘 ∈ 𝐴 ∨ 𝑘 ∈ {𝐵}) → (𝑘 ∈ 𝐴 ∨ 𝑘 = 𝐵)) |
| 24 | 21, 23 | sylbi 121 | . . . 4 ⊢ (𝑘 ∈ (𝐴 ∪ {𝐵}) → (𝑘 ∈ 𝐴 ∨ 𝑘 = 𝐵)) |
| 25 | 20, 24 | impel 280 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∪ {𝐵})) → 𝐶 ∈ ℂ) |
| 26 | 1, 4, 5, 11, 25 | fprodsplitf 12254 | . 2 ⊢ (𝜑 → ∏𝑘 ∈ (𝐴 ∪ {𝐵})𝐶 = (∏𝑘 ∈ 𝐴 𝐶 · ∏𝑘 ∈ {𝐵}𝐶)) |
| 27 | fprodsplitsn.kd | . . . . 5 ⊢ Ⅎ𝑘𝐷 | |
| 28 | 27, 14 | prodsnf 12214 | . . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ ℂ) → ∏𝑘 ∈ {𝐵}𝐶 = 𝐷) |
| 29 | 7, 16, 28 | syl2anc 411 | . . 3 ⊢ (𝜑 → ∏𝑘 ∈ {𝐵}𝐶 = 𝐷) |
| 30 | 29 | oveq2d 6044 | . 2 ⊢ (𝜑 → (∏𝑘 ∈ 𝐴 𝐶 · ∏𝑘 ∈ {𝐵}𝐶) = (∏𝑘 ∈ 𝐴 𝐶 · 𝐷)) |
| 31 | 26, 30 | eqtrd 2264 | 1 ⊢ (𝜑 → ∏𝑘 ∈ (𝐴 ∪ {𝐵})𝐶 = (∏𝑘 ∈ 𝐴 𝐶 · 𝐷)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∨ wo 716 = wceq 1398 Ⅎwnf 1509 ∈ wcel 2202 Ⅎwnfc 2362 ∪ cun 3199 ∩ cin 3200 ∅c0 3496 {csn 3673 (class class class)co 6028 Fincfn 6952 ℂcc 8073 · cmul 8080 ∏cprod 12172 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-mulrcl 8174 ax-addcom 8175 ax-mulcom 8176 ax-addass 8177 ax-mulass 8178 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-1rid 8182 ax-0id 8183 ax-rnegex 8184 ax-precex 8185 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-apti 8190 ax-pre-ltadd 8191 ax-pre-mulgt0 8192 ax-pre-mulext 8193 ax-arch 8194 ax-caucvg 8195 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-if 3608 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-id 4396 df-po 4399 df-iso 4400 df-iord 4469 df-on 4471 df-ilim 4472 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-isom 5342 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-irdg 6579 df-frec 6600 df-1o 6625 df-oadd 6629 df-er 6745 df-en 6953 df-dom 6954 df-fin 6955 df-pnf 8259 df-mnf 8260 df-xr 8261 df-ltxr 8262 df-le 8263 df-sub 8395 df-neg 8396 df-reap 8798 df-ap 8805 df-div 8896 df-inn 9187 df-2 9245 df-3 9246 df-4 9247 df-n0 9446 df-z 9523 df-uz 9799 df-q 9897 df-rp 9932 df-fz 10287 df-fzo 10421 df-seqfrec 10754 df-exp 10845 df-ihash 11082 df-cj 11463 df-re 11464 df-im 11465 df-rsqrt 11619 df-abs 11620 df-clim 11900 df-proddc 12173 |
| This theorem is referenced by: fprodap0f 12258 fprodle 12262 |
| Copyright terms: Public domain | W3C validator |