Theorem seqf1olem2a 13689

Description: Lemma for seqf1o 13692. (Contributed by Mario Carneiro, 24-Apr-2016.)

Hypotheses

Ref	Expression
seqf1o.1	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
seqf1o.2	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
seqf1o.3	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
seqf1o.4	⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀))
seqf1o.5	⊢ (𝜑 → 𝐶 ⊆ 𝑆)
seqf1olem2a.1	⊢ (𝜑 → 𝐺:𝐴⟶𝐶)
seqf1olem2a.3	⊢ (𝜑 → 𝐾 ∈ 𝐴)
seqf1olem2a.4	⊢ (𝜑 → (𝑀...𝑁) ⊆ 𝐴)

Assertion

Ref	Expression
seqf1olem2a	⊢ (𝜑 → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑁)) = ((seq𝑀( + , 𝐺)‘𝑁) + (𝐺‘𝐾)))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐺   𝑥,𝑀,𝑦,𝑧   𝑥, + ,𝑦,𝑧   𝑥,𝑁,𝑦,𝑧   𝑥,𝐾,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧

Allowed substitution hints:   𝐴(𝑥,𝑦,𝑧)

Proof of Theorem seqf1olem2a

Dummy variables 𝑚 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		seqf1o.4	. . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀))
2		eluzfz2 13193	. . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ (𝑀...𝑁))
3	1, 2	syl 17	. 2 ⊢ (𝜑 → 𝑁 ∈ (𝑀...𝑁))
4		fveq2 6756	. . . . . 6 ⊢ (𝑚 = 𝑀 → (seq𝑀( + , 𝐺)‘𝑚) = (seq𝑀( + , 𝐺)‘𝑀))
5	4	oveq2d 7271	. . . . 5 ⊢ (𝑚 = 𝑀 → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑚)) = ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑀)))
6	4	oveq1d 7270	. . . . 5 ⊢ (𝑚 = 𝑀 → ((seq𝑀( + , 𝐺)‘𝑚) + (𝐺‘𝐾)) = ((seq𝑀( + , 𝐺)‘𝑀) + (𝐺‘𝐾)))
7	5, 6	eqeq12d 2754	. . . 4 ⊢ (𝑚 = 𝑀 → (((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑚)) = ((seq𝑀( + , 𝐺)‘𝑚) + (𝐺‘𝐾)) ↔ ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑀)) = ((seq𝑀( + , 𝐺)‘𝑀) + (𝐺‘𝐾))))
8	7	imbi2d 340	. . 3 ⊢ (𝑚 = 𝑀 → ((𝜑 → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑚)) = ((seq𝑀( + , 𝐺)‘𝑚) + (𝐺‘𝐾))) ↔ (𝜑 → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑀)) = ((seq𝑀( + , 𝐺)‘𝑀) + (𝐺‘𝐾)))))
9		fveq2 6756	. . . . . 6 ⊢ (𝑚 = 𝑛 → (seq𝑀( + , 𝐺)‘𝑚) = (seq𝑀( + , 𝐺)‘𝑛))
10	9	oveq2d 7271	. . . . 5 ⊢ (𝑚 = 𝑛 → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑚)) = ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑛)))
11	9	oveq1d 7270	. . . . 5 ⊢ (𝑚 = 𝑛 → ((seq𝑀( + , 𝐺)‘𝑚) + (𝐺‘𝐾)) = ((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘𝐾)))
12	10, 11	eqeq12d 2754	. . . 4 ⊢ (𝑚 = 𝑛 → (((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑚)) = ((seq𝑀( + , 𝐺)‘𝑚) + (𝐺‘𝐾)) ↔ ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑛)) = ((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘𝐾))))
13	12	imbi2d 340	. . 3 ⊢ (𝑚 = 𝑛 → ((𝜑 → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑚)) = ((seq𝑀( + , 𝐺)‘𝑚) + (𝐺‘𝐾))) ↔ (𝜑 → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑛)) = ((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘𝐾)))))
14		fveq2 6756	. . . . . 6 ⊢ (𝑚 = (𝑛 + 1) → (seq𝑀( + , 𝐺)‘𝑚) = (seq𝑀( + , 𝐺)‘(𝑛 + 1)))
15	14	oveq2d 7271	. . . . 5 ⊢ (𝑚 = (𝑛 + 1) → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑚)) = ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘(𝑛 + 1))))
16	14	oveq1d 7270	. . . . 5 ⊢ (𝑚 = (𝑛 + 1) → ((seq𝑀( + , 𝐺)‘𝑚) + (𝐺‘𝐾)) = ((seq𝑀( + , 𝐺)‘(𝑛 + 1)) + (𝐺‘𝐾)))
17	15, 16	eqeq12d 2754	. . . 4 ⊢ (𝑚 = (𝑛 + 1) → (((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑚)) = ((seq𝑀( + , 𝐺)‘𝑚) + (𝐺‘𝐾)) ↔ ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘(𝑛 + 1))) = ((seq𝑀( + , 𝐺)‘(𝑛 + 1)) + (𝐺‘𝐾))))
18	17	imbi2d 340	. . 3 ⊢ (𝑚 = (𝑛 + 1) → ((𝜑 → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑚)) = ((seq𝑀( + , 𝐺)‘𝑚) + (𝐺‘𝐾))) ↔ (𝜑 → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘(𝑛 + 1))) = ((seq𝑀( + , 𝐺)‘(𝑛 + 1)) + (𝐺‘𝐾)))))
19		fveq2 6756	. . . . . 6 ⊢ (𝑚 = 𝑁 → (seq𝑀( + , 𝐺)‘𝑚) = (seq𝑀( + , 𝐺)‘𝑁))
20	19	oveq2d 7271	. . . . 5 ⊢ (𝑚 = 𝑁 → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑚)) = ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑁)))
21	19	oveq1d 7270	. . . . 5 ⊢ (𝑚 = 𝑁 → ((seq𝑀( + , 𝐺)‘𝑚) + (𝐺‘𝐾)) = ((seq𝑀( + , 𝐺)‘𝑁) + (𝐺‘𝐾)))
22	20, 21	eqeq12d 2754	. . . 4 ⊢ (𝑚 = 𝑁 → (((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑚)) = ((seq𝑀( + , 𝐺)‘𝑚) + (𝐺‘𝐾)) ↔ ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑁)) = ((seq𝑀( + , 𝐺)‘𝑁) + (𝐺‘𝐾))))
23	22	imbi2d 340	. . 3 ⊢ (𝑚 = 𝑁 → ((𝜑 → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑚)) = ((seq𝑀( + , 𝐺)‘𝑚) + (𝐺‘𝐾))) ↔ (𝜑 → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑁)) = ((seq𝑀( + , 𝐺)‘𝑁) + (𝐺‘𝐾)))))
24		seqf1o.2	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
25		seqf1olem2a.1	. . . . . 6 ⊢ (𝜑 → 𝐺:𝐴⟶𝐶)
26		seqf1olem2a.3	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ 𝐴)
27	25, 26	ffvelrnd 6944	. . . . 5 ⊢ (𝜑 → (𝐺‘𝐾) ∈ 𝐶)
28		eluzel2 12516	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ)
29		seq1 13662	. . . . . . 7 ⊢ (𝑀 ∈ ℤ → (seq𝑀( + , 𝐺)‘𝑀) = (𝐺‘𝑀))
30	1, 28, 29	3syl 18	. . . . . 6 ⊢ (𝜑 → (seq𝑀( + , 𝐺)‘𝑀) = (𝐺‘𝑀))
31		seqf1olem2a.4	. . . . . . . 8 ⊢ (𝜑 → (𝑀...𝑁) ⊆ 𝐴)
32		eluzfz1 13192	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ (𝑀...𝑁))
33	1, 32	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑀 ∈ (𝑀...𝑁))
34	31, 33	sseldd 3918	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ 𝐴)
35	25, 34	ffvelrnd 6944	. . . . . 6 ⊢ (𝜑 → (𝐺‘𝑀) ∈ 𝐶)
36	30, 35	eqeltrd 2839	. . . . 5 ⊢ (𝜑 → (seq𝑀( + , 𝐺)‘𝑀) ∈ 𝐶)
37	24, 27, 36	caovcomd 7446	. . . 4 ⊢ (𝜑 → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑀)) = ((seq𝑀( + , 𝐺)‘𝑀) + (𝐺‘𝐾)))
38	37	a1i 11	. . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝜑 → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑀)) = ((seq𝑀( + , 𝐺)‘𝑀) + (𝐺‘𝐾))))
39		oveq1 7262	. . . . . 6 ⊢ (((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑛)) = ((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘𝐾)) → (((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑛)) + (𝐺‘(𝑛 + 1))) = (((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘𝐾)) + (𝐺‘(𝑛 + 1))))
40		elfzouz 13320	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (𝑀..^𝑁) → 𝑛 ∈ (ℤ≥‘𝑀))
41	40	adantl 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → 𝑛 ∈ (ℤ≥‘𝑀))
42		seqp1 13664	. . . . . . . . . 10 ⊢ (𝑛 ∈ (ℤ≥‘𝑀) → (seq𝑀( + , 𝐺)‘(𝑛 + 1)) = ((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘(𝑛 + 1))))
43	41, 42	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → (seq𝑀( + , 𝐺)‘(𝑛 + 1)) = ((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘(𝑛 + 1))))
44	43	oveq2d 7271	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘(𝑛 + 1))) = ((𝐺‘𝐾) + ((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘(𝑛 + 1)))))
45		seqf1o.3	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
46	45	adantlr 711	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
47		seqf1o.5	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐶 ⊆ 𝑆)
48	47, 27	sseldd 3918	. . . . . . . . . 10 ⊢ (𝜑 → (𝐺‘𝐾) ∈ 𝑆)
49	48	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → (𝐺‘𝐾) ∈ 𝑆)
50	47	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → 𝐶 ⊆ 𝑆)
51	50	adantr 480	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (𝑀...𝑛)) → 𝐶 ⊆ 𝑆)
52	25	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → 𝐺:𝐴⟶𝐶)
53	52	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (𝑀...𝑛)) → 𝐺:𝐴⟶𝐶)
54		elfzouz2 13330	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ (𝑀..^𝑁) → 𝑁 ∈ (ℤ≥‘𝑛))
55	54	adantl 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → 𝑁 ∈ (ℤ≥‘𝑛))
56		fzss2 13225	. . . . . . . . . . . . . . 15 ⊢ (𝑁 ∈ (ℤ≥‘𝑛) → (𝑀...𝑛) ⊆ (𝑀...𝑁))
57	55, 56	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → (𝑀...𝑛) ⊆ (𝑀...𝑁))
58	31	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → (𝑀...𝑁) ⊆ 𝐴)
59	57, 58	sstrd 3927	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → (𝑀...𝑛) ⊆ 𝐴)
60	59	sselda 3917	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (𝑀...𝑛)) → 𝑥 ∈ 𝐴)
61	53, 60	ffvelrnd 6944	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (𝑀...𝑛)) → (𝐺‘𝑥) ∈ 𝐶)
62	51, 61	sseldd 3918	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (𝑀...𝑛)) → (𝐺‘𝑥) ∈ 𝑆)
63		seqf1o.1	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
64	63	adantlr 711	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
65	41, 62, 64	seqcl 13671	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → (seq𝑀( + , 𝐺)‘𝑛) ∈ 𝑆)
66		fzofzp1 13412	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ (𝑀..^𝑁) → (𝑛 + 1) ∈ (𝑀...𝑁))
67	66	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → (𝑛 + 1) ∈ (𝑀...𝑁))
68	58, 67	sseldd 3918	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → (𝑛 + 1) ∈ 𝐴)
69	52, 68	ffvelrnd 6944	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → (𝐺‘(𝑛 + 1)) ∈ 𝐶)
70	50, 69	sseldd 3918	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → (𝐺‘(𝑛 + 1)) ∈ 𝑆)
71	46, 49, 65, 70	caovassd 7449	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → (((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑛)) + (𝐺‘(𝑛 + 1))) = ((𝐺‘𝐾) + ((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘(𝑛 + 1)))))
72	44, 71	eqtr4d 2781	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘(𝑛 + 1))) = (((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑛)) + (𝐺‘(𝑛 + 1))))
73	46, 65, 70, 49	caovassd 7449	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → (((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘(𝑛 + 1))) + (𝐺‘𝐾)) = ((seq𝑀( + , 𝐺)‘𝑛) + ((𝐺‘(𝑛 + 1)) + (𝐺‘𝐾))))
74	43	oveq1d 7270	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → ((seq𝑀( + , 𝐺)‘(𝑛 + 1)) + (𝐺‘𝐾)) = (((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘(𝑛 + 1))) + (𝐺‘𝐾)))
75	46, 65, 49, 70	caovassd 7449	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → (((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘𝐾)) + (𝐺‘(𝑛 + 1))) = ((seq𝑀( + , 𝐺)‘𝑛) + ((𝐺‘𝐾) + (𝐺‘(𝑛 + 1)))))
76	24	adantlr 711	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
77	27	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → (𝐺‘𝐾) ∈ 𝐶)
78	76, 69, 77	caovcomd 7446	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → ((𝐺‘(𝑛 + 1)) + (𝐺‘𝐾)) = ((𝐺‘𝐾) + (𝐺‘(𝑛 + 1))))
79	78	oveq2d 7271	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → ((seq𝑀( + , 𝐺)‘𝑛) + ((𝐺‘(𝑛 + 1)) + (𝐺‘𝐾))) = ((seq𝑀( + , 𝐺)‘𝑛) + ((𝐺‘𝐾) + (𝐺‘(𝑛 + 1)))))
80	75, 79	eqtr4d 2781	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → (((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘𝐾)) + (𝐺‘(𝑛 + 1))) = ((seq𝑀( + , 𝐺)‘𝑛) + ((𝐺‘(𝑛 + 1)) + (𝐺‘𝐾))))
81	73, 74, 80	3eqtr4d 2788	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → ((seq𝑀( + , 𝐺)‘(𝑛 + 1)) + (𝐺‘𝐾)) = (((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘𝐾)) + (𝐺‘(𝑛 + 1))))
82	72, 81	eqeq12d 2754	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → (((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘(𝑛 + 1))) = ((seq𝑀( + , 𝐺)‘(𝑛 + 1)) + (𝐺‘𝐾)) ↔ (((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑛)) + (𝐺‘(𝑛 + 1))) = (((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘𝐾)) + (𝐺‘(𝑛 + 1)))))
83	39, 82	syl5ibr 245	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀..^𝑁)) → (((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑛)) = ((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘𝐾)) → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘(𝑛 + 1))) = ((seq𝑀( + , 𝐺)‘(𝑛 + 1)) + (𝐺‘𝐾))))
84	83	expcom 413	. . . 4 ⊢ (𝑛 ∈ (𝑀..^𝑁) → (𝜑 → (((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑛)) = ((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘𝐾)) → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘(𝑛 + 1))) = ((seq𝑀( + , 𝐺)‘(𝑛 + 1)) + (𝐺‘𝐾)))))
85	84	a2d 29	. . 3 ⊢ (𝑛 ∈ (𝑀..^𝑁) → ((𝜑 → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑛)) = ((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘𝐾))) → (𝜑 → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘(𝑛 + 1))) = ((seq𝑀( + , 𝐺)‘(𝑛 + 1)) + (𝐺‘𝐾)))))
86	8, 13, 18, 23, 38, 85	fzind2 13433	. 2 ⊢ (𝑁 ∈ (𝑀...𝑁) → (𝜑 → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑁)) = ((seq𝑀( + , 𝐺)‘𝑁) + (𝐺‘𝐾))))
87	3, 86	mpcom 38	1 ⊢ (𝜑 → ((𝐺‘𝐾) + (seq𝑀( + , 𝐺)‘𝑁)) = ((seq𝑀( + , 𝐺)‘𝑁) + (𝐺‘𝐾)))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108   ⊆ wss 3883  ⟶wf 6414  ‘cfv 6418  (class class class)co 7255  1c1 10803   + caddc 10805  ℤcz 12249  ℤ_≥cuz 12511  ...cfz 13168  ..^cfzo 13311  seqcseq 13649

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-cnex 10858  ax-resscn 10859  ax-1cn 10860  ax-icn 10861  ax-addcl 10862  ax-addrcl 10863  ax-mulcl 10864  ax-mulrcl 10865  ax-mulcom 10866  ax-addass 10867  ax-mulass 10868  ax-distr 10869  ax-i2m1 10870  ax-1ne0 10871  ax-1rid 10872  ax-rnegex 10873  ax-rrecex 10874  ax-cnre 10875  ax-pre-lttri 10876  ax-pre-lttrn 10877  ax-pre-ltadd 10878  ax-pre-mulgt0 10879

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-nel 3049  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-1st 7804  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-er 8456  df-en 8692  df-dom 8693  df-sdom 8694  df-pnf 10942  df-mnf 10943  df-xr 10944  df-ltxr 10945  df-le 10946  df-sub 11137  df-neg 11138  df-nn 11904  df-n0 12164  df-z 12250  df-uz 12512  df-fz 13169  df-fzo 13312  df-seq 13650

This theorem is referenced by:  seqf1olem2  13691