fprodunsn - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > fprodunsn		GIF version

Theorem fprodunsn 11786

Description: Multiply in an additional term in a finite product. See also fprodsplitsn 11815 which is the same but with a Ⅎ𝑘𝜑 hypothesis in place of the distinct variable condition between 𝜑 and 𝑘. (Contributed by Jim Kingdon, 16-Aug-2024.)

**Hypotheses**
Ref	Expression
fprodunsn.f	⊢ Ⅎ𝑘𝐷
fprodunsn.a	⊢ (𝜑 → 𝐴 ∈ Fin)
fprodunsn.b	⊢ (𝜑 → 𝐵 ∈ 𝑉)
fprodunsn.ba	⊢ (𝜑 → ¬ 𝐵 ∈ 𝐴)
fprodunsn.ccl	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ)
fprodunsn.dcl	⊢ (𝜑 → 𝐷 ∈ ℂ)
fprodunsn.d	⊢ (𝑘 = 𝐵 → 𝐶 = 𝐷)

**Assertion**
Ref	Expression
fprodunsn	⊢ (𝜑 → ∏𝑘 ∈ (𝐴 ∪ {𝐵})𝐶 = (∏𝑘 ∈ 𝐴 𝐶 · 𝐷))

Distinct variable groups: 𝐴,𝑘 𝐵,𝑘 𝑘,𝑉 𝜑,𝑘 Allowed substitution hints: 𝐶(𝑘) 𝐷(𝑘)

Proof of Theorem fprodunsn Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fprodunsn.ba	. . . 4 ⊢ (𝜑 → ¬ 𝐵 ∈ 𝐴)
2		disjsn 3685	. . . 4 ⊢ ((𝐴 ∩ {𝐵}) = ∅ ↔ ¬ 𝐵 ∈ 𝐴)
3	1, 2	sylibr 134	. . 3 ⊢ (𝜑 → (𝐴 ∩ {𝐵}) = ∅)
4		eqidd 2197	. . 3 ⊢ (𝜑 → (𝐴 ∪ {𝐵}) = (𝐴 ∪ {𝐵}))
5		fprodunsn.a	. . . 4 ⊢ (𝜑 → 𝐴 ∈ Fin)
6		fprodunsn.b	. . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑉)
7		unsnfi 6989	. . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ 𝑉 ∧ ¬ 𝐵 ∈ 𝐴) → (𝐴 ∪ {𝐵}) ∈ Fin)
8	5, 6, 1, 7	syl3anc 1249	. . 3 ⊢ (𝜑 → (𝐴 ∪ {𝐵}) ∈ Fin)
9		simpr 110	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑗 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑗 ∈ 𝐴) → 𝑗 ∈ 𝐴)
10	9	orcd 734	. . . . . 6 ⊢ (((𝜑 ∧ 𝑗 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑗 ∈ 𝐴) → (𝑗 ∈ 𝐴 ∨ ¬ 𝑗 ∈ 𝐴))
11		df-dc 836	. . . . . 6 ⊢ (DECID 𝑗 ∈ 𝐴 ↔ (𝑗 ∈ 𝐴 ∨ ¬ 𝑗 ∈ 𝐴))
12	10, 11	sylibr 134	. . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑗 ∈ 𝐴) → DECID 𝑗 ∈ 𝐴)
13		simpr 110	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑗 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑗 ∈ {𝐵}) → 𝑗 ∈ {𝐵})
14		velsn 3640	. . . . . . . . 9 ⊢ (𝑗 ∈ {𝐵} ↔ 𝑗 = 𝐵)
15	13, 14	sylib 122	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑗 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑗 ∈ {𝐵}) → 𝑗 = 𝐵)
16	1	ad2antrr 488	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑗 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑗 ∈ {𝐵}) → ¬ 𝐵 ∈ 𝐴)
17	15, 16	eqneltrd 2292	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑗 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑗 ∈ {𝐵}) → ¬ 𝑗 ∈ 𝐴)
18	17	olcd 735	. . . . . 6 ⊢ (((𝜑 ∧ 𝑗 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑗 ∈ {𝐵}) → (𝑗 ∈ 𝐴 ∨ ¬ 𝑗 ∈ 𝐴))
19	18, 11	sylibr 134	. . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑗 ∈ {𝐵}) → DECID 𝑗 ∈ 𝐴)
20		elun 3305	. . . . . . 7 ⊢ (𝑗 ∈ (𝐴 ∪ {𝐵}) ↔ (𝑗 ∈ 𝐴 ∨ 𝑗 ∈ {𝐵}))
21	20	biimpi 120	. . . . . 6 ⊢ (𝑗 ∈ (𝐴 ∪ {𝐵}) → (𝑗 ∈ 𝐴 ∨ 𝑗 ∈ {𝐵}))
22	21	adantl 277	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝐴 ∪ {𝐵})) → (𝑗 ∈ 𝐴 ∨ 𝑗 ∈ {𝐵}))
23	12, 19, 22	mpjaodan 799	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝐴 ∪ {𝐵})) → DECID 𝑗 ∈ 𝐴)
24	23	ralrimiva 2570	. . 3 ⊢ (𝜑 → ∀𝑗 ∈ (𝐴 ∪ {𝐵})DECID 𝑗 ∈ 𝐴)
25		fprodunsn.ccl	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ)
26	25	adantlr 477	. . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ)
27		elsni 3641	. . . . . . 7 ⊢ (𝑘 ∈ {𝐵} → 𝑘 = 𝐵)
28	27	adantl 277	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑘 ∈ {𝐵}) → 𝑘 = 𝐵)
29		fprodunsn.d	. . . . . 6 ⊢ (𝑘 = 𝐵 → 𝐶 = 𝐷)
30	28, 29	syl 14	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑘 ∈ {𝐵}) → 𝐶 = 𝐷)
31		fprodunsn.dcl	. . . . . 6 ⊢ (𝜑 → 𝐷 ∈ ℂ)
32	31	ad2antrr 488	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑘 ∈ {𝐵}) → 𝐷 ∈ ℂ)
33	30, 32	eqeltrd 2273	. . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑘 ∈ {𝐵}) → 𝐶 ∈ ℂ)
34		elun 3305	. . . . . 6 ⊢ (𝑘 ∈ (𝐴 ∪ {𝐵}) ↔ (𝑘 ∈ 𝐴 ∨ 𝑘 ∈ {𝐵}))
35	34	biimpi 120	. . . . 5 ⊢ (𝑘 ∈ (𝐴 ∪ {𝐵}) → (𝑘 ∈ 𝐴 ∨ 𝑘 ∈ {𝐵}))
36	35	adantl 277	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∪ {𝐵})) → (𝑘 ∈ 𝐴 ∨ 𝑘 ∈ {𝐵}))
37	26, 33, 36	mpjaodan 799	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∪ {𝐵})) → 𝐶 ∈ ℂ)
38	3, 4, 8, 24, 37	fprodsplitdc 11778	. 2 ⊢ (𝜑 → ∏𝑘 ∈ (𝐴 ∪ {𝐵})𝐶 = (∏𝑘 ∈ 𝐴 𝐶 · ∏𝑘 ∈ {𝐵}𝐶))
39		fprodunsn.f	. . . . 5 ⊢ Ⅎ𝑘𝐷
40	39, 29	prodsnf 11774	. . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ ℂ) → ∏𝑘 ∈ {𝐵}𝐶 = 𝐷)
41	6, 31, 40	syl2anc 411	. . 3 ⊢ (𝜑 → ∏𝑘 ∈ {𝐵}𝐶 = 𝐷)
42	41	oveq2d 5941	. 2 ⊢ (𝜑 → (∏𝑘 ∈ 𝐴 𝐶 · ∏𝑘 ∈ {𝐵}𝐶) = (∏𝑘 ∈ 𝐴 𝐶 · 𝐷))
43	38, 42	eqtrd 2229	1 ⊢ (𝜑 → ∏𝑘 ∈ (𝐴 ∪ {𝐵})𝐶 = (∏𝑘 ∈ 𝐴 𝐶 · 𝐷))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∨ wo 709 DECID wdc 835 = wceq 1364 ∈ wcel 2167 Ⅎwnfc 2326 ∪ cun 3155 ∩ cin 3156 ∅c0 3451 {csn 3623 (class class class)co 5925 Fincfn 6808 ℂcc 7894 · cmul 7901 ∏cprod 11732

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 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-coll 4149 ax-sep 4152 ax-nul 4160 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-setind 4574 ax-iinf 4625 ax-cnex 7987 ax-resscn 7988 ax-1cn 7989 ax-1re 7990 ax-icn 7991 ax-addcl 7992 ax-addrcl 7993 ax-mulcl 7994 ax-mulrcl 7995 ax-addcom 7996 ax-mulcom 7997 ax-addass 7998 ax-mulass 7999 ax-distr 8000 ax-i2m1 8001 ax-0lt1 8002 ax-1rid 8003 ax-0id 8004 ax-rnegex 8005 ax-precex 8006 ax-cnre 8007 ax-pre-ltirr 8008 ax-pre-ltwlin 8009 ax-pre-lttrn 8010 ax-pre-apti 8011 ax-pre-ltadd 8012 ax-pre-mulgt0 8013 ax-pre-mulext 8014 ax-arch 8015 ax-caucvg 8016

This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-reu 2482 df-rmo 2483 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3452 df-if 3563 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-int 3876 df-iun 3919 df-br 4035 df-opab 4096 df-mpt 4097 df-tr 4133 df-id 4329 df-po 4332 df-iso 4333 df-iord 4402 df-on 4404 df-ilim 4405 df-suc 4407 df-iom 4628 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-ima 4677 df-iota 5220 df-fun 5261 df-fn 5262 df-f 5263 df-f1 5264 df-fo 5265 df-f1o 5266 df-fv 5267 df-isom 5268 df-riota 5880 df-ov 5928 df-oprab 5929 df-mpo 5930 df-1st 6207 df-2nd 6208 df-recs 6372 df-irdg 6437 df-frec 6458 df-1o 6483 df-oadd 6487 df-er 6601 df-en 6809 df-dom 6810 df-fin 6811 df-pnf 8080 df-mnf 8081 df-xr 8082 df-ltxr 8083 df-le 8084 df-sub 8216 df-neg 8217 df-reap 8619 df-ap 8626 df-div 8717 df-inn 9008 df-2 9066 df-3 9067 df-4 9068 df-n0 9267 df-z 9344 df-uz 9619 df-q 9711 df-rp 9746 df-fz 10101 df-fzo 10235 df-seqfrec 10557 df-exp 10648 df-ihash 10885 df-cj 11024 df-re 11025 df-im 11026 df-rsqrt 11180 df-abs 11181 df-clim 11461 df-proddc 11733

This theorem is referenced by: fprodcl2lem 11787 fprodconst 11802 fprodap0 11803 fprodrec 11811 fprodmodd 11823

W3C validator