fprodseq - Intuitionistic Logic Explorer

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

Theorem fprodseq 12137

Description: The value of a product over a nonempty finite set. (Contributed by Scott Fenton, 6-Dec-2017.) (Revised by Jim Kingdon, 15-Jul-2024.)

**Hypotheses**
Ref	Expression
fprod.1	⊢ (𝑘 = (𝐹‘𝑛) → 𝐵 = 𝐶)
fprod.2	⊢ (𝜑 → 𝑀 ∈ ℕ)
fprod.3	⊢ (𝜑 → 𝐹:(1...𝑀)–1-1-onto→𝐴)
fprod.4	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)
fprod.5	⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑀)) → (𝐺‘𝑛) = 𝐶)

**Assertion**
Ref	Expression
fprodseq	⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀))

Distinct variable groups: 𝐴,𝑘,𝑛 𝐵,𝑛 𝐶,𝑘 𝑘,𝐹,𝑛 𝑘,𝐺,𝑛 𝑘,𝑀,𝑛 𝜑,𝑘,𝑛 Allowed substitution hints: 𝐵(𝑘) 𝐶(𝑛)

Proof of Theorem fprodseq Dummy variables 𝑓 𝑖 𝑗 𝑚 𝑥 𝑝 𝑞 𝑢 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-proddc 12105	. 2 ⊢ ∏𝑘 ∈ 𝐴 𝐵 = (℩𝑥(∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ_≥‘𝑚)DECID 𝑗 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))))
2		nnuz 9785	. . . . 5 ⊢ ℕ = (ℤ_≥‘1)
3		1zzd 9499	. . . . 5 ⊢ (𝜑 → 1 ∈ ℤ)
4		eqid 2229	. . . . . . 7 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)) = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1))
5		breq1 4089	. . . . . . . 8 ⊢ (𝑛 = 𝑝 → (𝑛 ≤ 𝑀 ↔ 𝑝 ≤ 𝑀))
6		fveq2 5635	. . . . . . . 8 ⊢ (𝑛 = 𝑝 → (𝐺‘𝑛) = (𝐺‘𝑝))
7	5, 6	ifbieq1d 3626	. . . . . . 7 ⊢ (𝑛 = 𝑝 → if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1) = if(𝑝 ≤ 𝑀, (𝐺‘𝑝), 1))
8		simpr 110	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ) → 𝑝 ∈ ℕ)
9		simpll 527	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ) ∧ 𝑝 ≤ 𝑀) → 𝜑)
10	8	anim1i 340	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ) ∧ 𝑝 ≤ 𝑀) → (𝑝 ∈ ℕ ∧ 𝑝 ≤ 𝑀))
11		fprod.2	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑀 ∈ ℕ)
12	11	nnzd 9594	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑀 ∈ ℤ)
13		fznn 10317	. . . . . . . . . . . 12 ⊢ (𝑀 ∈ ℤ → (𝑝 ∈ (1...𝑀) ↔ (𝑝 ∈ ℕ ∧ 𝑝 ≤ 𝑀)))
14	12, 13	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑝 ∈ (1...𝑀) ↔ (𝑝 ∈ ℕ ∧ 𝑝 ≤ 𝑀)))
15	14	ad2antrr 488	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ) ∧ 𝑝 ≤ 𝑀) → (𝑝 ∈ (1...𝑀) ↔ (𝑝 ∈ ℕ ∧ 𝑝 ≤ 𝑀)))
16	10, 15	mpbird 167	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ) ∧ 𝑝 ≤ 𝑀) → 𝑝 ∈ (1...𝑀))
17	6	eleq1d 2298	. . . . . . . . . 10 ⊢ (𝑛 = 𝑝 → ((𝐺‘𝑛) ∈ ℂ ↔ (𝐺‘𝑝) ∈ ℂ))
18		fprod.1	. . . . . . . . . . . 12 ⊢ (𝑘 = (𝐹‘𝑛) → 𝐵 = 𝐶)
19		fprod.3	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹:(1...𝑀)–1-1-onto→𝐴)
20		fprod.4	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)
21		fprod.5	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑀)) → (𝐺‘𝑛) = 𝐶)
22	18, 11, 19, 20, 21	fsumgcl 11940	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑛 ∈ (1...𝑀)(𝐺‘𝑛) ∈ ℂ)
23	22	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑝 ∈ (1...𝑀)) → ∀𝑛 ∈ (1...𝑀)(𝐺‘𝑛) ∈ ℂ)
24		simpr 110	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑝 ∈ (1...𝑀)) → 𝑝 ∈ (1...𝑀))
25	17, 23, 24	rspcdva 2913	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑝 ∈ (1...𝑀)) → (𝐺‘𝑝) ∈ ℂ)
26	9, 16, 25	syl2anc 411	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ) ∧ 𝑝 ≤ 𝑀) → (𝐺‘𝑝) ∈ ℂ)
27		1cnd 8188	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ) ∧ ¬ 𝑝 ≤ 𝑀) → 1 ∈ ℂ)
28	8	nnzd 9594	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ) → 𝑝 ∈ ℤ)
29	12	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ) → 𝑀 ∈ ℤ)
30		zdcle 9549	. . . . . . . . 9 ⊢ ((𝑝 ∈ ℤ ∧ 𝑀 ∈ ℤ) → DECID 𝑝 ≤ 𝑀)
31	28, 29, 30	syl2anc 411	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ) → DECID 𝑝 ≤ 𝑀)
32	26, 27, 31	ifcldadc 3633	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ) → if(𝑝 ≤ 𝑀, (𝐺‘𝑝), 1) ∈ ℂ)
33	4, 7, 8, 32	fvmptd3 5736	. . . . . 6 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1))‘𝑝) = if(𝑝 ≤ 𝑀, (𝐺‘𝑝), 1))
34	33, 32	eqeltrd 2306	. . . . 5 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1))‘𝑝) ∈ ℂ)
35	2, 3, 34	prodf 12092	. . . 4 ⊢ (𝜑 → seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1))):ℕ⟶ℂ)
36	35, 11	ffvelcdmd 5779	. . 3 ⊢ (𝜑 → (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) ∈ ℂ)
37		eleq1w 2290	. . . . . . . . . . . . 13 ⊢ (𝑖 = 𝑗 → (𝑖 ∈ 𝐴 ↔ 𝑗 ∈ 𝐴))
38	37	dcbid 843	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝑗 → (DECID 𝑖 ∈ 𝐴 ↔ DECID 𝑗 ∈ 𝐴))
39	38	cbvralv 2765	. . . . . . . . . . 11 ⊢ (∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴 ↔ ∀𝑗 ∈ (ℤ_≥‘𝑚)DECID 𝑗 ∈ 𝐴)
40	39	anbi2i 457	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ↔ (𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ_≥‘𝑚)DECID 𝑗 ∈ 𝐴))
41	40	anbi1i 458	. . . . . . . . 9 ⊢ (((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ↔ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ_≥‘𝑚)DECID 𝑗 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)))
42	41	rexbii 2537	. . . . . . . 8 ⊢ (∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ↔ ∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ_≥‘𝑚)DECID 𝑗 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)))
43		nnnn0 9402	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑚 ∈ ℕ → 𝑚 ∈ ℕ₀)
44		hashfz1 11038	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑚 ∈ ℕ₀ → (♯‘(1...𝑚)) = 𝑚)
45	43, 44	syl 14	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑚 ∈ ℕ → (♯‘(1...𝑚)) = 𝑚)
46	45	adantr 276	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑚 ∈ ℕ ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) → (♯‘(1...𝑚)) = 𝑚)
47		1zzd 9499	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑚 ∈ ℕ ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) → 1 ∈ ℤ)
48		nnz 9491	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑚 ∈ ℕ → 𝑚 ∈ ℤ)
49	48	adantr 276	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑚 ∈ ℕ ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) → 𝑚 ∈ ℤ)
50	47, 49	fzfigd 10686	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑚 ∈ ℕ ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) → (1...𝑚) ∈ Fin)
51		simpr 110	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑚 ∈ ℕ ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) → 𝑓:(1...𝑚)–1-1-onto→𝐴)
52	50, 51	fihasheqf1od 11044	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑚 ∈ ℕ ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) → (♯‘(1...𝑚)) = (♯‘𝐴))
53	46, 52	eqtr3d 2264	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑚 ∈ ℕ ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) → 𝑚 = (♯‘𝐴))
54	53	breq2d 4098	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑚 ∈ ℕ ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) → (𝑛 ≤ 𝑚 ↔ 𝑛 ≤ (♯‘𝐴)))
55	54	ifbid 3625	. . . . . . . . . . . . . . . 16 ⊢ ((𝑚 ∈ ℕ ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) → if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1) = if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1))
56	55	mpteq2dv 4178	. . . . . . . . . . . . . . 15 ⊢ ((𝑚 ∈ ℕ ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) → (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)) = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))
57	56	seqeq3d 10710	. . . . . . . . . . . . . 14 ⊢ ((𝑚 ∈ ℕ ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) → seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1))) = seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1))))
58	57	fveq1d 5637	. . . . . . . . . . . . 13 ⊢ ((𝑚 ∈ ℕ ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) → (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))
59	58	eqeq2d 2241	. . . . . . . . . . . 12 ⊢ ((𝑚 ∈ ℕ ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) → (𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚) ↔ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)))
60	59	pm5.32da 452	. . . . . . . . . . 11 ⊢ (𝑚 ∈ ℕ → ((𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)) ↔ (𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))))
61	60	exbidv 1871	. . . . . . . . . 10 ⊢ (𝑚 ∈ ℕ → (∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)) ↔ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))))
62	61	rexbiia 2545	. . . . . . . . 9 ⊢ (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)) ↔ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)))
63	62	bicomi 132	. . . . . . . 8 ⊢ (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)) ↔ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)))
64	42, 63	orbi12i 769	. . . . . . 7 ⊢ ((∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))) ↔ (∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ_≥‘𝑚)DECID 𝑗 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))))
65		f1of 5580	. . . . . . . . . . . . 13 ⊢ (𝐹:(1...𝑀)–1-1-onto→𝐴 → 𝐹:(1...𝑀)⟶𝐴)
66	19, 65	syl 14	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹:(1...𝑀)⟶𝐴)
67	3, 12	fzfigd 10686	. . . . . . . . . . . 12 ⊢ (𝜑 → (1...𝑀) ∈ Fin)
68		fex 5878	. . . . . . . . . . . 12 ⊢ ((𝐹:(1...𝑀)⟶𝐴 ∧ (1...𝑀) ∈ Fin) → 𝐹 ∈ V)
69	66, 67, 68	syl2anc 411	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹 ∈ V)
70	11, 2	eleqtrdi 2322	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘1))
71		fveq2 5635	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 = 𝑢 → (𝐹‘𝑛) = (𝐹‘𝑢))
72	71	csbeq1d 3132	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑢 → ⦋(𝐹‘𝑛) / 𝑘⦌𝐵 = ⦋(𝐹‘𝑢) / 𝑘⦌𝐵)
73		fveq2 5635	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑢 → (𝐺‘𝑛) = (𝐺‘𝑢))
74	72, 73	eqeq12d 2244	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 𝑢 → (⦋(𝐹‘𝑛) / 𝑘⦌𝐵 = (𝐺‘𝑛) ↔ ⦋(𝐹‘𝑢) / 𝑘⦌𝐵 = (𝐺‘𝑢)))
75	66	ffvelcdmda 5778	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑀)) → (𝐹‘𝑛) ∈ 𝐴)
76	18	adantl 277	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...𝑀)) ∧ 𝑘 = (𝐹‘𝑛)) → 𝐵 = 𝐶)
77	75, 76	csbied 3172	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑀)) → ⦋(𝐹‘𝑛) / 𝑘⦌𝐵 = 𝐶)
78	77, 21	eqtr4d 2265	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑀)) → ⦋(𝐹‘𝑛) / 𝑘⦌𝐵 = (𝐺‘𝑛))
79	78	ralrimiva 2603	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ∀𝑛 ∈ (1...𝑀)⦋(𝐹‘𝑛) / 𝑘⦌𝐵 = (𝐺‘𝑛))
80	79	adantr 276	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑢 ∈ (1...𝑀)) → ∀𝑛 ∈ (1...𝑀)⦋(𝐹‘𝑛) / 𝑘⦌𝐵 = (𝐺‘𝑛))
81		simpr 110	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑢 ∈ (1...𝑀)) → 𝑢 ∈ (1...𝑀))
82	74, 80, 81	rspcdva 2913	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑢 ∈ (1...𝑀)) → ⦋(𝐹‘𝑢) / 𝑘⦌𝐵 = (𝐺‘𝑢))
83		eqid 2229	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝐹‘𝑛) / 𝑘⦌𝐵, 1)) = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝐹‘𝑛) / 𝑘⦌𝐵, 1))
84		breq1 4089	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 = 𝑢 → (𝑛 ≤ (♯‘𝐴) ↔ 𝑢 ≤ (♯‘𝐴)))
85	84, 72	ifbieq1d 3626	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑢 → if(𝑛 ≤ (♯‘𝐴), ⦋(𝐹‘𝑛) / 𝑘⦌𝐵, 1) = if(𝑢 ≤ (♯‘𝐴), ⦋(𝐹‘𝑢) / 𝑘⦌𝐵, 1))
86		elfznn 10282	. . . . . . . . . . . . . . . . 17 ⊢ (𝑢 ∈ (1...𝑀) → 𝑢 ∈ ℕ)
87	86	adantl 277	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑢 ∈ (1...𝑀)) → 𝑢 ∈ ℕ)
88		elfzle2 10256	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑢 ∈ (1...𝑀) → 𝑢 ≤ 𝑀)
89	88	adantl 277	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑢 ∈ (1...𝑀)) → 𝑢 ≤ 𝑀)
90	11	nnnn0d 9448	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → 𝑀 ∈ ℕ₀)
91		hashfz1 11038	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑀 ∈ ℕ₀ → (♯‘(1...𝑀)) = 𝑀)
92	90, 91	syl 14	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → (♯‘(1...𝑀)) = 𝑀)
93	67, 19	fihasheqf1od 11044	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → (♯‘(1...𝑀)) = (♯‘𝐴))
94	92, 93	eqtr3d 2264	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → 𝑀 = (♯‘𝐴))
95	94	adantr 276	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑢 ∈ (1...𝑀)) → 𝑀 = (♯‘𝐴))
96	89, 95	breqtrd 4112	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑢 ∈ (1...𝑀)) → 𝑢 ≤ (♯‘𝐴))
97	96	iftrued 3610	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑢 ∈ (1...𝑀)) → if(𝑢 ≤ (♯‘𝐴), ⦋(𝐹‘𝑢) / 𝑘⦌𝐵, 1) = ⦋(𝐹‘𝑢) / 𝑘⦌𝐵)
98	97, 82	eqtrd 2262	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑢 ∈ (1...𝑀)) → if(𝑢 ≤ (♯‘𝐴), ⦋(𝐹‘𝑢) / 𝑘⦌𝐵, 1) = (𝐺‘𝑢))
99	73	eleq1d 2298	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 = 𝑢 → ((𝐺‘𝑛) ∈ ℂ ↔ (𝐺‘𝑢) ∈ ℂ))
100	22	adantr 276	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑢 ∈ (1...𝑀)) → ∀𝑛 ∈ (1...𝑀)(𝐺‘𝑛) ∈ ℂ)
101	99, 100, 81	rspcdva 2913	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑢 ∈ (1...𝑀)) → (𝐺‘𝑢) ∈ ℂ)
102	98, 101	eqeltrd 2306	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑢 ∈ (1...𝑀)) → if(𝑢 ≤ (♯‘𝐴), ⦋(𝐹‘𝑢) / 𝑘⦌𝐵, 1) ∈ ℂ)
103	83, 85, 87, 102	fvmptd3 5736	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑢 ∈ (1...𝑀)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝐹‘𝑛) / 𝑘⦌𝐵, 1))‘𝑢) = if(𝑢 ≤ (♯‘𝐴), ⦋(𝐹‘𝑢) / 𝑘⦌𝐵, 1))
104	103, 97	eqtrd 2262	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑢 ∈ (1...𝑀)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝐹‘𝑛) / 𝑘⦌𝐵, 1))‘𝑢) = ⦋(𝐹‘𝑢) / 𝑘⦌𝐵)
105		breq1 4089	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 = 𝑢 → (𝑛 ≤ 𝑀 ↔ 𝑢 ≤ 𝑀))
106	105, 73	ifbieq1d 3626	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑢 → if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1) = if(𝑢 ≤ 𝑀, (𝐺‘𝑢), 1))
107	89	iftrued 3610	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑢 ∈ (1...𝑀)) → if(𝑢 ≤ 𝑀, (𝐺‘𝑢), 1) = (𝐺‘𝑢))
108	107, 101	eqeltrd 2306	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑢 ∈ (1...𝑀)) → if(𝑢 ≤ 𝑀, (𝐺‘𝑢), 1) ∈ ℂ)
109	4, 106, 87, 108	fvmptd3 5736	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑢 ∈ (1...𝑀)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1))‘𝑢) = if(𝑢 ≤ 𝑀, (𝐺‘𝑢), 1))
110	109, 107	eqtrd 2262	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑢 ∈ (1...𝑀)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1))‘𝑢) = (𝐺‘𝑢))
111	82, 104, 110	3eqtr4rd 2273	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑢 ∈ (1...𝑀)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1))‘𝑢) = ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝐹‘𝑛) / 𝑘⦌𝐵, 1))‘𝑢))
112		elnnuz 9786	. . . . . . . . . . . . . 14 ⊢ (𝑝 ∈ ℕ ↔ 𝑝 ∈ (ℤ_≥‘1))
113	112, 34	sylan2br 288	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑝 ∈ (ℤ_≥‘1)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1))‘𝑝) ∈ ℂ)
114		breq1 4089	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 = 𝑝 → (𝑛 ≤ (♯‘𝐴) ↔ 𝑝 ≤ (♯‘𝐴)))
115		fveq2 5635	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 = 𝑝 → (𝐹‘𝑛) = (𝐹‘𝑝))
116	115	csbeq1d 3132	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 = 𝑝 → ⦋(𝐹‘𝑛) / 𝑘⦌𝐵 = ⦋(𝐹‘𝑝) / 𝑘⦌𝐵)
117	114, 116	ifbieq1d 3626	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑝 → if(𝑛 ≤ (♯‘𝐴), ⦋(𝐹‘𝑛) / 𝑘⦌𝐵, 1) = if(𝑝 ≤ (♯‘𝐴), ⦋(𝐹‘𝑝) / 𝑘⦌𝐵, 1))
118		simpll 527	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ) ∧ 𝑝 ≤ (♯‘𝐴)) → 𝜑)
119		simpr 110	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ) ∧ 𝑝 ≤ (♯‘𝐴)) → 𝑝 ≤ (♯‘𝐴))
120	94	breq2d 4098	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → (𝑝 ≤ 𝑀 ↔ 𝑝 ≤ (♯‘𝐴)))
121	120	ad2antrr 488	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ) ∧ 𝑝 ≤ (♯‘𝐴)) → (𝑝 ≤ 𝑀 ↔ 𝑝 ≤ (♯‘𝐴)))
122	119, 121	mpbird 167	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ) ∧ 𝑝 ≤ (♯‘𝐴)) → 𝑝 ≤ 𝑀)
123	122, 16	syldan 282	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ) ∧ 𝑝 ≤ (♯‘𝐴)) → 𝑝 ∈ (1...𝑀))
124	66	ffvelcdmda 5778	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑝 ∈ (1...𝑀)) → (𝐹‘𝑝) ∈ 𝐴)
125	20	ralrimiva 2603	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ)
126	125	adantr 276	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑝 ∈ (1...𝑀)) → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ)
127		nfcsb1v 3158	. . . . . . . . . . . . . . . . . . . . 21 ⊢ Ⅎ𝑘⦋(𝐹‘𝑝) / 𝑘⦌𝐵
128	127	nfel1 2383	. . . . . . . . . . . . . . . . . . . 20 ⊢ Ⅎ𝑘⦋(𝐹‘𝑝) / 𝑘⦌𝐵 ∈ ℂ
129		csbeq1a 3134	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑘 = (𝐹‘𝑝) → 𝐵 = ⦋(𝐹‘𝑝) / 𝑘⦌𝐵)
130	129	eleq1d 2298	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 = (𝐹‘𝑝) → (𝐵 ∈ ℂ ↔ ⦋(𝐹‘𝑝) / 𝑘⦌𝐵 ∈ ℂ))
131	128, 130	rspc 2902	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹‘𝑝) ∈ 𝐴 → (∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ → ⦋(𝐹‘𝑝) / 𝑘⦌𝐵 ∈ ℂ))
132	124, 126, 131	sylc 62	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑝 ∈ (1...𝑀)) → ⦋(𝐹‘𝑝) / 𝑘⦌𝐵 ∈ ℂ)
133	118, 123, 132	syl2anc 411	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ) ∧ 𝑝 ≤ (♯‘𝐴)) → ⦋(𝐹‘𝑝) / 𝑘⦌𝐵 ∈ ℂ)
134		1cnd 8188	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ) ∧ ¬ 𝑝 ≤ (♯‘𝐴)) → 1 ∈ ℂ)
135	94, 12	eqeltrrd 2307	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (♯‘𝐴) ∈ ℤ)
136	135	adantr 276	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ) → (♯‘𝐴) ∈ ℤ)
137		zdcle 9549	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑝 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ) → DECID 𝑝 ≤ (♯‘𝐴))
138	28, 136, 137	syl2anc 411	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ) → DECID 𝑝 ≤ (♯‘𝐴))
139	133, 134, 138	ifcldadc 3633	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ) → if(𝑝 ≤ (♯‘𝐴), ⦋(𝐹‘𝑝) / 𝑘⦌𝐵, 1) ∈ ℂ)
140	83, 117, 8, 139	fvmptd3 5736	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝐹‘𝑛) / 𝑘⦌𝐵, 1))‘𝑝) = if(𝑝 ≤ (♯‘𝐴), ⦋(𝐹‘𝑝) / 𝑘⦌𝐵, 1))
141	140, 139	eqeltrd 2306	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝐹‘𝑛) / 𝑘⦌𝐵, 1))‘𝑝) ∈ ℂ)
142	112, 141	sylan2br 288	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑝 ∈ (ℤ_≥‘1)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝐹‘𝑛) / 𝑘⦌𝐵, 1))‘𝑝) ∈ ℂ)
143		mulcl 8152	. . . . . . . . . . . . . 14 ⊢ ((𝑝 ∈ ℂ ∧ 𝑞 ∈ ℂ) → (𝑝 · 𝑞) ∈ ℂ)
144	143	adantl 277	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑝 ∈ ℂ ∧ 𝑞 ∈ ℂ)) → (𝑝 · 𝑞) ∈ ℂ)
145	70, 111, 113, 142, 144	seq3fveq 10734	. . . . . . . . . . . 12 ⊢ (𝜑 → (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝐹‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑀))
146	19, 145	jca 306	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐹:(1...𝑀)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝐹‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑀)))
147		f1oeq1 5568	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝐹 → (𝑓:(1...𝑀)–1-1-onto→𝐴 ↔ 𝐹:(1...𝑀)–1-1-onto→𝐴))
148		fveq1 5634	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑛) = (𝐹‘𝑛))
149	148	csbeq1d 3132	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓 = 𝐹 → ⦋(𝑓‘𝑛) / 𝑘⦌𝐵 = ⦋(𝐹‘𝑛) / 𝑘⦌𝐵)
150	149	ifeq1d 3621	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 = 𝐹 → if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1) = if(𝑛 ≤ (♯‘𝐴), ⦋(𝐹‘𝑛) / 𝑘⦌𝐵, 1))
151	150	mpteq2dv 4178	. . . . . . . . . . . . . . 15 ⊢ (𝑓 = 𝐹 → (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)) = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝐹‘𝑛) / 𝑘⦌𝐵, 1)))
152	151	seqeq3d 10710	. . . . . . . . . . . . . 14 ⊢ (𝑓 = 𝐹 → seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1))) = seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝐹‘𝑛) / 𝑘⦌𝐵, 1))))
153	152	fveq1d 5637	. . . . . . . . . . . . 13 ⊢ (𝑓 = 𝐹 → (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝐹‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑀))
154	153	eqeq2d 2241	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝐹 → ((seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑀) ↔ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝐹‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑀)))
155	147, 154	anbi12d 473	. . . . . . . . . . 11 ⊢ (𝑓 = 𝐹 → ((𝑓:(1...𝑀)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑀)) ↔ (𝐹:(1...𝑀)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝐹‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑀))))
156	69, 146, 155	spcedv 2893	. . . . . . . . . 10 ⊢ (𝜑 → ∃𝑓(𝑓:(1...𝑀)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑀)))
157		oveq2 6021	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑀 → (1...𝑚) = (1...𝑀))
158	157	f1oeq2d 5576	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑀 → (𝑓:(1...𝑚)–1-1-onto→𝐴 ↔ 𝑓:(1...𝑀)–1-1-onto→𝐴))
159		fveq2 5635	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑀 → (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑀))
160	159	eqeq2d 2241	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑀 → ((seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚) ↔ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑀)))
161	158, 160	anbi12d 473	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑀 → ((𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)) ↔ (𝑓:(1...𝑀)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑀))))
162	161	exbidv 1871	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑀 → (∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)) ↔ ∃𝑓(𝑓:(1...𝑀)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑀))))
163	162	rspcev 2908	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℕ ∧ ∃𝑓(𝑓:(1...𝑀)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑀))) → ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)))
164	11, 156, 163	syl2anc 411	. . . . . . . . 9 ⊢ (𝜑 → ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)))
165	164	olcd 739	. . . . . . . 8 ⊢ (𝜑 → (∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀))) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))))
166		nfcv 2372	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑗if(𝑘 ∈ 𝐴, 𝐵, 1)
167		nfv 1574	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘 𝑗 ∈ 𝐴
168		nfcsb1v 3158	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘⦋𝑗 / 𝑘⦌𝐵
169		nfcv 2372	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘1
170	167, 168, 169	nfif 3632	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑘if(𝑗 ∈ 𝐴, ⦋𝑗 / 𝑘⦌𝐵, 1)
171		eleq1w 2290	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑗 → (𝑘 ∈ 𝐴 ↔ 𝑗 ∈ 𝐴))
172		csbeq1a 3134	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑗 → 𝐵 = ⦋𝑗 / 𝑘⦌𝐵)
173	171, 172	ifbieq1d 3626	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝑗 → if(𝑘 ∈ 𝐴, 𝐵, 1) = if(𝑗 ∈ 𝐴, ⦋𝑗 / 𝑘⦌𝐵, 1))
174	166, 170, 173	cbvmpt 4182	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1)) = (𝑗 ∈ ℤ ↦ if(𝑗 ∈ 𝐴, ⦋𝑗 / 𝑘⦌𝐵, 1))
175	168	nfel1 2383	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘⦋𝑗 / 𝑘⦌𝐵 ∈ ℂ
176	172	eleq1d 2298	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑗 → (𝐵 ∈ ℂ ↔ ⦋𝑗 / 𝑘⦌𝐵 ∈ ℂ))
177	175, 176	rspc 2902	. . . . . . . . . . . . . 14 ⊢ (𝑗 ∈ 𝐴 → (∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ → ⦋𝑗 / 𝑘⦌𝐵 ∈ ℂ))
178	125, 177	mpan9 281	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → ⦋𝑗 / 𝑘⦌𝐵 ∈ ℂ)
179		breq1 4089	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 𝑖 → (𝑛 ≤ (♯‘𝐴) ↔ 𝑖 ≤ (♯‘𝐴)))
180		fveq2 5635	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 = 𝑖 → (𝑓‘𝑛) = (𝑓‘𝑖))
181	180	csbeq1d 3132	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑖 → ⦋(𝑓‘𝑛) / 𝑘⦌𝐵 = ⦋(𝑓‘𝑖) / 𝑘⦌𝐵)
182		csbcow 3136	. . . . . . . . . . . . . . . 16 ⊢ ⦋(𝑓‘𝑖) / 𝑗⦌⦋𝑗 / 𝑘⦌𝐵 = ⦋(𝑓‘𝑖) / 𝑘⦌𝐵
183	181, 182	eqtr4di 2280	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 𝑖 → ⦋(𝑓‘𝑛) / 𝑘⦌𝐵 = ⦋(𝑓‘𝑖) / 𝑗⦌⦋𝑗 / 𝑘⦌𝐵)
184	179, 183	ifbieq1d 3626	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑖 → if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1) = if(𝑖 ≤ (♯‘𝐴), ⦋(𝑓‘𝑖) / 𝑗⦌⦋𝑗 / 𝑘⦌𝐵, 1))
185	184	cbvmptv 4183	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)) = (𝑖 ∈ ℕ ↦ if(𝑖 ≤ (♯‘𝐴), ⦋(𝑓‘𝑖) / 𝑗⦌⦋𝑗 / 𝑘⦌𝐵, 1))
186	174, 178, 185	prodmodc 12132	. . . . . . . . . . . 12 ⊢ (𝜑 → ∃*𝑥(∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))))
187	36, 186	jca 306	. . . . . . . . . . 11 ⊢ (𝜑 → ((seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) ∈ ℂ ∧ ∃*𝑥(∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)))))
188		breq2 4090	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) → (seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥 ↔ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀)))
189	188	anbi2d 464	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) → ((∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥) ↔ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀))))
190	189	anbi2d 464	. . . . . . . . . . . . . 14 ⊢ (𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) → (((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ↔ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀)))))
191	190	rexbidv 2531	. . . . . . . . . . . . 13 ⊢ (𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) → (∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ↔ ∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀)))))
192		eqeq1 2236	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) → (𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚) ↔ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)))
193	192	anbi2d 464	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) → ((𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)) ↔ (𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))))
194	193	exbidv 1871	. . . . . . . . . . . . . 14 ⊢ (𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) → (∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)) ↔ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))))
195	194	rexbidv 2531	. . . . . . . . . . . . 13 ⊢ (𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) → (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)) ↔ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))))
196	191, 195	orbi12d 798	. . . . . . . . . . . 12 ⊢ (𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) → ((∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))) ↔ (∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀))) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)))))
197	196	moi2 2985	. . . . . . . . . . 11 ⊢ ((((seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) ∈ ℂ ∧ ∃*𝑥(∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)))) ∧ ((∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))) ∧ (∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀))) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))))) → 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀))
198	187, 197	sylan 283	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))) ∧ (∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀))) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))))) → 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀))
199	198	ancom2s 566	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀))) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))) ∧ (∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))))) → 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀))
200	199	expr 375	. . . . . . . 8 ⊢ ((𝜑 ∧ (∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀))) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)))) → ((∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))) → 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀)))
201	165, 200	mpdan 421	. . . . . . 7 ⊢ (𝜑 → ((∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))) → 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀)))
202	64, 201	biimtrrid 153	. . . . . 6 ⊢ (𝜑 → ((∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ_≥‘𝑚)DECID 𝑗 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))) → 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀)))
203	64, 196	bitr3id 194	. . . . . . 7 ⊢ (𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) → ((∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ_≥‘𝑚)DECID 𝑗 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))) ↔ (∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑖 ∈ (ℤ_≥‘𝑚)DECID 𝑖 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀))) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)))))
204	165, 203	syl5ibrcom 157	. . . . . 6 ⊢ (𝜑 → (𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) → (∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ_≥‘𝑚)DECID 𝑗 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)))))
205	202, 204	impbid 129	. . . . 5 ⊢ (𝜑 → ((∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ_≥‘𝑚)DECID 𝑗 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))) ↔ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀)))
206	205	adantr 276	. . . 4 ⊢ ((𝜑 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) ∈ ℂ) → ((∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ_≥‘𝑚)DECID 𝑗 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚))) ↔ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀)))
207	206	iota5 5306	. . 3 ⊢ ((𝜑 ∧ (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀) ∈ ℂ) → (℩𝑥(∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ_≥‘𝑚)DECID 𝑗 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)))) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀))
208	36, 207	mpdan 421	. 2 ⊢ (𝜑 → (℩𝑥(∃𝑚 ∈ ℤ ((𝐴 ⊆ (ℤ_≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ_≥‘𝑚)DECID 𝑗 ∈ 𝐴) ∧ (∃𝑛 ∈ (ℤ_≥‘𝑚)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑥)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 1)))‘𝑚)))) = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀))
209	1, 208	eqtrid 2274	1 ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 = (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑀, (𝐺‘𝑛), 1)))‘𝑀))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 713 DECID wdc 839 = wceq 1395 ∃wex 1538 ∃*wmo 2078 ∈ wcel 2200 ∀wral 2508 ∃wrex 2509 Vcvv 2800 ⦋csb 3125 ⊆ wss 3198 ifcif 3603 class class class wbr 4086 ↦ cmpt 4148 ℩cio 5282 ⟶wf 5320 –1-1-onto→wf1o 5323 ‘cfv 5324 (class class class)co 6013 Fincfn 6904 ℂcc 8023 0cc0 8025 1c1 8026 · cmul 8030 ≤ cle 8208 # cap 8754 ℕcn 9136 ℕ₀cn0 9395 ℤcz 9472 ℤ_≥cuz 9748 ...cfz 10236 seqcseq 10702 ♯chash 11030 ⇝ cli 11832 ∏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: prod1dc 12140 fprodf1o 12142 fprodmul 12145 prodsnf 12146

W3C validator