| 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 12158 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 3729 | . . . 4 ⊢ ((𝐴 ∩ {𝐵}) = ∅ ↔ ¬ 𝐵 ∈ 𝐴) | |
| 4 | 2, 3 | sylibr 134 | . . 3 ⊢ (𝜑 → (𝐴 ∩ {𝐵}) = ∅) |
| 5 | eqidd 2230 | . . 3 ⊢ (𝜑 → (𝐴 ∪ {𝐵}) = (𝐴 ∪ {𝐵})) | |
| 6 | fprodsplitsn.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
| 7 | fprodsplitsn.b | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
| 8 | snfig 6984 | . . . . 5 ⊢ (𝐵 ∈ 𝑉 → {𝐵} ∈ Fin) | |
| 9 | 7, 8 | syl 14 | . . . 4 ⊢ (𝜑 → {𝐵} ∈ Fin) |
| 10 | unfidisj 7109 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ {𝐵} ∈ Fin ∧ (𝐴 ∩ {𝐵}) = ∅) → (𝐴 ∪ {𝐵}) ∈ Fin) | |
| 11 | 6, 9, 4, 10 | syl3anc 1271 | . . 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 2306 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 𝐵) → 𝐶 ∈ ℂ) |
| 19 | 18 | ex 115 | . . . . 5 ⊢ (𝜑 → (𝑘 = 𝐵 → 𝐶 ∈ ℂ)) |
| 20 | 13, 19 | jaod 722 | . . . 4 ⊢ (𝜑 → ((𝑘 ∈ 𝐴 ∨ 𝑘 = 𝐵) → 𝐶 ∈ ℂ)) |
| 21 | elun 3346 | . . . . 5 ⊢ (𝑘 ∈ (𝐴 ∪ {𝐵}) ↔ (𝑘 ∈ 𝐴 ∨ 𝑘 ∈ {𝐵})) | |
| 22 | elsni 3685 | . . . . . 6 ⊢ (𝑘 ∈ {𝐵} → 𝑘 = 𝐵) | |
| 23 | 22 | orim2i 766 | . . . . 5 ⊢ ((𝑘 ∈ 𝐴 ∨ 𝑘 ∈ {𝐵}) → (𝑘 ∈ 𝐴 ∨ 𝑘 = 𝐵)) |
| 24 | 21, 23 | sylbi 121 | . . . 4 ⊢ (𝑘 ∈ (𝐴 ∪ {𝐵}) → (𝑘 ∈ 𝐴 ∨ 𝑘 = 𝐵)) |
| 25 | 20, 24 | impel 280 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∪ {𝐵})) → 𝐶 ∈ ℂ) |
| 26 | 1, 4, 5, 11, 25 | fprodsplitf 12186 | . 2 ⊢ (𝜑 → ∏𝑘 ∈ (𝐴 ∪ {𝐵})𝐶 = (∏𝑘 ∈ 𝐴 𝐶 · ∏𝑘 ∈ {𝐵}𝐶)) |
| 27 | fprodsplitsn.kd | . . . . 5 ⊢ Ⅎ𝑘𝐷 | |
| 28 | 27, 14 | prodsnf 12146 | . . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ ℂ) → ∏𝑘 ∈ {𝐵}𝐶 = 𝐷) |
| 29 | 7, 16, 28 | syl2anc 411 | . . 3 ⊢ (𝜑 → ∏𝑘 ∈ {𝐵}𝐶 = 𝐷) |
| 30 | 29 | oveq2d 6029 | . 2 ⊢ (𝜑 → (∏𝑘 ∈ 𝐴 𝐶 · ∏𝑘 ∈ {𝐵}𝐶) = (∏𝑘 ∈ 𝐴 𝐶 · 𝐷)) |
| 31 | 26, 30 | eqtrd 2262 | 1 ⊢ (𝜑 → ∏𝑘 ∈ (𝐴 ∪ {𝐵})𝐶 = (∏𝑘 ∈ 𝐴 𝐶 · 𝐷)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∨ wo 713 = wceq 1395 Ⅎwnf 1506 ∈ wcel 2200 Ⅎwnfc 2359 ∪ cun 3196 ∩ cin 3197 ∅c0 3492 {csn 3667 (class class class)co 6013 Fincfn 6904 ℂcc 8023 · cmul 8030 ∏cprod 12104 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4202 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-iinf 4684 ax-cnex 8116 ax-resscn 8117 ax-1cn 8118 ax-1re 8119 ax-icn 8120 ax-addcl 8121 ax-addrcl 8122 ax-mulcl 8123 ax-mulrcl 8124 ax-addcom 8125 ax-mulcom 8126 ax-addass 8127 ax-mulass 8128 ax-distr 8129 ax-i2m1 8130 ax-0lt1 8131 ax-1rid 8132 ax-0id 8133 ax-rnegex 8134 ax-precex 8135 ax-cnre 8136 ax-pre-ltirr 8137 ax-pre-ltwlin 8138 ax-pre-lttrn 8139 ax-pre-apti 8140 ax-pre-ltadd 8141 ax-pre-mulgt0 8142 ax-pre-mulext 8143 ax-arch 8144 ax-caucvg 8145 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-if 3604 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-tr 4186 df-id 4388 df-po 4391 df-iso 4392 df-iord 4461 df-on 4463 df-ilim 4464 df-suc 4466 df-iom 4687 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-isom 5333 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-recs 6466 df-irdg 6531 df-frec 6552 df-1o 6577 df-oadd 6581 df-er 6697 df-en 6905 df-dom 6906 df-fin 6907 df-pnf 8209 df-mnf 8210 df-xr 8211 df-ltxr 8212 df-le 8213 df-sub 8345 df-neg 8346 df-reap 8748 df-ap 8755 df-div 8846 df-inn 9137 df-2 9195 df-3 9196 df-4 9197 df-n0 9396 df-z 9473 df-uz 9749 df-q 9847 df-rp 9882 df-fz 10237 df-fzo 10371 df-seqfrec 10703 df-exp 10794 df-ihash 11031 df-cj 11396 df-re 11397 df-im 11398 df-rsqrt 11552 df-abs 11553 df-clim 11833 df-proddc 12105 |
| This theorem is referenced by: fprodap0f 12190 fprodle 12194 |
| Copyright terms: Public domain | W3C validator |