Theorem seqfeq4g 10946

Description: Equality of series under different addition operations which agree on an additively closed subset. (Contributed by Mario Carneiro, 25-Apr-2016.)

Hypotheses

Ref	Expression
seqfeq4.m	⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀))
seqfeq4.f	⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀...𝑁)) → (𝐹‘𝑥) ∈ 𝑆)
seqfeq4g.f	⊢ (𝜑 → 𝐹 ∈ 𝑉)
seqfeq4g.p	⊢ (𝜑 → + ∈ 𝑊)
seqfeq4g.q	⊢ (𝜑 → 𝑄 ∈ 𝑋)
seqfeq4.cl	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
seqfeq4.id	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) = (𝑥𝑄𝑦))

Assertion

Ref	Expression
seqfeq4g	⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) = (seq𝑀(𝑄, 𝐹)‘𝑁))

Distinct variable groups:   𝑥,𝑦, +   𝑥,𝐹,𝑦   𝑥,𝑀,𝑦   𝑥,𝑁,𝑦   𝜑,𝑥,𝑦   𝑥,𝑄,𝑦   𝑥,𝑆,𝑦

Allowed substitution hints:   𝑉(𝑥,𝑦)   𝑊(𝑥,𝑦)   𝑋(𝑥,𝑦)

Proof of Theorem seqfeq4g

Dummy variables 𝑘 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		seqfeq4.m	. . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀))
2		eluzfz2 10415	. . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ (𝑀...𝑁))
3	1, 2	syl 14	. 2 ⊢ (𝜑 → 𝑁 ∈ (𝑀...𝑁))
4		fveq2 5690	. . . . 5 ⊢ (𝑤 = 𝑀 → (seq𝑀( + , 𝐹)‘𝑤) = (seq𝑀( + , 𝐹)‘𝑀))
5		fveq2 5690	. . . . 5 ⊢ (𝑤 = 𝑀 → (seq𝑀(𝑄, 𝐹)‘𝑤) = (seq𝑀(𝑄, 𝐹)‘𝑀))
6	4, 5	eqeq12d 2253	. . . 4 ⊢ (𝑤 = 𝑀 → ((seq𝑀( + , 𝐹)‘𝑤) = (seq𝑀(𝑄, 𝐹)‘𝑤) ↔ (seq𝑀( + , 𝐹)‘𝑀) = (seq𝑀(𝑄, 𝐹)‘𝑀)))
7	6	imbi2d 230	. . 3 ⊢ (𝑤 = 𝑀 → ((𝜑 → (seq𝑀( + , 𝐹)‘𝑤) = (seq𝑀(𝑄, 𝐹)‘𝑤)) ↔ (𝜑 → (seq𝑀( + , 𝐹)‘𝑀) = (seq𝑀(𝑄, 𝐹)‘𝑀))))
8		fveq2 5690	. . . . 5 ⊢ (𝑤 = 𝑘 → (seq𝑀( + , 𝐹)‘𝑤) = (seq𝑀( + , 𝐹)‘𝑘))
9		fveq2 5690	. . . . 5 ⊢ (𝑤 = 𝑘 → (seq𝑀(𝑄, 𝐹)‘𝑤) = (seq𝑀(𝑄, 𝐹)‘𝑘))
10	8, 9	eqeq12d 2253	. . . 4 ⊢ (𝑤 = 𝑘 → ((seq𝑀( + , 𝐹)‘𝑤) = (seq𝑀(𝑄, 𝐹)‘𝑤) ↔ (seq𝑀( + , 𝐹)‘𝑘) = (seq𝑀(𝑄, 𝐹)‘𝑘)))
11	10	imbi2d 230	. . 3 ⊢ (𝑤 = 𝑘 → ((𝜑 → (seq𝑀( + , 𝐹)‘𝑤) = (seq𝑀(𝑄, 𝐹)‘𝑤)) ↔ (𝜑 → (seq𝑀( + , 𝐹)‘𝑘) = (seq𝑀(𝑄, 𝐹)‘𝑘))))
12		fveq2 5690	. . . . 5 ⊢ (𝑤 = (𝑘 + 1) → (seq𝑀( + , 𝐹)‘𝑤) = (seq𝑀( + , 𝐹)‘(𝑘 + 1)))
13		fveq2 5690	. . . . 5 ⊢ (𝑤 = (𝑘 + 1) → (seq𝑀(𝑄, 𝐹)‘𝑤) = (seq𝑀(𝑄, 𝐹)‘(𝑘 + 1)))
14	12, 13	eqeq12d 2253	. . . 4 ⊢ (𝑤 = (𝑘 + 1) → ((seq𝑀( + , 𝐹)‘𝑤) = (seq𝑀(𝑄, 𝐹)‘𝑤) ↔ (seq𝑀( + , 𝐹)‘(𝑘 + 1)) = (seq𝑀(𝑄, 𝐹)‘(𝑘 + 1))))
15	14	imbi2d 230	. . 3 ⊢ (𝑤 = (𝑘 + 1) → ((𝜑 → (seq𝑀( + , 𝐹)‘𝑤) = (seq𝑀(𝑄, 𝐹)‘𝑤)) ↔ (𝜑 → (seq𝑀( + , 𝐹)‘(𝑘 + 1)) = (seq𝑀(𝑄, 𝐹)‘(𝑘 + 1)))))
16		fveq2 5690	. . . . 5 ⊢ (𝑤 = 𝑁 → (seq𝑀( + , 𝐹)‘𝑤) = (seq𝑀( + , 𝐹)‘𝑁))
17		fveq2 5690	. . . . 5 ⊢ (𝑤 = 𝑁 → (seq𝑀(𝑄, 𝐹)‘𝑤) = (seq𝑀(𝑄, 𝐹)‘𝑁))
18	16, 17	eqeq12d 2253	. . . 4 ⊢ (𝑤 = 𝑁 → ((seq𝑀( + , 𝐹)‘𝑤) = (seq𝑀(𝑄, 𝐹)‘𝑤) ↔ (seq𝑀( + , 𝐹)‘𝑁) = (seq𝑀(𝑄, 𝐹)‘𝑁)))
19	18	imbi2d 230	. . 3 ⊢ (𝑤 = 𝑁 → ((𝜑 → (seq𝑀( + , 𝐹)‘𝑤) = (seq𝑀(𝑄, 𝐹)‘𝑤)) ↔ (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) = (seq𝑀(𝑄, 𝐹)‘𝑁))))
20		eluzel2 9905	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ)
21	1, 20	syl 14	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ)
22		seqfeq4g.f	. . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ 𝑉)
23	22	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → 𝐹 ∈ 𝑉)
24		vex 2824	. . . . . . 7 ⊢ 𝑥 ∈ V
25		fvexg 5709	. . . . . . 7 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑥 ∈ V) → (𝐹‘𝑥) ∈ V)
26	23, 24, 25	sylancl 417	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ V)
27		seqfeq4g.p	. . . . . . 7 ⊢ (𝜑 → + ∈ 𝑊)
28		simprr 537	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V)) → 𝑦 ∈ V)
29		ovexg 6109	. . . . . . 7 ⊢ ((𝑥 ∈ V ∧ + ∈ 𝑊 ∧ 𝑦 ∈ V) → (𝑥 + 𝑦) ∈ V)
30	24, 27, 28, 29	mp3an2ani 1385	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V)) → (𝑥 + 𝑦) ∈ V)
31	21, 26, 30	seq3-1 10877	. . . . 5 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑀) = (𝐹‘𝑀))
32		seqfeq4g.q	. . . . . . 7 ⊢ (𝜑 → 𝑄 ∈ 𝑋)
33		ovexg 6109	. . . . . . 7 ⊢ ((𝑥 ∈ V ∧ 𝑄 ∈ 𝑋 ∧ 𝑦 ∈ V) → (𝑥𝑄𝑦) ∈ V)
34	24, 32, 28, 33	mp3an2ani 1385	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V)) → (𝑥𝑄𝑦) ∈ V)
35	21, 26, 34	seq3-1 10877	. . . . 5 ⊢ (𝜑 → (seq𝑀(𝑄, 𝐹)‘𝑀) = (𝐹‘𝑀))
36	31, 35	eqtr4d 2274	. . . 4 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑀) = (seq𝑀(𝑄, 𝐹)‘𝑀))
37	36	a1i 9	. . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝜑 → (seq𝑀( + , 𝐹)‘𝑀) = (seq𝑀(𝑄, 𝐹)‘𝑀)))
38		simpr 110	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ (seq𝑀( + , 𝐹)‘𝑘) = (seq𝑀(𝑄, 𝐹)‘𝑘)) → (seq𝑀( + , 𝐹)‘𝑘) = (seq𝑀(𝑄, 𝐹)‘𝑘))
39	38	oveq1d 6090	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ (seq𝑀( + , 𝐹)‘𝑘) = (seq𝑀(𝑄, 𝐹)‘𝑘)) → ((seq𝑀( + , 𝐹)‘𝑘) + (𝐹‘(𝑘 + 1))) = ((seq𝑀(𝑄, 𝐹)‘𝑘) + (𝐹‘(𝑘 + 1))))
40		oveq2 6083	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐹‘(𝑘 + 1)) → ((seq𝑀(𝑄, 𝐹)‘𝑘) + 𝑦) = ((seq𝑀(𝑄, 𝐹)‘𝑘) + (𝐹‘(𝑘 + 1))))
41		oveq2 6083	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐹‘(𝑘 + 1)) → ((seq𝑀(𝑄, 𝐹)‘𝑘)𝑄𝑦) = ((seq𝑀(𝑄, 𝐹)‘𝑘)𝑄(𝐹‘(𝑘 + 1))))
42	40, 41	eqeq12d 2253	. . . . . . . . . 10 ⊢ (𝑦 = (𝐹‘(𝑘 + 1)) → (((seq𝑀(𝑄, 𝐹)‘𝑘) + 𝑦) = ((seq𝑀(𝑄, 𝐹)‘𝑘)𝑄𝑦) ↔ ((seq𝑀(𝑄, 𝐹)‘𝑘) + (𝐹‘(𝑘 + 1))) = ((seq𝑀(𝑄, 𝐹)‘𝑘)𝑄(𝐹‘(𝑘 + 1)))))
43		oveq1 6082	. . . . . . . . . . . . 13 ⊢ (𝑥 = (seq𝑀(𝑄, 𝐹)‘𝑘) → (𝑥 + 𝑦) = ((seq𝑀(𝑄, 𝐹)‘𝑘) + 𝑦))
44		oveq1 6082	. . . . . . . . . . . . 13 ⊢ (𝑥 = (seq𝑀(𝑄, 𝐹)‘𝑘) → (𝑥𝑄𝑦) = ((seq𝑀(𝑄, 𝐹)‘𝑘)𝑄𝑦))
45	43, 44	eqeq12d 2253	. . . . . . . . . . . 12 ⊢ (𝑥 = (seq𝑀(𝑄, 𝐹)‘𝑘) → ((𝑥 + 𝑦) = (𝑥𝑄𝑦) ↔ ((seq𝑀(𝑄, 𝐹)‘𝑘) + 𝑦) = ((seq𝑀(𝑄, 𝐹)‘𝑘)𝑄𝑦)))
46	45	ralbidv 2550	. . . . . . . . . . 11 ⊢ (𝑥 = (seq𝑀(𝑄, 𝐹)‘𝑘) → (∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑥𝑄𝑦) ↔ ∀𝑦 ∈ 𝑆 ((seq𝑀(𝑄, 𝐹)‘𝑘) + 𝑦) = ((seq𝑀(𝑄, 𝐹)‘𝑘)𝑄𝑦)))
47		seqfeq4.id	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) = (𝑥𝑄𝑦))
48	47	ralrimivva 2632	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑥𝑄𝑦))
49	48	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑥𝑄𝑦))
50		elfzouz 10536	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ (𝑀..^𝑁) → 𝑘 ∈ (ℤ≥‘𝑀))
51	50	adantl 277	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) → 𝑘 ∈ (ℤ≥‘𝑀))
52	26	adantlr 481	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ V)
53		simpll 531	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (𝑀...𝑘)) → 𝜑)
54	21	ad2antrr 492	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (𝑀...𝑘)) → 𝑀 ∈ ℤ)
55	3	elfzelzd 10408	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑁 ∈ ℤ)
56	55	ad2antrr 492	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (𝑀...𝑘)) → 𝑁 ∈ ℤ)
57		elfzelz 10407	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ (𝑀...𝑘) → 𝑥 ∈ ℤ)
58	57	adantl 277	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (𝑀...𝑘)) → 𝑥 ∈ ℤ)
59		elfzle1 10410	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ (𝑀...𝑘) → 𝑀 ≤ 𝑥)
60	59	adantl 277	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (𝑀...𝑘)) → 𝑀 ≤ 𝑥)
61	58	zred 9747	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (𝑀...𝑘)) → 𝑥 ∈ ℝ)
62		elfzoelz 10532	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (𝑀..^𝑁) → 𝑘 ∈ ℤ)
63	62	ad2antlr 493	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (𝑀...𝑘)) → 𝑘 ∈ ℤ)
64	63	zred 9747	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (𝑀...𝑘)) → 𝑘 ∈ ℝ)
65	56	zred 9747	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (𝑀...𝑘)) → 𝑁 ∈ ℝ)
66		elfzle2 10411	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ (𝑀...𝑘) → 𝑥 ≤ 𝑘)
67	66	adantl 277	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (𝑀...𝑘)) → 𝑥 ≤ 𝑘)
68		elfzofz 10548	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (𝑀..^𝑁) → 𝑘 ∈ (𝑀...𝑁))
69		elfzle2 10411	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (𝑀...𝑁) → 𝑘 ≤ 𝑁)
70	68, 69	syl 14	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ (𝑀..^𝑁) → 𝑘 ≤ 𝑁)
71	70	ad2antlr 493	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (𝑀...𝑘)) → 𝑘 ≤ 𝑁)
72	61, 64, 65, 67, 71	letrd 8440	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (𝑀...𝑘)) → 𝑥 ≤ 𝑁)
73	54, 56, 58, 60, 72	elfzd 10398	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (𝑀...𝑘)) → 𝑥 ∈ (𝑀...𝑁))
74		seqfeq4.f	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀...𝑁)) → (𝐹‘𝑥) ∈ 𝑆)
75	53, 73, 74	syl2anc 415	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (𝑀...𝑘)) → (𝐹‘𝑥) ∈ 𝑆)
76		seqfeq4.cl	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
77	47, 76	eqeltrrd 2316	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝑄𝑦) ∈ 𝑆)
78	77	adantlr 481	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝑄𝑦) ∈ 𝑆)
79		ssv 3270	. . . . . . . . . . . . 13 ⊢ 𝑆 ⊆ V
80	79	a1i 9	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) → 𝑆 ⊆ V)
81	34	adantlr 481	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V)) → (𝑥𝑄𝑦) ∈ V)
82	51, 52, 75, 78, 80, 81	seq3clss 10886	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) → (seq𝑀(𝑄, 𝐹)‘𝑘) ∈ 𝑆)
83	46, 49, 82	rspcdva 2934	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) → ∀𝑦 ∈ 𝑆 ((seq𝑀(𝑄, 𝐹)‘𝑘) + 𝑦) = ((seq𝑀(𝑄, 𝐹)‘𝑘)𝑄𝑦))
84		fveq2 5690	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝑘 + 1) → (𝐹‘𝑥) = (𝐹‘(𝑘 + 1)))
85	84	eleq1d 2307	. . . . . . . . . . 11 ⊢ (𝑥 = (𝑘 + 1) → ((𝐹‘𝑥) ∈ 𝑆 ↔ (𝐹‘(𝑘 + 1)) ∈ 𝑆))
86	74	ralrimiva 2623	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑥 ∈ (𝑀...𝑁)(𝐹‘𝑥) ∈ 𝑆)
87	86	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) → ∀𝑥 ∈ (𝑀...𝑁)(𝐹‘𝑥) ∈ 𝑆)
88		fzofzp1 10623	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ (𝑀..^𝑁) → (𝑘 + 1) ∈ (𝑀...𝑁))
89	88	adantl 277	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) → (𝑘 + 1) ∈ (𝑀...𝑁))
90	85, 87, 89	rspcdva 2934	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) → (𝐹‘(𝑘 + 1)) ∈ 𝑆)
91	42, 83, 90	rspcdva 2934	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) → ((seq𝑀(𝑄, 𝐹)‘𝑘) + (𝐹‘(𝑘 + 1))) = ((seq𝑀(𝑄, 𝐹)‘𝑘)𝑄(𝐹‘(𝑘 + 1))))
92	91	adantr 276	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ (seq𝑀( + , 𝐹)‘𝑘) = (seq𝑀(𝑄, 𝐹)‘𝑘)) → ((seq𝑀(𝑄, 𝐹)‘𝑘) + (𝐹‘(𝑘 + 1))) = ((seq𝑀(𝑄, 𝐹)‘𝑘)𝑄(𝐹‘(𝑘 + 1))))
93	39, 92	eqtrd 2271	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ (seq𝑀( + , 𝐹)‘𝑘) = (seq𝑀(𝑄, 𝐹)‘𝑘)) → ((seq𝑀( + , 𝐹)‘𝑘) + (𝐹‘(𝑘 + 1))) = ((seq𝑀(𝑄, 𝐹)‘𝑘)𝑄(𝐹‘(𝑘 + 1))))
94	50	ad2antlr 493	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ (seq𝑀( + , 𝐹)‘𝑘) = (seq𝑀(𝑄, 𝐹)‘𝑘)) → 𝑘 ∈ (ℤ≥‘𝑀))
95	26	ad4ant14 518	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ (seq𝑀( + , 𝐹)‘𝑘) = (seq𝑀(𝑄, 𝐹)‘𝑘)) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ V)
96	30	ad4ant14 518	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ (seq𝑀( + , 𝐹)‘𝑘) = (seq𝑀(𝑄, 𝐹)‘𝑘)) ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V)) → (𝑥 + 𝑦) ∈ V)
97	94, 95, 96	seq3p1 10880	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ (seq𝑀( + , 𝐹)‘𝑘) = (seq𝑀(𝑄, 𝐹)‘𝑘)) → (seq𝑀( + , 𝐹)‘(𝑘 + 1)) = ((seq𝑀( + , 𝐹)‘𝑘) + (𝐹‘(𝑘 + 1))))
98	34	ad4ant14 518	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ (seq𝑀( + , 𝐹)‘𝑘) = (seq𝑀(𝑄, 𝐹)‘𝑘)) ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V)) → (𝑥𝑄𝑦) ∈ V)
99	94, 95, 98	seq3p1 10880	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ (seq𝑀( + , 𝐹)‘𝑘) = (seq𝑀(𝑄, 𝐹)‘𝑘)) → (seq𝑀(𝑄, 𝐹)‘(𝑘 + 1)) = ((seq𝑀(𝑄, 𝐹)‘𝑘)𝑄(𝐹‘(𝑘 + 1))))
100	93, 97, 99	3eqtr4d 2281	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) ∧ (seq𝑀( + , 𝐹)‘𝑘) = (seq𝑀(𝑄, 𝐹)‘𝑘)) → (seq𝑀( + , 𝐹)‘(𝑘 + 1)) = (seq𝑀(𝑄, 𝐹)‘(𝑘 + 1)))
101	100	ex 115	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀..^𝑁)) → ((seq𝑀( + , 𝐹)‘𝑘) = (seq𝑀(𝑄, 𝐹)‘𝑘) → (seq𝑀( + , 𝐹)‘(𝑘 + 1)) = (seq𝑀(𝑄, 𝐹)‘(𝑘 + 1))))
102	101	expcom 116	. . . 4 ⊢ (𝑘 ∈ (𝑀..^𝑁) → (𝜑 → ((seq𝑀( + , 𝐹)‘𝑘) = (seq𝑀(𝑄, 𝐹)‘𝑘) → (seq𝑀( + , 𝐹)‘(𝑘 + 1)) = (seq𝑀(𝑄, 𝐹)‘(𝑘 + 1)))))
103	102	a2d 26	. . 3 ⊢ (𝑘 ∈ (𝑀..^𝑁) → ((𝜑 → (seq𝑀( + , 𝐹)‘𝑘) = (seq𝑀(𝑄, 𝐹)‘𝑘)) → (𝜑 → (seq𝑀( + , 𝐹)‘(𝑘 + 1)) = (seq𝑀(𝑄, 𝐹)‘(𝑘 + 1)))))
104	7, 11, 15, 19, 37, 103	fzind2 10636	. 2 ⊢ (𝑁 ∈ (𝑀...𝑁) → (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) = (seq𝑀(𝑄, 𝐹)‘𝑁)))
105	3, 104	mpcom 36	1 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) = (seq𝑀(𝑄, 𝐹)‘𝑁))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  ∀wral 2528  Vcvv 2821   ⊆ wss 3220   class class class wbr 4125  ‘cfv 5372  (class class class)co 6075  1c1 8170   + caddc 8172   ≤ cle 8351  ℤcz 9623  ℤ_≥cuz 9900  ...cfz 10390  ..^cfzo 10527  seqcseq 10862

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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-ltadd 8285

This theorem depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-ilim 4509  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-frec 6652  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-inn 9284  df-n0 9543  df-z 9624  df-uz 9901  df-fz 10391  df-fzo 10528  df-seqfrec 10863

This theorem is referenced by: (None)