fprodmul - Intuitionistic Logic Explorer

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

Theorem fprodmul 11470

Description: The product of two finite products. (Contributed by Scott Fenton, 14-Dec-2017.)

**Hypotheses**
Ref	Expression
fprodmul.1	⊢ (𝜑 → 𝐴 ∈ Fin)
fprodmul.2	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)
fprodmul.3	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ)

**Assertion**
Ref	Expression
fprodmul	⊢ (𝜑 → ∏𝑘 ∈ 𝐴 (𝐵 · 𝐶) = (∏𝑘 ∈ 𝐴 𝐵 · ∏𝑘 ∈ 𝐴 𝐶))

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

Proof of Theorem fprodmul Dummy variables 𝑝 𝑓 𝑚 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		1t1e1 8968	. . . . 5 ⊢ (1 · 1) = 1
2		prod0 11464	. . . . . 6 ⊢ ∏𝑘 ∈ ∅ 𝐵 = 1
3		prod0 11464	. . . . . 6 ⊢ ∏𝑘 ∈ ∅ 𝐶 = 1
4	2, 3	oveq12i 5830	. . . . 5 ⊢ (∏𝑘 ∈ ∅ 𝐵 · ∏𝑘 ∈ ∅ 𝐶) = (1 · 1)
5		prod0 11464	. . . . 5 ⊢ ∏𝑘 ∈ ∅ (𝐵 · 𝐶) = 1
6	1, 4, 5	3eqtr4ri 2189	. . . 4 ⊢ ∏𝑘 ∈ ∅ (𝐵 · 𝐶) = (∏𝑘 ∈ ∅ 𝐵 · ∏𝑘 ∈ ∅ 𝐶)
7		prodeq1 11432	. . . 4 ⊢ (𝐴 = ∅ → ∏𝑘 ∈ 𝐴 (𝐵 · 𝐶) = ∏𝑘 ∈ ∅ (𝐵 · 𝐶))
8		prodeq1 11432	. . . . 5 ⊢ (𝐴 = ∅ → ∏𝑘 ∈ 𝐴 𝐵 = ∏𝑘 ∈ ∅ 𝐵)
9		prodeq1 11432	. . . . 5 ⊢ (𝐴 = ∅ → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ ∅ 𝐶)
10	8, 9	oveq12d 5836	. . . 4 ⊢ (𝐴 = ∅ → (∏𝑘 ∈ 𝐴 𝐵 · ∏𝑘 ∈ 𝐴 𝐶) = (∏𝑘 ∈ ∅ 𝐵 · ∏𝑘 ∈ ∅ 𝐶))
11	6, 7, 10	3eqtr4a 2216	. . 3 ⊢ (𝐴 = ∅ → ∏𝑘 ∈ 𝐴 (𝐵 · 𝐶) = (∏𝑘 ∈ 𝐴 𝐵 · ∏𝑘 ∈ 𝐴 𝐶))
12	11	a1i 9	. 2 ⊢ (𝜑 → (𝐴 = ∅ → ∏𝑘 ∈ 𝐴 (𝐵 · 𝐶) = (∏𝑘 ∈ 𝐴 𝐵 · ∏𝑘 ∈ 𝐴 𝐶)))
13		simprl 521	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (♯‘𝐴) ∈ ℕ)
14		nnuz 9457	. . . . . . . . 9 ⊢ ℕ = (ℤ_≥‘1)
15	13, 14	eleqtrdi 2250	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (♯‘𝐴) ∈ (ℤ_≥‘1))
16		elnnuz 9458	. . . . . . . . . . . 12 ⊢ (𝑝 ∈ ℕ ↔ 𝑝 ∈ (ℤ_≥‘1))
17	16	biimpri 132	. . . . . . . . . . 11 ⊢ (𝑝 ∈ (ℤ_≥‘1) → 𝑝 ∈ ℕ)
18	17	adantl 275	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → 𝑝 ∈ ℕ)
19		fprodmul.2	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)
20	19	fmpttd 5619	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℂ)
21	20	adantr 274	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (𝑘 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℂ)
22		f1of 5411	. . . . . . . . . . . . . . 15 ⊢ (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → 𝑓:(1...(♯‘𝐴))⟶𝐴)
23	22	ad2antll 483	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → 𝑓:(1...(♯‘𝐴))⟶𝐴)
24		fco 5332	. . . . . . . . . . . . . 14 ⊢ (((𝑘 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℂ ∧ 𝑓:(1...(♯‘𝐴))⟶𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
25	21, 23, 24	syl2anc 409	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → ((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
26	25	ad2antrr 480	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → ((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
27		simpr 109	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → 𝑝 ≤ (♯‘𝐴))
28		simplr 520	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → 𝑝 ∈ (ℤ_≥‘1))
29	13	ad2antrr 480	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → (♯‘𝐴) ∈ ℕ)
30	29	nnzd 9268	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → (♯‘𝐴) ∈ ℤ)
31		elfz5 9902	. . . . . . . . . . . . . 14 ⊢ ((𝑝 ∈ (ℤ_≥‘1) ∧ (♯‘𝐴) ∈ ℤ) → (𝑝 ∈ (1...(♯‘𝐴)) ↔ 𝑝 ≤ (♯‘𝐴)))
32	28, 30, 31	syl2anc 409	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → (𝑝 ∈ (1...(♯‘𝐴)) ↔ 𝑝 ≤ (♯‘𝐴)))
33	27, 32	mpbird 166	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → 𝑝 ∈ (1...(♯‘𝐴)))
34	26, 33	ffvelrnd 5600	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝) ∈ ℂ)
35		1cnd 7877	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑝 ≤ (♯‘𝐴)) → 1 ∈ ℂ)
36	18	nnzd 9268	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → 𝑝 ∈ ℤ)
37	13	adantr 274	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → (♯‘𝐴) ∈ ℕ)
38	37	nnzd 9268	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → (♯‘𝐴) ∈ ℤ)
39		zdcle 9223	. . . . . . . . . . . 12 ⊢ ((𝑝 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ) → DECID 𝑝 ≤ (♯‘𝐴))
40	36, 38, 39	syl2anc 409	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → DECID 𝑝 ≤ (♯‘𝐴))
41	34, 35, 40	ifcldadc 3534	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝), 1) ∈ ℂ)
42		breq1 3968	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑝 → (𝑛 ≤ (♯‘𝐴) ↔ 𝑝 ≤ (♯‘𝐴)))
43		fveq2 5465	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑝 → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛) = (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝))
44	42, 43	ifbieq1d 3527	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑝 → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 1) = if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝), 1))
45		eqid 2157	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 1)) = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 1))
46	44, 45	fvmptg 5541	. . . . . . . . . 10 ⊢ ((𝑝 ∈ ℕ ∧ if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝), 1) ∈ ℂ) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 1))‘𝑝) = if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝), 1))
47	18, 41, 46	syl2anc 409	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 1))‘𝑝) = if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝), 1))
48	47, 41	eqeltrd 2234	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 1))‘𝑝) ∈ ℂ)
49		fprodmul.3	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ)
50	49	fmpttd 5619	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝐶):𝐴⟶ℂ)
51	50	adantr 274	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (𝑘 ∈ 𝐴 ↦ 𝐶):𝐴⟶ℂ)
52		fco 5332	. . . . . . . . . . . . . 14 ⊢ (((𝑘 ∈ 𝐴 ↦ 𝐶):𝐴⟶ℂ ∧ 𝑓:(1...(♯‘𝐴))⟶𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
53	51, 23, 52	syl2anc 409	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → ((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
54	53	ad2antrr 480	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → ((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
55	54, 33	ffvelrnd 5600	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝) ∈ ℂ)
56	55, 35, 40	ifcldadc 3534	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝), 1) ∈ ℂ)
57		fveq2 5465	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑝 → (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛) = (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝))
58	42, 57	ifbieq1d 3527	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑝 → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 1) = if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝), 1))
59		eqid 2157	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 1)) = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 1))
60	58, 59	fvmptg 5541	. . . . . . . . . 10 ⊢ ((𝑝 ∈ ℕ ∧ if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝), 1) ∈ ℂ) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 1))‘𝑝) = if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝), 1))
61	18, 56, 60	syl2anc 409	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 1))‘𝑝) = if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝), 1))
62	61, 56	eqeltrd 2234	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 1))‘𝑝) ∈ ℂ)
63	23	ad2antrr 480	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → 𝑓:(1...(♯‘𝐴))⟶𝐴)
64	63, 33	ffvelrnd 5600	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → (𝑓‘𝑝) ∈ 𝐴)
65		csbov12g 5854	. . . . . . . . . . . . . 14 ⊢ ((𝑓‘𝑝) ∈ 𝐴 → ⦋(𝑓‘𝑝) / 𝑘⦌(𝐵 · 𝐶) = (⦋(𝑓‘𝑝) / 𝑘⦌𝐵 · ⦋(𝑓‘𝑝) / 𝑘⦌𝐶))
66	64, 65	syl 14	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → ⦋(𝑓‘𝑝) / 𝑘⦌(𝐵 · 𝐶) = (⦋(𝑓‘𝑝) / 𝑘⦌𝐵 · ⦋(𝑓‘𝑝) / 𝑘⦌𝐶))
67	19, 49	mulcld 7881	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐵 · 𝐶) ∈ ℂ)
68	67	ralrimiva 2530	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 (𝐵 · 𝐶) ∈ ℂ)
69	68	ad3antrrr 484	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → ∀𝑘 ∈ 𝐴 (𝐵 · 𝐶) ∈ ℂ)
70		nfcsb1v 3064	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑘⦋(𝑓‘𝑝) / 𝑘⦌(𝐵 · 𝐶)
71	70	nfel1 2310	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘⦋(𝑓‘𝑝) / 𝑘⦌(𝐵 · 𝐶) ∈ ℂ
72		csbeq1a 3040	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 = (𝑓‘𝑝) → (𝐵 · 𝐶) = ⦋(𝑓‘𝑝) / 𝑘⦌(𝐵 · 𝐶))
73	72	eleq1d 2226	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 = (𝑓‘𝑝) → ((𝐵 · 𝐶) ∈ ℂ ↔ ⦋(𝑓‘𝑝) / 𝑘⦌(𝐵 · 𝐶) ∈ ℂ))
74	71, 73	rspc 2810	. . . . . . . . . . . . . . 15 ⊢ ((𝑓‘𝑝) ∈ 𝐴 → (∀𝑘 ∈ 𝐴 (𝐵 · 𝐶) ∈ ℂ → ⦋(𝑓‘𝑝) / 𝑘⦌(𝐵 · 𝐶) ∈ ℂ))
75	64, 69, 74	sylc 62	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → ⦋(𝑓‘𝑝) / 𝑘⦌(𝐵 · 𝐶) ∈ ℂ)
76		eqid 2157	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) = (𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶))
77	76	fvmpts 5543	. . . . . . . . . . . . . 14 ⊢ (((𝑓‘𝑝) ∈ 𝐴 ∧ ⦋(𝑓‘𝑝) / 𝑘⦌(𝐵 · 𝐶) ∈ ℂ) → ((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶))‘(𝑓‘𝑝)) = ⦋(𝑓‘𝑝) / 𝑘⦌(𝐵 · 𝐶))
78	64, 75, 77	syl2anc 409	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → ((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶))‘(𝑓‘𝑝)) = ⦋(𝑓‘𝑝) / 𝑘⦌(𝐵 · 𝐶))
79	19	ralrimiva 2530	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ)
80	79	ad3antrrr 484	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ)
81		nfcsb1v 3064	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑘⦋(𝑓‘𝑝) / 𝑘⦌𝐵
82	81	nfel1 2310	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑘⦋(𝑓‘𝑝) / 𝑘⦌𝐵 ∈ ℂ
83		csbeq1a 3040	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 = (𝑓‘𝑝) → 𝐵 = ⦋(𝑓‘𝑝) / 𝑘⦌𝐵)
84	83	eleq1d 2226	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 = (𝑓‘𝑝) → (𝐵 ∈ ℂ ↔ ⦋(𝑓‘𝑝) / 𝑘⦌𝐵 ∈ ℂ))
85	82, 84	rspc 2810	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓‘𝑝) ∈ 𝐴 → (∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ → ⦋(𝑓‘𝑝) / 𝑘⦌𝐵 ∈ ℂ))
86	64, 80, 85	sylc 62	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → ⦋(𝑓‘𝑝) / 𝑘⦌𝐵 ∈ ℂ)
87		eqid 2157	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ 𝐴 ↦ 𝐵) = (𝑘 ∈ 𝐴 ↦ 𝐵)
88	87	fvmpts 5543	. . . . . . . . . . . . . . 15 ⊢ (((𝑓‘𝑝) ∈ 𝐴 ∧ ⦋(𝑓‘𝑝) / 𝑘⦌𝐵 ∈ ℂ) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑝)) = ⦋(𝑓‘𝑝) / 𝑘⦌𝐵)
89	64, 86, 88	syl2anc 409	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑝)) = ⦋(𝑓‘𝑝) / 𝑘⦌𝐵)
90	49	ralrimiva 2530	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐶 ∈ ℂ)
91	90	ad3antrrr 484	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → ∀𝑘 ∈ 𝐴 𝐶 ∈ ℂ)
92		nfcsb1v 3064	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑘⦋(𝑓‘𝑝) / 𝑘⦌𝐶
93	92	nfel1 2310	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑘⦋(𝑓‘𝑝) / 𝑘⦌𝐶 ∈ ℂ
94		csbeq1a 3040	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 = (𝑓‘𝑝) → 𝐶 = ⦋(𝑓‘𝑝) / 𝑘⦌𝐶)
95	94	eleq1d 2226	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 = (𝑓‘𝑝) → (𝐶 ∈ ℂ ↔ ⦋(𝑓‘𝑝) / 𝑘⦌𝐶 ∈ ℂ))
96	93, 95	rspc 2810	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓‘𝑝) ∈ 𝐴 → (∀𝑘 ∈ 𝐴 𝐶 ∈ ℂ → ⦋(𝑓‘𝑝) / 𝑘⦌𝐶 ∈ ℂ))
97	64, 91, 96	sylc 62	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → ⦋(𝑓‘𝑝) / 𝑘⦌𝐶 ∈ ℂ)
98		eqid 2157	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ 𝐴 ↦ 𝐶) = (𝑘 ∈ 𝐴 ↦ 𝐶)
99	98	fvmpts 5543	. . . . . . . . . . . . . . 15 ⊢ (((𝑓‘𝑝) ∈ 𝐴 ∧ ⦋(𝑓‘𝑝) / 𝑘⦌𝐶 ∈ ℂ) → ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑝)) = ⦋(𝑓‘𝑝) / 𝑘⦌𝐶)
100	64, 97, 99	syl2anc 409	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑝)) = ⦋(𝑓‘𝑝) / 𝑘⦌𝐶)
101	89, 100	oveq12d 5836	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → (((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑝)) · ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑝))) = (⦋(𝑓‘𝑝) / 𝑘⦌𝐵 · ⦋(𝑓‘𝑝) / 𝑘⦌𝐶))
102	66, 78, 101	3eqtr4d 2200	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → ((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶))‘(𝑓‘𝑝)) = (((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑝)) · ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑝))))
103		fvco3 5536	. . . . . . . . . . . . 13 ⊢ ((𝑓:(1...(♯‘𝐴))⟶𝐴 ∧ 𝑝 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑝) = ((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶))‘(𝑓‘𝑝)))
104	63, 33, 103	syl2anc 409	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑝) = ((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶))‘(𝑓‘𝑝)))
105		fvco3 5536	. . . . . . . . . . . . . 14 ⊢ ((𝑓:(1...(♯‘𝐴))⟶𝐴 ∧ 𝑝 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑝)))
106	63, 33, 105	syl2anc 409	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑝)))
107		fvco3 5536	. . . . . . . . . . . . . 14 ⊢ ((𝑓:(1...(♯‘𝐴))⟶𝐴 ∧ 𝑝 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝) = ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑝)))
108	63, 33, 107	syl2anc 409	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝) = ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑝)))
109	106, 108	oveq12d 5836	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → ((((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝) · (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝)) = (((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑝)) · ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑝))))
110	102, 104, 109	3eqtr4d 2200	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑝) = ((((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝) · (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝)))
111	27	iftrued 3512	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑝), 1) = (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑝))
112	27	iftrued 3512	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝), 1) = (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝))
113	27	iftrued 3512	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝), 1) = (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝))
114	112, 113	oveq12d 5836	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → (if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝), 1) · if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝), 1)) = ((((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝) · (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝)))
115	110, 111, 114	3eqtr4d 2200	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑝), 1) = (if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝), 1) · if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝), 1)))
116	1	eqcomi 2161	. . . . . . . . . . 11 ⊢ 1 = (1 · 1)
117		simpr 109	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑝 ≤ (♯‘𝐴)) → ¬ 𝑝 ≤ (♯‘𝐴))
118	117	iffalsed 3515	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑝 ≤ (♯‘𝐴)) → if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑝), 1) = 1)
119	117	iffalsed 3515	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑝 ≤ (♯‘𝐴)) → if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝), 1) = 1)
120	117	iffalsed 3515	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑝 ≤ (♯‘𝐴)) → if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝), 1) = 1)
121	119, 120	oveq12d 5836	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑝 ≤ (♯‘𝐴)) → (if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝), 1) · if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝), 1)) = (1 · 1))
122	116, 118, 121	3eqtr4a 2216	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑝 ≤ (♯‘𝐴)) → if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑝), 1) = (if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝), 1) · if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝), 1)))
123		exmiddc 822	. . . . . . . . . . 11 ⊢ (DECID 𝑝 ≤ (♯‘𝐴) → (𝑝 ≤ (♯‘𝐴) ∨ ¬ 𝑝 ≤ (♯‘𝐴)))
124	40, 123	syl 14	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → (𝑝 ≤ (♯‘𝐴) ∨ ¬ 𝑝 ≤ (♯‘𝐴)))
125	115, 122, 124	mpjaodan 788	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑝), 1) = (if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝), 1) · if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝), 1)))
126	78, 75	eqeltrd 2234	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → ((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶))‘(𝑓‘𝑝)) ∈ ℂ)
127	104, 126	eqeltrd 2234	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ≤ (♯‘𝐴)) → (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑝) ∈ ℂ)
128	127, 35, 40	ifcldadc 3534	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑝), 1) ∈ ℂ)
129		fveq2 5465	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑝 → (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑛) = (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑝))
130	42, 129	ifbieq1d 3527	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑝 → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑛), 1) = if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑝), 1))
131		eqid 2157	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑛), 1)) = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑛), 1))
132	130, 131	fvmptg 5541	. . . . . . . . . 10 ⊢ ((𝑝 ∈ ℕ ∧ if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑝), 1) ∈ ℂ) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑛), 1))‘𝑝) = if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑝), 1))
133	18, 128, 132	syl2anc 409	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑛), 1))‘𝑝) = if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑝), 1))
134	47, 61	oveq12d 5836	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → (((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 1))‘𝑝) · ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 1))‘𝑝)) = (if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑝), 1) · if(𝑝 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑝), 1)))
135	125, 133, 134	3eqtr4d 2200	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑛), 1))‘𝑝) = (((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 1))‘𝑝) · ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 1))‘𝑝)))
136	15, 48, 62, 135	prod3fmul 11420	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑛), 1)))‘(♯‘𝐴)) = ((seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 1)))‘(♯‘𝐴)) · (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 1)))‘(♯‘𝐴))))
137		fveq2 5465	. . . . . . . 8 ⊢ (𝑚 = (𝑓‘𝑛) → ((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶))‘𝑚) = ((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶))‘(𝑓‘𝑛)))
138		simprr 522	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)
139	67	fmpttd 5619	. . . . . . . . . 10 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)):𝐴⟶ℂ)
140	139	adantr 274	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)):𝐴⟶ℂ)
141	140	ffvelrnda 5599	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑚 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶))‘𝑚) ∈ ℂ)
142		fvco3 5536	. . . . . . . . 9 ⊢ ((𝑓:(1...(♯‘𝐴))⟶𝐴 ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶))‘(𝑓‘𝑛)))
143	23, 142	sylan 281	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶))‘(𝑓‘𝑛)))
144	137, 13, 138, 141, 143	fprodseq 11462	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶))‘𝑚) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑛), 1)))‘(♯‘𝐴)))
145		fveq2 5465	. . . . . . . . 9 ⊢ (𝑚 = (𝑓‘𝑛) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛)))
146	21	ffvelrnda 5599	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑚 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) ∈ ℂ)
147		fvco3 5536	. . . . . . . . . 10 ⊢ ((𝑓:(1...(♯‘𝐴))⟶𝐴 ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛)))
148	23, 147	sylan 281	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛)))
149	145, 13, 138, 146, 148	fprodseq 11462	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 1)))‘(♯‘𝐴)))
150		fveq2 5465	. . . . . . . . 9 ⊢ (𝑚 = (𝑓‘𝑛) → ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑛)))
151	51	ffvelrnda 5599	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑚 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) ∈ ℂ)
152		fvco3 5536	. . . . . . . . . 10 ⊢ ((𝑓:(1...(♯‘𝐴))⟶𝐴 ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑛)))
153	23, 152	sylan 281	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑛)))
154	150, 13, 138, 151, 153	fprodseq 11462	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 1)))‘(♯‘𝐴)))
155	149, 154	oveq12d 5836	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) · ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚)) = ((seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 1)))‘(♯‘𝐴)) · (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 1)))‘(♯‘𝐴))))
156	136, 144, 155	3eqtr4d 2200	. . . . . 6 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶))‘𝑚) = (∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) · ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚)))
157		prodfct 11466	. . . . . . . 8 ⊢ (∀𝑘 ∈ 𝐴 (𝐵 · 𝐶) ∈ ℂ → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶))‘𝑚) = ∏𝑘 ∈ 𝐴 (𝐵 · 𝐶))
158	68, 157	syl 14	. . . . . . 7 ⊢ (𝜑 → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶))‘𝑚) = ∏𝑘 ∈ 𝐴 (𝐵 · 𝐶))
159	158	adantr 274	. . . . . 6 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐵 · 𝐶))‘𝑚) = ∏𝑘 ∈ 𝐴 (𝐵 · 𝐶))
160		prodfct 11466	. . . . . . . . 9 ⊢ (∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = ∏𝑘 ∈ 𝐴 𝐵)
161	79, 160	syl 14	. . . . . . . 8 ⊢ (𝜑 → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = ∏𝑘 ∈ 𝐴 𝐵)
162		prodfct 11466	. . . . . . . . 9 ⊢ (∀𝑘 ∈ 𝐴 𝐶 ∈ ℂ → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ∏𝑘 ∈ 𝐴 𝐶)
163	90, 162	syl 14	. . . . . . . 8 ⊢ (𝜑 → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ∏𝑘 ∈ 𝐴 𝐶)
164	161, 163	oveq12d 5836	. . . . . . 7 ⊢ (𝜑 → (∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) · ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚)) = (∏𝑘 ∈ 𝐴 𝐵 · ∏𝑘 ∈ 𝐴 𝐶))
165	164	adantr 274	. . . . . 6 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) · ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚)) = (∏𝑘 ∈ 𝐴 𝐵 · ∏𝑘 ∈ 𝐴 𝐶))
166	156, 159, 165	3eqtr3d 2198	. . . . 5 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → ∏𝑘 ∈ 𝐴 (𝐵 · 𝐶) = (∏𝑘 ∈ 𝐴 𝐵 · ∏𝑘 ∈ 𝐴 𝐶))
167	166	expr 373	. . . 4 ⊢ ((𝜑 ∧ (♯‘𝐴) ∈ ℕ) → (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → ∏𝑘 ∈ 𝐴 (𝐵 · 𝐶) = (∏𝑘 ∈ 𝐴 𝐵 · ∏𝑘 ∈ 𝐴 𝐶)))
168	167	exlimdv 1799	. . 3 ⊢ ((𝜑 ∧ (♯‘𝐴) ∈ ℕ) → (∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → ∏𝑘 ∈ 𝐴 (𝐵 · 𝐶) = (∏𝑘 ∈ 𝐴 𝐵 · ∏𝑘 ∈ 𝐴 𝐶)))
169	168	expimpd 361	. 2 ⊢ (𝜑 → (((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) → ∏𝑘 ∈ 𝐴 (𝐵 · 𝐶) = (∏𝑘 ∈ 𝐴 𝐵 · ∏𝑘 ∈ 𝐴 𝐶)))
170		fprodmul.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ Fin)
171		fz1f1o 11254	. . 3 ⊢ (𝐴 ∈ Fin → (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)))
172	170, 171	syl 14	. 2 ⊢ (𝜑 → (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)))
173	12, 169, 172	mpjaod 708	1 ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 (𝐵 · 𝐶) = (∏𝑘 ∈ 𝐴 𝐵 · ∏𝑘 ∈ 𝐴 𝐶))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ↔ wb 104 ∨ wo 698 DECID wdc 820 = wceq 1335 ∃wex 1472 ∈ wcel 2128 ∀wral 2435 ⦋csb 3031 ∅c0 3394 ifcif 3505 class class class wbr 3965 ↦ cmpt 4025 ∘ ccom 4587 ⟶wf 5163 –1-1-onto→wf1o 5166 ‘cfv 5167 (class class class)co 5818 Fincfn 6678 ℂcc 7713 1c1 7716 · cmul 7720 ≤ cle 7896 ℕcn 8816 ℤcz 9150 ℤ_≥cuz 9422 ...cfz 9894 seqcseq 10326 ♯chash 10631 ∏cprod 11429

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-10 1485 ax-11 1486 ax-i12 1487 ax-bndl 1489 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-13 2130 ax-14 2131 ax-ext 2139 ax-coll 4079 ax-sep 4082 ax-nul 4090 ax-pow 4134 ax-pr 4168 ax-un 4392 ax-setind 4494 ax-iinf 4545 ax-cnex 7806 ax-resscn 7807 ax-1cn 7808 ax-1re 7809 ax-icn 7810 ax-addcl 7811 ax-addrcl 7812 ax-mulcl 7813 ax-mulrcl 7814 ax-addcom 7815 ax-mulcom 7816 ax-addass 7817 ax-mulass 7818 ax-distr 7819 ax-i2m1 7820 ax-0lt1 7821 ax-1rid 7822 ax-0id 7823 ax-rnegex 7824 ax-precex 7825 ax-cnre 7826 ax-pre-ltirr 7827 ax-pre-ltwlin 7828 ax-pre-lttrn 7829 ax-pre-apti 7830 ax-pre-ltadd 7831 ax-pre-mulgt0 7832 ax-pre-mulext 7833 ax-arch 7834 ax-caucvg 7835

This theorem depends on definitions: df-bi 116 df-dc 821 df-3or 964 df-3an 965 df-tru 1338 df-fal 1341 df-nf 1441 df-sb 1743 df-eu 2009 df-mo 2010 df-clab 2144 df-cleq 2150 df-clel 2153 df-nfc 2288 df-ne 2328 df-nel 2423 df-ral 2440 df-rex 2441 df-reu 2442 df-rmo 2443 df-rab 2444 df-v 2714 df-sbc 2938 df-csb 3032 df-dif 3104 df-un 3106 df-in 3108 df-ss 3115 df-nul 3395 df-if 3506 df-pw 3545 df-sn 3566 df-pr 3567 df-op 3569 df-uni 3773 df-int 3808 df-iun 3851 df-br 3966 df-opab 4026 df-mpt 4027 df-tr 4063 df-id 4252 df-po 4255 df-iso 4256 df-iord 4325 df-on 4327 df-ilim 4328 df-suc 4330 df-iom 4548 df-xp 4589 df-rel 4590 df-cnv 4591 df-co 4592 df-dm 4593 df-rn 4594 df-res 4595 df-ima 4596 df-iota 5132 df-fun 5169 df-fn 5170 df-f 5171 df-f1 5172 df-fo 5173 df-f1o 5174 df-fv 5175 df-isom 5176 df-riota 5774 df-ov 5821 df-oprab 5822 df-mpo 5823 df-1st 6082 df-2nd 6083 df-recs 6246 df-irdg 6311 df-frec 6332 df-1o 6357 df-oadd 6361 df-er 6473 df-en 6679 df-dom 6680 df-fin 6681 df-pnf 7897 df-mnf 7898 df-xr 7899 df-ltxr 7900 df-le 7901 df-sub 8031 df-neg 8032 df-reap 8433 df-ap 8440 df-div 8529 df-inn 8817 df-2 8875 df-3 8876 df-4 8877 df-n0 9074 df-z 9151 df-uz 9423 df-q 9511 df-rp 9543 df-fz 9895 df-fzo 10024 df-seqfrec 10327 df-exp 10401 df-ihash 10632 df-cj 10724 df-re 10725 df-im 10726 df-rsqrt 10880 df-abs 10881 df-clim 11158 df-proddc 11430

This theorem is referenced by: fprodsplitdc 11475 fproddivap 11509

W3C validator