fprodntrivap - Intuitionistic Logic Explorer

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

Theorem fprodntrivap 11605

Description: A non-triviality lemma for finite sequences. (Contributed by Scott Fenton, 16-Dec-2017.)

**Hypotheses**
Ref	Expression
fprodntriv.1	⊢ 𝑍 = (ℤ_≥‘𝑀)
fprodntriv.2	⊢ (𝜑 → 𝑁 ∈ 𝑍)
fprodntriv.3	⊢ (𝜑 → 𝐴 ⊆ (𝑀...𝑁))

**Assertion**
Ref	Expression
fprodntrivap	⊢ (𝜑 → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦))

Distinct variable groups: 𝐴,𝑘,𝑛,𝑦 𝐵,𝑛,𝑦 𝑛,𝑁,𝑦 𝑘,𝑍,𝑛,𝑦 𝜑,𝑛 Allowed substitution hints: 𝜑(𝑦,𝑘) 𝐵(𝑘) 𝑀(𝑦,𝑘,𝑛) 𝑁(𝑘)

Proof of Theorem fprodntrivap Dummy variables 𝑚 𝑝 𝑞 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fprodntriv.2	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ 𝑍)
2		fprodntriv.1	. . . . 5 ⊢ 𝑍 = (ℤ_≥‘𝑀)
3	1, 2	eleqtrdi 2280	. . . 4 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
4		peano2uz 9596	. . . 4 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (𝑁 + 1) ∈ (ℤ_≥‘𝑀))
5	3, 4	syl 14	. . 3 ⊢ (𝜑 → (𝑁 + 1) ∈ (ℤ_≥‘𝑀))
6	5, 2	eleqtrrdi 2281	. 2 ⊢ (𝜑 → (𝑁 + 1) ∈ 𝑍)
7		1ap0 8560	. . 3 ⊢ 1 # 0
8		eqid 2187	. . . 4 ⊢ (ℤ_≥‘(𝑁 + 1)) = (ℤ_≥‘(𝑁 + 1))
9		eluzelz 9550	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑁 ∈ ℤ)
10	9, 2	eleq2s 2282	. . . . . 6 ⊢ (𝑁 ∈ 𝑍 → 𝑁 ∈ ℤ)
11	1, 10	syl 14	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ)
12	11	peano2zd 9391	. . . 4 ⊢ (𝜑 → (𝑁 + 1) ∈ ℤ)
13		seqex 10460	. . . . 5 ⊢ seq(𝑁 + 1)( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ∈ V
14	13	a1i 9	. . . 4 ⊢ (𝜑 → seq(𝑁 + 1)( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ∈ V)
15		1cnd 7986	. . . 4 ⊢ (𝜑 → 1 ∈ ℂ)
16		simpr 110	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) → 𝑛 ∈ (ℤ_≥‘(𝑁 + 1)))
17		fprodntriv.3	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ⊆ (𝑀...𝑁))
18	17	ad2antrr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → 𝐴 ⊆ (𝑀...𝑁))
19	11	ad2antrr 488	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → 𝑁 ∈ ℤ)
20	19	zred 9388	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → 𝑁 ∈ ℝ)
21	19	peano2zd 9391	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → (𝑁 + 1) ∈ ℤ)
22	21	zred 9388	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → (𝑁 + 1) ∈ ℝ)
23		elfzelz 10038	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 ∈ ((𝑁 + 1)...𝑛) → 𝑚 ∈ ℤ)
24	23	adantl 277	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → 𝑚 ∈ ℤ)
25	24	zred 9388	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → 𝑚 ∈ ℝ)
26	20	ltp1d 8900	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → 𝑁 < (𝑁 + 1))
27		elfzle1 10040	. . . . . . . . . . . . . . 15 ⊢ (𝑚 ∈ ((𝑁 + 1)...𝑛) → (𝑁 + 1) ≤ 𝑚)
28	27	adantl 277	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → (𝑁 + 1) ≤ 𝑚)
29	20, 22, 25, 26, 28	ltletrd 8393	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → 𝑁 < 𝑚)
30		zltnle 9312	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ ℤ ∧ 𝑚 ∈ ℤ) → (𝑁 < 𝑚 ↔ ¬ 𝑚 ≤ 𝑁))
31	19, 24, 30	syl2anc 411	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → (𝑁 < 𝑚 ↔ ¬ 𝑚 ≤ 𝑁))
32	29, 31	mpbid 147	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → ¬ 𝑚 ≤ 𝑁)
33	32	intnand 932	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → ¬ (𝑀 ≤ 𝑚 ∧ 𝑚 ≤ 𝑁))
34	33	intnand 932	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → ¬ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑚 ∈ ℤ) ∧ (𝑀 ≤ 𝑚 ∧ 𝑚 ≤ 𝑁)))
35		elfz2 10028	. . . . . . . . . 10 ⊢ (𝑚 ∈ (𝑀...𝑁) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑚 ∈ ℤ) ∧ (𝑀 ≤ 𝑚 ∧ 𝑚 ≤ 𝑁)))
36	34, 35	sylnibr 678	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → ¬ 𝑚 ∈ (𝑀...𝑁))
37	18, 36	ssneldd 3170	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → ¬ 𝑚 ∈ 𝐴)
38	37	iffalsed 3556	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → if(𝑚 ∈ 𝐴, ⦋𝑚 / 𝑘⦌𝐵, 1) = 1)
39	6	ad2antrr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → (𝑁 + 1) ∈ 𝑍)
40		elfzuz 10034	. . . . . . . . . 10 ⊢ (𝑚 ∈ ((𝑁 + 1)...𝑛) → 𝑚 ∈ (ℤ_≥‘(𝑁 + 1)))
41	40	adantl 277	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → 𝑚 ∈ (ℤ_≥‘(𝑁 + 1)))
42	2	uztrn2 9558	. . . . . . . . 9 ⊢ (((𝑁 + 1) ∈ 𝑍 ∧ 𝑚 ∈ (ℤ_≥‘(𝑁 + 1))) → 𝑚 ∈ 𝑍)
43	39, 41, 42	syl2anc 411	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → 𝑚 ∈ 𝑍)
44		ax-1cn 7917	. . . . . . . . 9 ⊢ 1 ∈ ℂ
45	38, 44	eqeltrdi 2278	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → if(𝑚 ∈ 𝐴, ⦋𝑚 / 𝑘⦌𝐵, 1) ∈ ℂ)
46		nfcv 2329	. . . . . . . . 9 ⊢ Ⅎ𝑘𝑚
47		nfv 1538	. . . . . . . . . 10 ⊢ Ⅎ𝑘 𝑚 ∈ 𝐴
48		nfcsb1v 3102	. . . . . . . . . 10 ⊢ Ⅎ𝑘⦋𝑚 / 𝑘⦌𝐵
49		nfcv 2329	. . . . . . . . . 10 ⊢ Ⅎ𝑘1
50	47, 48, 49	nfif 3574	. . . . . . . . 9 ⊢ Ⅎ𝑘if(𝑚 ∈ 𝐴, ⦋𝑚 / 𝑘⦌𝐵, 1)
51		eleq1w 2248	. . . . . . . . . 10 ⊢ (𝑘 = 𝑚 → (𝑘 ∈ 𝐴 ↔ 𝑚 ∈ 𝐴))
52		csbeq1a 3078	. . . . . . . . . 10 ⊢ (𝑘 = 𝑚 → 𝐵 = ⦋𝑚 / 𝑘⦌𝐵)
53	51, 52	ifbieq1d 3568	. . . . . . . . 9 ⊢ (𝑘 = 𝑚 → if(𝑘 ∈ 𝐴, 𝐵, 1) = if(𝑚 ∈ 𝐴, ⦋𝑚 / 𝑘⦌𝐵, 1))
54		eqid 2187	. . . . . . . . 9 ⊢ (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1)) = (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))
55	46, 50, 53, 54	fvmptf 5621	. . . . . . . 8 ⊢ ((𝑚 ∈ 𝑍 ∧ if(𝑚 ∈ 𝐴, ⦋𝑚 / 𝑘⦌𝐵, 1) ∈ ℂ) → ((𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))‘𝑚) = if(𝑚 ∈ 𝐴, ⦋𝑚 / 𝑘⦌𝐵, 1))
56	43, 45, 55	syl2anc 411	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → ((𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))‘𝑚) = if(𝑚 ∈ 𝐴, ⦋𝑚 / 𝑘⦌𝐵, 1))
57		1ex 7965	. . . . . . . . 9 ⊢ 1 ∈ V
58	57	fvconst2 5745	. . . . . . . 8 ⊢ (𝑚 ∈ (ℤ_≥‘(𝑁 + 1)) → (((ℤ_≥‘(𝑁 + 1)) × {1})‘𝑚) = 1)
59	41, 58	syl 14	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → (((ℤ_≥‘(𝑁 + 1)) × {1})‘𝑚) = 1)
60	38, 56, 59	3eqtr4d 2230	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑚 ∈ ((𝑁 + 1)...𝑛)) → ((𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))‘𝑚) = (((ℤ_≥‘(𝑁 + 1)) × {1})‘𝑚))
61	6	ad2antrr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → (𝑁 + 1) ∈ 𝑍)
62		simpr 110	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → 𝑝 ∈ (ℤ_≥‘(𝑁 + 1)))
63	2	uztrn2 9558	. . . . . . . . 9 ⊢ (((𝑁 + 1) ∈ 𝑍 ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → 𝑝 ∈ 𝑍)
64	61, 62, 63	syl2anc 411	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → 𝑝 ∈ 𝑍)
65	17	ad2antrr 488	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → 𝐴 ⊆ (𝑀...𝑁))
66	11	ad2antrr 488	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → 𝑁 ∈ ℤ)
67	66	zred 9388	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → 𝑁 ∈ ℝ)
68		peano2re 8106	. . . . . . . . . . . . . . . . 17 ⊢ (𝑁 ∈ ℝ → (𝑁 + 1) ∈ ℝ)
69	67, 68	syl 14	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → (𝑁 + 1) ∈ ℝ)
70		eluzelz 9550	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑝 ∈ (ℤ_≥‘(𝑁 + 1)) → 𝑝 ∈ ℤ)
71	70	adantl 277	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → 𝑝 ∈ ℤ)
72	71	zred 9388	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → 𝑝 ∈ ℝ)
73	67	ltp1d 8900	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → 𝑁 < (𝑁 + 1))
74		eluzle 9553	. . . . . . . . . . . . . . . . 17 ⊢ (𝑝 ∈ (ℤ_≥‘(𝑁 + 1)) → (𝑁 + 1) ≤ 𝑝)
75	74	adantl 277	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → (𝑁 + 1) ≤ 𝑝)
76	67, 69, 72, 73, 75	ltletrd 8393	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → 𝑁 < 𝑝)
77		zltnle 9312	. . . . . . . . . . . . . . . 16 ⊢ ((𝑁 ∈ ℤ ∧ 𝑝 ∈ ℤ) → (𝑁 < 𝑝 ↔ ¬ 𝑝 ≤ 𝑁))
78	66, 71, 77	syl2anc 411	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → (𝑁 < 𝑝 ↔ ¬ 𝑝 ≤ 𝑁))
79	76, 78	mpbid 147	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → ¬ 𝑝 ≤ 𝑁)
80	79	intnand 932	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → ¬ (𝑀 ≤ 𝑝 ∧ 𝑝 ≤ 𝑁))
81	80	intnand 932	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → ¬ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑝 ∈ ℤ) ∧ (𝑀 ≤ 𝑝 ∧ 𝑝 ≤ 𝑁)))
82		elfz2 10028	. . . . . . . . . . . 12 ⊢ (𝑝 ∈ (𝑀...𝑁) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑝 ∈ ℤ) ∧ (𝑀 ≤ 𝑝 ∧ 𝑝 ≤ 𝑁)))
83	81, 82	sylnibr 678	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → ¬ 𝑝 ∈ (𝑀...𝑁))
84	65, 83	ssneldd 3170	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → ¬ 𝑝 ∈ 𝐴)
85	84	iffalsed 3556	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → if(𝑝 ∈ 𝐴, ⦋𝑝 / 𝑘⦌𝐵, 1) = 1)
86	85, 44	eqeltrdi 2278	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → if(𝑝 ∈ 𝐴, ⦋𝑝 / 𝑘⦌𝐵, 1) ∈ ℂ)
87		nfcv 2329	. . . . . . . . 9 ⊢ Ⅎ𝑘𝑝
88		nfv 1538	. . . . . . . . . 10 ⊢ Ⅎ𝑘 𝑝 ∈ 𝐴
89		nfcsb1v 3102	. . . . . . . . . 10 ⊢ Ⅎ𝑘⦋𝑝 / 𝑘⦌𝐵
90	88, 89, 49	nfif 3574	. . . . . . . . 9 ⊢ Ⅎ𝑘if(𝑝 ∈ 𝐴, ⦋𝑝 / 𝑘⦌𝐵, 1)
91		eleq1w 2248	. . . . . . . . . 10 ⊢ (𝑘 = 𝑝 → (𝑘 ∈ 𝐴 ↔ 𝑝 ∈ 𝐴))
92		csbeq1a 3078	. . . . . . . . . 10 ⊢ (𝑘 = 𝑝 → 𝐵 = ⦋𝑝 / 𝑘⦌𝐵)
93	91, 92	ifbieq1d 3568	. . . . . . . . 9 ⊢ (𝑘 = 𝑝 → if(𝑘 ∈ 𝐴, 𝐵, 1) = if(𝑝 ∈ 𝐴, ⦋𝑝 / 𝑘⦌𝐵, 1))
94	87, 90, 93, 54	fvmptf 5621	. . . . . . . 8 ⊢ ((𝑝 ∈ 𝑍 ∧ if(𝑝 ∈ 𝐴, ⦋𝑝 / 𝑘⦌𝐵, 1) ∈ ℂ) → ((𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))‘𝑝) = if(𝑝 ∈ 𝐴, ⦋𝑝 / 𝑘⦌𝐵, 1))
95	64, 86, 94	syl2anc 411	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → ((𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))‘𝑝) = if(𝑝 ∈ 𝐴, ⦋𝑝 / 𝑘⦌𝐵, 1))
96	95, 86	eqeltrd 2264	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → ((𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))‘𝑝) ∈ ℂ)
97	57	fvconst2 5745	. . . . . . . 8 ⊢ (𝑝 ∈ (ℤ_≥‘(𝑁 + 1)) → (((ℤ_≥‘(𝑁 + 1)) × {1})‘𝑝) = 1)
98	97	adantl 277	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → (((ℤ_≥‘(𝑁 + 1)) × {1})‘𝑝) = 1)
99	98, 44	eqeltrdi 2278	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ 𝑝 ∈ (ℤ_≥‘(𝑁 + 1))) → (((ℤ_≥‘(𝑁 + 1)) × {1})‘𝑝) ∈ ℂ)
100		mulcl 7951	. . . . . . 7 ⊢ ((𝑝 ∈ ℂ ∧ 𝑞 ∈ ℂ) → (𝑝 · 𝑞) ∈ ℂ)
101	100	adantl 277	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) ∧ (𝑝 ∈ ℂ ∧ 𝑞 ∈ ℂ)) → (𝑝 · 𝑞) ∈ ℂ)
102	16, 60, 96, 99, 101	seq3fveq 10484	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) → (seq(𝑁 + 1)( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1)))‘𝑛) = (seq(𝑁 + 1)( · , ((ℤ_≥‘(𝑁 + 1)) × {1}))‘𝑛))
103	8	prodf1 11563	. . . . . 6 ⊢ (𝑛 ∈ (ℤ_≥‘(𝑁 + 1)) → (seq(𝑁 + 1)( · , ((ℤ_≥‘(𝑁 + 1)) × {1}))‘𝑛) = 1)
104	103	adantl 277	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) → (seq(𝑁 + 1)( · , ((ℤ_≥‘(𝑁 + 1)) × {1}))‘𝑛) = 1)
105	102, 104	eqtrd 2220	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘(𝑁 + 1))) → (seq(𝑁 + 1)( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1)))‘𝑛) = 1)
106	8, 12, 14, 15, 105	climconst 11311	. . 3 ⊢ (𝜑 → seq(𝑁 + 1)( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 1)
107		breq1 4018	. . . . 5 ⊢ (𝑦 = 1 → (𝑦 # 0 ↔ 1 # 0))
108		breq2 4019	. . . . 5 ⊢ (𝑦 = 1 → (seq(𝑁 + 1)( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦 ↔ seq(𝑁 + 1)( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 1))
109	107, 108	anbi12d 473	. . . 4 ⊢ (𝑦 = 1 → ((𝑦 # 0 ∧ seq(𝑁 + 1)( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ↔ (1 # 0 ∧ seq(𝑁 + 1)( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 1)))
110	57, 109	spcev 2844	. . 3 ⊢ ((1 # 0 ∧ seq(𝑁 + 1)( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 1) → ∃𝑦(𝑦 # 0 ∧ seq(𝑁 + 1)( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦))
111	7, 106, 110	sylancr 414	. 2 ⊢ (𝜑 → ∃𝑦(𝑦 # 0 ∧ seq(𝑁 + 1)( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦))
112		seqeq1 10461	. . . . . 6 ⊢ (𝑛 = (𝑁 + 1) → seq𝑛( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) = seq(𝑁 + 1)( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))))
113	112	breq1d 4025	. . . . 5 ⊢ (𝑛 = (𝑁 + 1) → (seq𝑛( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦 ↔ seq(𝑁 + 1)( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦))
114	113	anbi2d 464	. . . 4 ⊢ (𝑛 = (𝑁 + 1) → ((𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ↔ (𝑦 # 0 ∧ seq(𝑁 + 1)( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦)))
115	114	exbidv 1835	. . 3 ⊢ (𝑛 = (𝑁 + 1) → (∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦) ↔ ∃𝑦(𝑦 # 0 ∧ seq(𝑁 + 1)( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦)))
116	115	rspcev 2853	. 2 ⊢ (((𝑁 + 1) ∈ 𝑍 ∧ ∃𝑦(𝑦 # 0 ∧ seq(𝑁 + 1)( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦)) → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦))
117	6, 111, 116	syl2anc 411	1 ⊢ (𝜑 → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ 𝑍 ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))) ⇝ 𝑦))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 979 = wceq 1363 ∃wex 1502 ∈ wcel 2158 ∃wrex 2466 Vcvv 2749 ⦋csb 3069 ⊆ wss 3141 ifcif 3546 {csn 3604 class class class wbr 4015 ↦ cmpt 4076 × cxp 4636 ‘cfv 5228 (class class class)co 5888 ℂcc 7822 ℝcr 7823 0cc0 7824 1c1 7825 + caddc 7827 · cmul 7829 < clt 8005 ≤ cle 8006 # cap 8551 ℤcz 9266 ℤ_≥cuz 9541 ...cfz 10021 seqcseq 10458 ⇝ cli 11299

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 1457 ax-7 1458 ax-gen 1459 ax-ie1 1503 ax-ie2 1504 ax-8 1514 ax-10 1515 ax-11 1516 ax-i12 1517 ax-bndl 1519 ax-4 1520 ax-17 1536 ax-i9 1540 ax-ial 1544 ax-i5r 1545 ax-13 2160 ax-14 2161 ax-ext 2169 ax-coll 4130 ax-sep 4133 ax-nul 4141 ax-pow 4186 ax-pr 4221 ax-un 4445 ax-setind 4548 ax-iinf 4599 ax-cnex 7915 ax-resscn 7916 ax-1cn 7917 ax-1re 7918 ax-icn 7919 ax-addcl 7920 ax-addrcl 7921 ax-mulcl 7922 ax-mulrcl 7923 ax-addcom 7924 ax-mulcom 7925 ax-addass 7926 ax-mulass 7927 ax-distr 7928 ax-i2m1 7929 ax-0lt1 7930 ax-1rid 7931 ax-0id 7932 ax-rnegex 7933 ax-precex 7934 ax-cnre 7935 ax-pre-ltirr 7936 ax-pre-ltwlin 7937 ax-pre-lttrn 7938 ax-pre-apti 7939 ax-pre-ltadd 7940 ax-pre-mulgt0 7941 ax-pre-mulext 7942

This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 980 df-3an 981 df-tru 1366 df-fal 1369 df-nf 1471 df-sb 1773 df-eu 2039 df-mo 2040 df-clab 2174 df-cleq 2180 df-clel 2183 df-nfc 2318 df-ne 2358 df-nel 2453 df-ral 2470 df-rex 2471 df-reu 2472 df-rmo 2473 df-rab 2474 df-v 2751 df-sbc 2975 df-csb 3070 df-dif 3143 df-un 3145 df-in 3147 df-ss 3154 df-nul 3435 df-if 3547 df-pw 3589 df-sn 3610 df-pr 3611 df-op 3613 df-uni 3822 df-int 3857 df-iun 3900 df-br 4016 df-opab 4077 df-mpt 4078 df-tr 4114 df-id 4305 df-po 4308 df-iso 4309 df-iord 4378 df-on 4380 df-ilim 4381 df-suc 4383 df-iom 4602 df-xp 4644 df-rel 4645 df-cnv 4646 df-co 4647 df-dm 4648 df-rn 4649 df-res 4650 df-ima 4651 df-iota 5190 df-fun 5230 df-fn 5231 df-f 5232 df-f1 5233 df-fo 5234 df-f1o 5235 df-fv 5236 df-riota 5844 df-ov 5891 df-oprab 5892 df-mpo 5893 df-1st 6154 df-2nd 6155 df-recs 6319 df-frec 6405 df-pnf 8007 df-mnf 8008 df-xr 8009 df-ltxr 8010 df-le 8011 df-sub 8143 df-neg 8144 df-reap 8545 df-ap 8552 df-div 8643 df-inn 8933 df-2 8991 df-n0 9190 df-z 9267 df-uz 9542 df-rp 9667 df-fz 10022 df-fzo 10156 df-seqfrec 10459 df-exp 10533 df-cj 10864 df-rsqrt 11020 df-abs 11021 df-clim 11300

This theorem is referenced by: fprodssdc 11611

W3C validator