prodmodclem3 - Intuitionistic Logic Explorer

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

Theorem prodmodclem3 11805

Description: Lemma for prodmodc 11808. (Contributed by Scott Fenton, 4-Dec-2017.) (Revised by Jim Kingdon, 11-Apr-2024.)

**Hypotheses**
Ref	Expression
prodmo.1	⊢ 𝐹 = (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))
prodmo.2	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)
prodmodc.3	⊢ 𝐺 = (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), ⦋(𝑓‘𝑗) / 𝑘⦌𝐵, 1))
prodmodclem3.4	⊢ 𝐻 = (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), ⦋(𝐾‘𝑗) / 𝑘⦌𝐵, 1))
prodmolem3.5	⊢ (𝜑 → (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ))
prodmolem3.6	⊢ (𝜑 → 𝑓:(1...𝑀)–1-1-onto→𝐴)
prodmolem3.7	⊢ (𝜑 → 𝐾:(1...𝑁)–1-1-onto→𝐴)

**Assertion**
Ref	Expression
prodmodclem3	⊢ (𝜑 → (seq1( · , 𝐺)‘𝑀) = (seq1( · , 𝐻)‘𝑁))

Distinct variable groups: 𝐴,𝑗,𝑘 𝐵,𝑗 𝑗,𝐺 𝑗,𝐾,𝑘 𝑗,𝑀 𝑓,𝑗,𝑘 𝜑,𝑘 Allowed substitution hints: 𝜑(𝑓,𝑗) 𝐴(𝑓) 𝐵(𝑓,𝑘) 𝐹(𝑓,𝑗,𝑘) 𝐺(𝑓,𝑘) 𝐻(𝑓,𝑗,𝑘) 𝐾(𝑓) 𝑀(𝑓,𝑘) 𝑁(𝑓,𝑗,𝑘)

Proof of Theorem prodmodclem3 Dummy variables 𝑖 𝑚 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mulcl 8034	. . . 4 ⊢ ((𝑚 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑚 · 𝑦) ∈ ℂ)
2	1	adantl 277	. . 3 ⊢ ((𝜑 ∧ (𝑚 ∈ ℂ ∧ 𝑦 ∈ ℂ)) → (𝑚 · 𝑦) ∈ ℂ)
3		mulcom 8036	. . . 4 ⊢ ((𝑚 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑚 · 𝑦) = (𝑦 · 𝑚))
4	3	adantl 277	. . 3 ⊢ ((𝜑 ∧ (𝑚 ∈ ℂ ∧ 𝑦 ∈ ℂ)) → (𝑚 · 𝑦) = (𝑦 · 𝑚))
5		mulass 8038	. . . 4 ⊢ ((𝑚 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑥 ∈ ℂ) → ((𝑚 · 𝑦) · 𝑥) = (𝑚 · (𝑦 · 𝑥)))
6	5	adantl 277	. . 3 ⊢ ((𝜑 ∧ (𝑚 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑥 ∈ ℂ)) → ((𝑚 · 𝑦) · 𝑥) = (𝑚 · (𝑦 · 𝑥)))
7		prodmolem3.5	. . . . 5 ⊢ (𝜑 → (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ))
8	7	simpld 112	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ)
9		nnuz 9666	. . . 4 ⊢ ℕ = (ℤ_≥‘1)
10	8, 9	eleqtrdi 2297	. . 3 ⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘1))
11		prodmolem3.6	. . . . . 6 ⊢ (𝜑 → 𝑓:(1...𝑀)–1-1-onto→𝐴)
12		f1ocnv 5529	. . . . . 6 ⊢ (𝑓:(1...𝑀)–1-1-onto→𝐴 → ^◡𝑓:𝐴–1-1-onto→(1...𝑀))
13	11, 12	syl 14	. . . . 5 ⊢ (𝜑 → ^◡𝑓:𝐴–1-1-onto→(1...𝑀))
14		prodmolem3.7	. . . . 5 ⊢ (𝜑 → 𝐾:(1...𝑁)–1-1-onto→𝐴)
15		f1oco 5539	. . . . 5 ⊢ ((^◡𝑓:𝐴–1-1-onto→(1...𝑀) ∧ 𝐾:(1...𝑁)–1-1-onto→𝐴) → (^◡𝑓 ∘ 𝐾):(1...𝑁)–1-1-onto→(1...𝑀))
16	13, 14, 15	syl2anc 411	. . . 4 ⊢ (𝜑 → (^◡𝑓 ∘ 𝐾):(1...𝑁)–1-1-onto→(1...𝑀))
17	7	ancomd 267	. . . . . . 7 ⊢ (𝜑 → (𝑁 ∈ ℕ ∧ 𝑀 ∈ ℕ))
18	17, 14, 11	nnf1o 11606	. . . . . 6 ⊢ (𝜑 → 𝑀 = 𝑁)
19	18	oveq2d 5950	. . . . 5 ⊢ (𝜑 → (1...𝑀) = (1...𝑁))
20	19	f1oeq2d 5512	. . . 4 ⊢ (𝜑 → ((^◡𝑓 ∘ 𝐾):(1...𝑀)–1-1-onto→(1...𝑀) ↔ (^◡𝑓 ∘ 𝐾):(1...𝑁)–1-1-onto→(1...𝑀)))
21	16, 20	mpbird 167	. . 3 ⊢ (𝜑 → (^◡𝑓 ∘ 𝐾):(1...𝑀)–1-1-onto→(1...𝑀))
22		prodmodc.3	. . . . 5 ⊢ 𝐺 = (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), ⦋(𝑓‘𝑗) / 𝑘⦌𝐵, 1))
23		breq1 4046	. . . . . 6 ⊢ (𝑗 = 𝑚 → (𝑗 ≤ (♯‘𝐴) ↔ 𝑚 ≤ (♯‘𝐴)))
24		fveq2 5570	. . . . . . 7 ⊢ (𝑗 = 𝑚 → (𝑓‘𝑗) = (𝑓‘𝑚))
25	24	csbeq1d 3099	. . . . . 6 ⊢ (𝑗 = 𝑚 → ⦋(𝑓‘𝑗) / 𝑘⦌𝐵 = ⦋(𝑓‘𝑚) / 𝑘⦌𝐵)
26	23, 25	ifbieq1d 3592	. . . . 5 ⊢ (𝑗 = 𝑚 → if(𝑗 ≤ (♯‘𝐴), ⦋(𝑓‘𝑗) / 𝑘⦌𝐵, 1) = if(𝑚 ≤ (♯‘𝐴), ⦋(𝑓‘𝑚) / 𝑘⦌𝐵, 1))
27		elnnuz 9667	. . . . . . 7 ⊢ (𝑚 ∈ ℕ ↔ 𝑚 ∈ (ℤ_≥‘1))
28	27	biimpri 133	. . . . . 6 ⊢ (𝑚 ∈ (ℤ_≥‘1) → 𝑚 ∈ ℕ)
29	28	adantl 277	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) → 𝑚 ∈ ℕ)
30		f1of 5516	. . . . . . . . . 10 ⊢ (𝑓:(1...𝑀)–1-1-onto→𝐴 → 𝑓:(1...𝑀)⟶𝐴)
31	11, 30	syl 14	. . . . . . . . 9 ⊢ (𝜑 → 𝑓:(1...𝑀)⟶𝐴)
32	31	ad2antrr 488	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ 𝑚 ≤ (♯‘𝐴)) → 𝑓:(1...𝑀)⟶𝐴)
33		1zzd 9381	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ 𝑚 ≤ (♯‘𝐴)) → 1 ∈ ℤ)
34	8	nnzd 9476	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑀 ∈ ℤ)
35	34	ad2antrr 488	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ 𝑚 ≤ (♯‘𝐴)) → 𝑀 ∈ ℤ)
36		eluzelz 9639	. . . . . . . . . . 11 ⊢ (𝑚 ∈ (ℤ_≥‘1) → 𝑚 ∈ ℤ)
37	36	ad2antlr 489	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ 𝑚 ≤ (♯‘𝐴)) → 𝑚 ∈ ℤ)
38	33, 35, 37	3jca 1179	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ 𝑚 ≤ (♯‘𝐴)) → (1 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑚 ∈ ℤ))
39		eluzle 9642	. . . . . . . . . . 11 ⊢ (𝑚 ∈ (ℤ_≥‘1) → 1 ≤ 𝑚)
40	39	ad2antlr 489	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ 𝑚 ≤ (♯‘𝐴)) → 1 ≤ 𝑚)
41		simpr 110	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ 𝑚 ≤ (♯‘𝐴)) → 𝑚 ≤ (♯‘𝐴))
42	8	nnnn0d 9330	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑀 ∈ ℕ₀)
43		hashfz1 10909	. . . . . . . . . . . . . 14 ⊢ (𝑀 ∈ ℕ₀ → (♯‘(1...𝑀)) = 𝑀)
44	42, 43	syl 14	. . . . . . . . . . . . 13 ⊢ (𝜑 → (♯‘(1...𝑀)) = 𝑀)
45		1zzd 9381	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 1 ∈ ℤ)
46	45, 34	fzfigd 10557	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (1...𝑀) ∈ Fin)
47	46, 11	fihasheqf1od 10915	. . . . . . . . . . . . 13 ⊢ (𝜑 → (♯‘(1...𝑀)) = (♯‘𝐴))
48	44, 47	eqtr3d 2239	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑀 = (♯‘𝐴))
49	48	ad2antrr 488	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ 𝑚 ≤ (♯‘𝐴)) → 𝑀 = (♯‘𝐴))
50	41, 49	breqtrrd 4071	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ 𝑚 ≤ (♯‘𝐴)) → 𝑚 ≤ 𝑀)
51	40, 50	jca 306	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ 𝑚 ≤ (♯‘𝐴)) → (1 ≤ 𝑚 ∧ 𝑚 ≤ 𝑀))
52		elfz2 10119	. . . . . . . . 9 ⊢ (𝑚 ∈ (1...𝑀) ↔ ((1 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑚 ∈ ℤ) ∧ (1 ≤ 𝑚 ∧ 𝑚 ≤ 𝑀)))
53	38, 51, 52	sylanbrc 417	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ 𝑚 ≤ (♯‘𝐴)) → 𝑚 ∈ (1...𝑀))
54	32, 53	ffvelcdmd 5710	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ 𝑚 ≤ (♯‘𝐴)) → (𝑓‘𝑚) ∈ 𝐴)
55		prodmo.2	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)
56	55	ralrimiva 2578	. . . . . . . 8 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ)
57	56	ad2antrr 488	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ 𝑚 ≤ (♯‘𝐴)) → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ)
58		nfcsb1v 3125	. . . . . . . . 9 ⊢ Ⅎ𝑘⦋(𝑓‘𝑚) / 𝑘⦌𝐵
59	58	nfel1 2358	. . . . . . . 8 ⊢ Ⅎ𝑘⦋(𝑓‘𝑚) / 𝑘⦌𝐵 ∈ ℂ
60		csbeq1a 3101	. . . . . . . . 9 ⊢ (𝑘 = (𝑓‘𝑚) → 𝐵 = ⦋(𝑓‘𝑚) / 𝑘⦌𝐵)
61	60	eleq1d 2273	. . . . . . . 8 ⊢ (𝑘 = (𝑓‘𝑚) → (𝐵 ∈ ℂ ↔ ⦋(𝑓‘𝑚) / 𝑘⦌𝐵 ∈ ℂ))
62	59, 61	rspc 2870	. . . . . . 7 ⊢ ((𝑓‘𝑚) ∈ 𝐴 → (∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ → ⦋(𝑓‘𝑚) / 𝑘⦌𝐵 ∈ ℂ))
63	54, 57, 62	sylc 62	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ 𝑚 ≤ (♯‘𝐴)) → ⦋(𝑓‘𝑚) / 𝑘⦌𝐵 ∈ ℂ)
64		1cnd 8070	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑚 ≤ (♯‘𝐴)) → 1 ∈ ℂ)
65	29	nnzd 9476	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) → 𝑚 ∈ ℤ)
66	48, 34	eqeltrrd 2282	. . . . . . . 8 ⊢ (𝜑 → (♯‘𝐴) ∈ ℤ)
67	66	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) → (♯‘𝐴) ∈ ℤ)
68		zdcle 9431	. . . . . . 7 ⊢ ((𝑚 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ) → DECID 𝑚 ≤ (♯‘𝐴))
69	65, 67, 68	syl2anc 411	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) → DECID 𝑚 ≤ (♯‘𝐴))
70	63, 64, 69	ifcldadc 3599	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) → if(𝑚 ≤ (♯‘𝐴), ⦋(𝑓‘𝑚) / 𝑘⦌𝐵, 1) ∈ ℂ)
71	22, 26, 29, 70	fvmptd3 5667	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) → (𝐺‘𝑚) = if(𝑚 ≤ (♯‘𝐴), ⦋(𝑓‘𝑚) / 𝑘⦌𝐵, 1))
72	71, 70	eqeltrd 2281	. . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) → (𝐺‘𝑚) ∈ ℂ)
73		prodmodclem3.4	. . . . 5 ⊢ 𝐻 = (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), ⦋(𝐾‘𝑗) / 𝑘⦌𝐵, 1))
74		fveq2 5570	. . . . . . 7 ⊢ (𝑗 = 𝑚 → (𝐾‘𝑗) = (𝐾‘𝑚))
75	74	csbeq1d 3099	. . . . . 6 ⊢ (𝑗 = 𝑚 → ⦋(𝐾‘𝑗) / 𝑘⦌𝐵 = ⦋(𝐾‘𝑚) / 𝑘⦌𝐵)
76	23, 75	ifbieq1d 3592	. . . . 5 ⊢ (𝑗 = 𝑚 → if(𝑗 ≤ (♯‘𝐴), ⦋(𝐾‘𝑗) / 𝑘⦌𝐵, 1) = if(𝑚 ≤ (♯‘𝐴), ⦋(𝐾‘𝑚) / 𝑘⦌𝐵, 1))
77	14	ad2antrr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ 𝑚 ≤ (♯‘𝐴)) → 𝐾:(1...𝑁)–1-1-onto→𝐴)
78		f1of 5516	. . . . . . . . 9 ⊢ (𝐾:(1...𝑁)–1-1-onto→𝐴 → 𝐾:(1...𝑁)⟶𝐴)
79	77, 78	syl 14	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ 𝑚 ≤ (♯‘𝐴)) → 𝐾:(1...𝑁)⟶𝐴)
80	19	ad2antrr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ 𝑚 ≤ (♯‘𝐴)) → (1...𝑀) = (1...𝑁))
81	53, 80	eleqtrd 2283	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ 𝑚 ≤ (♯‘𝐴)) → 𝑚 ∈ (1...𝑁))
82	79, 81	ffvelcdmd 5710	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ 𝑚 ≤ (♯‘𝐴)) → (𝐾‘𝑚) ∈ 𝐴)
83		nfcsb1v 3125	. . . . . . . . 9 ⊢ Ⅎ𝑘⦋(𝐾‘𝑚) / 𝑘⦌𝐵
84	83	nfel1 2358	. . . . . . . 8 ⊢ Ⅎ𝑘⦋(𝐾‘𝑚) / 𝑘⦌𝐵 ∈ ℂ
85		csbeq1a 3101	. . . . . . . . 9 ⊢ (𝑘 = (𝐾‘𝑚) → 𝐵 = ⦋(𝐾‘𝑚) / 𝑘⦌𝐵)
86	85	eleq1d 2273	. . . . . . . 8 ⊢ (𝑘 = (𝐾‘𝑚) → (𝐵 ∈ ℂ ↔ ⦋(𝐾‘𝑚) / 𝑘⦌𝐵 ∈ ℂ))
87	84, 86	rspc 2870	. . . . . . 7 ⊢ ((𝐾‘𝑚) ∈ 𝐴 → (∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ → ⦋(𝐾‘𝑚) / 𝑘⦌𝐵 ∈ ℂ))
88	82, 57, 87	sylc 62	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) ∧ 𝑚 ≤ (♯‘𝐴)) → ⦋(𝐾‘𝑚) / 𝑘⦌𝐵 ∈ ℂ)
89	88, 64, 69	ifcldadc 3599	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) → if(𝑚 ≤ (♯‘𝐴), ⦋(𝐾‘𝑚) / 𝑘⦌𝐵, 1) ∈ ℂ)
90	73, 76, 29, 89	fvmptd3 5667	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) → (𝐻‘𝑚) = if(𝑚 ≤ (♯‘𝐴), ⦋(𝐾‘𝑚) / 𝑘⦌𝐵, 1))
91	90, 89	eqeltrd 2281	. . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘1)) → (𝐻‘𝑚) ∈ ℂ)
92	19	f1oeq2d 5512	. . . . . . . . . 10 ⊢ (𝜑 → (𝐾:(1...𝑀)–1-1-onto→𝐴 ↔ 𝐾:(1...𝑁)–1-1-onto→𝐴))
93	14, 92	mpbird 167	. . . . . . . . 9 ⊢ (𝜑 → 𝐾:(1...𝑀)–1-1-onto→𝐴)
94		f1of 5516	. . . . . . . . 9 ⊢ (𝐾:(1...𝑀)–1-1-onto→𝐴 → 𝐾:(1...𝑀)⟶𝐴)
95	93, 94	syl 14	. . . . . . . 8 ⊢ (𝜑 → 𝐾:(1...𝑀)⟶𝐴)
96		fvco3 5644	. . . . . . . 8 ⊢ ((𝐾:(1...𝑀)⟶𝐴 ∧ 𝑖 ∈ (1...𝑀)) → ((^◡𝑓 ∘ 𝐾)‘𝑖) = (^◡𝑓‘(𝐾‘𝑖)))
97	95, 96	sylan 283	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((^◡𝑓 ∘ 𝐾)‘𝑖) = (^◡𝑓‘(𝐾‘𝑖)))
98	97	fveq2d 5574	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝑓‘((^◡𝑓 ∘ 𝐾)‘𝑖)) = (𝑓‘(^◡𝑓‘(𝐾‘𝑖))))
99	11	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝑓:(1...𝑀)–1-1-onto→𝐴)
100	95	ffvelcdmda 5709	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐾‘𝑖) ∈ 𝐴)
101		f1ocnvfv2 5837	. . . . . . 7 ⊢ ((𝑓:(1...𝑀)–1-1-onto→𝐴 ∧ (𝐾‘𝑖) ∈ 𝐴) → (𝑓‘(^◡𝑓‘(𝐾‘𝑖))) = (𝐾‘𝑖))
102	99, 100, 101	syl2anc 411	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝑓‘(^◡𝑓‘(𝐾‘𝑖))) = (𝐾‘𝑖))
103	98, 102	eqtrd 2237	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝑓‘((^◡𝑓 ∘ 𝐾)‘𝑖)) = (𝐾‘𝑖))
104	103	csbeq1d 3099	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ⦋(𝑓‘((^◡𝑓 ∘ 𝐾)‘𝑖)) / 𝑘⦌𝐵 = ⦋(𝐾‘𝑖) / 𝑘⦌𝐵)
105		breq1 4046	. . . . . . 7 ⊢ (𝑗 = ((^◡𝑓 ∘ 𝐾)‘𝑖) → (𝑗 ≤ (♯‘𝐴) ↔ ((^◡𝑓 ∘ 𝐾)‘𝑖) ≤ (♯‘𝐴)))
106		fveq2 5570	. . . . . . . 8 ⊢ (𝑗 = ((^◡𝑓 ∘ 𝐾)‘𝑖) → (𝑓‘𝑗) = (𝑓‘((^◡𝑓 ∘ 𝐾)‘𝑖)))
107	106	csbeq1d 3099	. . . . . . 7 ⊢ (𝑗 = ((^◡𝑓 ∘ 𝐾)‘𝑖) → ⦋(𝑓‘𝑗) / 𝑘⦌𝐵 = ⦋(𝑓‘((^◡𝑓 ∘ 𝐾)‘𝑖)) / 𝑘⦌𝐵)
108	105, 107	ifbieq1d 3592	. . . . . 6 ⊢ (𝑗 = ((^◡𝑓 ∘ 𝐾)‘𝑖) → if(𝑗 ≤ (♯‘𝐴), ⦋(𝑓‘𝑗) / 𝑘⦌𝐵, 1) = if(((^◡𝑓 ∘ 𝐾)‘𝑖) ≤ (♯‘𝐴), ⦋(𝑓‘((^◡𝑓 ∘ 𝐾)‘𝑖)) / 𝑘⦌𝐵, 1))
109		f1of 5516	. . . . . . . . 9 ⊢ ((^◡𝑓 ∘ 𝐾):(1...𝑀)–1-1-onto→(1...𝑀) → (^◡𝑓 ∘ 𝐾):(1...𝑀)⟶(1...𝑀))
110	21, 109	syl 14	. . . . . . . 8 ⊢ (𝜑 → (^◡𝑓 ∘ 𝐾):(1...𝑀)⟶(1...𝑀))
111	110	ffvelcdmda 5709	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((^◡𝑓 ∘ 𝐾)‘𝑖) ∈ (1...𝑀))
112		elfznn 10158	. . . . . . 7 ⊢ (((^◡𝑓 ∘ 𝐾)‘𝑖) ∈ (1...𝑀) → ((^◡𝑓 ∘ 𝐾)‘𝑖) ∈ ℕ)
113	111, 112	syl 14	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((^◡𝑓 ∘ 𝐾)‘𝑖) ∈ ℕ)
114		elfzle2 10132	. . . . . . . . . 10 ⊢ (((^◡𝑓 ∘ 𝐾)‘𝑖) ∈ (1...𝑀) → ((^◡𝑓 ∘ 𝐾)‘𝑖) ≤ 𝑀)
115	111, 114	syl 14	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((^◡𝑓 ∘ 𝐾)‘𝑖) ≤ 𝑀)
116	48	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝑀 = (♯‘𝐴))
117	115, 116	breqtrd 4069	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((^◡𝑓 ∘ 𝐾)‘𝑖) ≤ (♯‘𝐴))
118	117	iftrued 3577	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → if(((^◡𝑓 ∘ 𝐾)‘𝑖) ≤ (♯‘𝐴), ⦋(𝑓‘((^◡𝑓 ∘ 𝐾)‘𝑖)) / 𝑘⦌𝐵, 1) = ⦋(𝑓‘((^◡𝑓 ∘ 𝐾)‘𝑖)) / 𝑘⦌𝐵)
119	56	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ)
120		nfcsb1v 3125	. . . . . . . . . . 11 ⊢ Ⅎ𝑘⦋(𝐾‘𝑖) / 𝑘⦌𝐵
121	120	nfel1 2358	. . . . . . . . . 10 ⊢ Ⅎ𝑘⦋(𝐾‘𝑖) / 𝑘⦌𝐵 ∈ ℂ
122		csbeq1a 3101	. . . . . . . . . . 11 ⊢ (𝑘 = (𝐾‘𝑖) → 𝐵 = ⦋(𝐾‘𝑖) / 𝑘⦌𝐵)
123	122	eleq1d 2273	. . . . . . . . . 10 ⊢ (𝑘 = (𝐾‘𝑖) → (𝐵 ∈ ℂ ↔ ⦋(𝐾‘𝑖) / 𝑘⦌𝐵 ∈ ℂ))
124	121, 123	rspc 2870	. . . . . . . . 9 ⊢ ((𝐾‘𝑖) ∈ 𝐴 → (∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ → ⦋(𝐾‘𝑖) / 𝑘⦌𝐵 ∈ ℂ))
125	100, 119, 124	sylc 62	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ⦋(𝐾‘𝑖) / 𝑘⦌𝐵 ∈ ℂ)
126	104, 125	eqeltrd 2281	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ⦋(𝑓‘((^◡𝑓 ∘ 𝐾)‘𝑖)) / 𝑘⦌𝐵 ∈ ℂ)
127	118, 126	eqeltrd 2281	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → if(((^◡𝑓 ∘ 𝐾)‘𝑖) ≤ (♯‘𝐴), ⦋(𝑓‘((^◡𝑓 ∘ 𝐾)‘𝑖)) / 𝑘⦌𝐵, 1) ∈ ℂ)
128	22, 108, 113, 127	fvmptd3 5667	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐺‘((^◡𝑓 ∘ 𝐾)‘𝑖)) = if(((^◡𝑓 ∘ 𝐾)‘𝑖) ≤ (♯‘𝐴), ⦋(𝑓‘((^◡𝑓 ∘ 𝐾)‘𝑖)) / 𝑘⦌𝐵, 1))
129	128, 118	eqtrd 2237	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐺‘((^◡𝑓 ∘ 𝐾)‘𝑖)) = ⦋(𝑓‘((^◡𝑓 ∘ 𝐾)‘𝑖)) / 𝑘⦌𝐵)
130		breq1 4046	. . . . . . 7 ⊢ (𝑗 = 𝑖 → (𝑗 ≤ (♯‘𝐴) ↔ 𝑖 ≤ (♯‘𝐴)))
131		fveq2 5570	. . . . . . . 8 ⊢ (𝑗 = 𝑖 → (𝐾‘𝑗) = (𝐾‘𝑖))
132	131	csbeq1d 3099	. . . . . . 7 ⊢ (𝑗 = 𝑖 → ⦋(𝐾‘𝑗) / 𝑘⦌𝐵 = ⦋(𝐾‘𝑖) / 𝑘⦌𝐵)
133	130, 132	ifbieq1d 3592	. . . . . 6 ⊢ (𝑗 = 𝑖 → if(𝑗 ≤ (♯‘𝐴), ⦋(𝐾‘𝑗) / 𝑘⦌𝐵, 1) = if(𝑖 ≤ (♯‘𝐴), ⦋(𝐾‘𝑖) / 𝑘⦌𝐵, 1))
134		elfznn 10158	. . . . . . 7 ⊢ (𝑖 ∈ (1...𝑀) → 𝑖 ∈ ℕ)
135	134	adantl 277	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝑖 ∈ ℕ)
136		elfzle2 10132	. . . . . . . . . 10 ⊢ (𝑖 ∈ (1...𝑀) → 𝑖 ≤ 𝑀)
137	136	adantl 277	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝑖 ≤ 𝑀)
138	137, 116	breqtrd 4069	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝑖 ≤ (♯‘𝐴))
139	138	iftrued 3577	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → if(𝑖 ≤ (♯‘𝐴), ⦋(𝐾‘𝑖) / 𝑘⦌𝐵, 1) = ⦋(𝐾‘𝑖) / 𝑘⦌𝐵)
140	139, 125	eqeltrd 2281	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → if(𝑖 ≤ (♯‘𝐴), ⦋(𝐾‘𝑖) / 𝑘⦌𝐵, 1) ∈ ℂ)
141	73, 133, 135, 140	fvmptd3 5667	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐻‘𝑖) = if(𝑖 ≤ (♯‘𝐴), ⦋(𝐾‘𝑖) / 𝑘⦌𝐵, 1))
142	141, 139	eqtrd 2237	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐻‘𝑖) = ⦋(𝐾‘𝑖) / 𝑘⦌𝐵)
143	104, 129, 142	3eqtr4rd 2248	. . 3 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐻‘𝑖) = (𝐺‘((^◡𝑓 ∘ 𝐾)‘𝑖)))
144	2, 4, 6, 10, 21, 72, 91, 143	seq3f1o 10643	. 2 ⊢ (𝜑 → (seq1( · , 𝐻)‘𝑀) = (seq1( · , 𝐺)‘𝑀))
145	18	fveq2d 5574	. 2 ⊢ (𝜑 → (seq1( · , 𝐻)‘𝑀) = (seq1( · , 𝐻)‘𝑁))
146	144, 145	eqtr3d 2239	1 ⊢ (𝜑 → (seq1( · , 𝐺)‘𝑀) = (seq1( · , 𝐻)‘𝑁))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 DECID wdc 835 ∧ w3a 980 = wceq 1372 ∈ wcel 2175 ∀wral 2483 ⦋csb 3092 ifcif 3570 class class class wbr 4043 ↦ cmpt 4104 ^◡ccnv 4672 ∘ ccom 4677 ⟶wf 5264 –1-1-onto→wf1o 5267 ‘cfv 5268 (class class class)co 5934 ℂcc 7905 1c1 7908 · cmul 7912 ≤ cle 8090 ℕcn 9018 ℕ₀cn0 9277 ℤcz 9354 ℤ_≥cuz 9630 ...cfz 10112 seqcseq 10573 ♯chash 10901

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 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-13 2177 ax-14 2178 ax-ext 2186 ax-coll 4158 ax-sep 4161 ax-nul 4169 ax-pow 4217 ax-pr 4252 ax-un 4478 ax-setind 4583 ax-iinf 4634 ax-cnex 7998 ax-resscn 7999 ax-1cn 8000 ax-1re 8001 ax-icn 8002 ax-addcl 8003 ax-addrcl 8004 ax-mulcl 8005 ax-addcom 8007 ax-mulcom 8008 ax-addass 8009 ax-mulass 8010 ax-distr 8011 ax-i2m1 8012 ax-0lt1 8013 ax-0id 8015 ax-rnegex 8016 ax-cnre 8018 ax-pre-ltirr 8019 ax-pre-ltwlin 8020 ax-pre-lttrn 8021 ax-pre-apti 8022 ax-pre-ltadd 8023

This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1375 df-fal 1378 df-nf 1483 df-sb 1785 df-eu 2056 df-mo 2057 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-ne 2376 df-nel 2471 df-ral 2488 df-rex 2489 df-reu 2490 df-rab 2492 df-v 2773 df-sbc 2998 df-csb 3093 df-dif 3167 df-un 3169 df-in 3171 df-ss 3178 df-nul 3460 df-if 3571 df-pw 3617 df-sn 3638 df-pr 3639 df-op 3641 df-uni 3850 df-int 3885 df-iun 3928 df-br 4044 df-opab 4105 df-mpt 4106 df-tr 4142 df-id 4338 df-iord 4411 df-on 4413 df-ilim 4414 df-suc 4416 df-iom 4637 df-xp 4679 df-rel 4680 df-cnv 4681 df-co 4682 df-dm 4683 df-rn 4684 df-res 4685 df-ima 4686 df-iota 5229 df-fun 5270 df-fn 5271 df-f 5272 df-f1 5273 df-fo 5274 df-f1o 5275 df-fv 5276 df-riota 5889 df-ov 5937 df-oprab 5938 df-mpo 5939 df-1st 6216 df-2nd 6217 df-recs 6381 df-frec 6467 df-1o 6492 df-er 6610 df-en 6818 df-dom 6819 df-fin 6820 df-pnf 8091 df-mnf 8092 df-xr 8093 df-ltxr 8094 df-le 8095 df-sub 8227 df-neg 8228 df-inn 9019 df-n0 9278 df-z 9355 df-uz 9631 df-fz 10113 df-fzo 10247 df-seqfrec 10574 df-ihash 10902

This theorem is referenced by: prodmodclem2a 11806 prodmodc 11808

W3C validator