Theorem seq3homo 10314

Description: Apply a homomorphism to a sequence. (Contributed by Jim Kingdon, 10-Oct-2022.)

Hypotheses

Ref	Expression
seq3homo.1	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
seq3homo.2	⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ 𝑆)
seq3homo.3	⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀))
seq3homo.4	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝐻‘(𝑥 + 𝑦)) = ((𝐻‘𝑥)𝑄(𝐻‘𝑦)))
seq3homo.5	⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐻‘(𝐹‘𝑥)) = (𝐺‘𝑥))
seq3homo.g	⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑥) ∈ 𝑆)
seq3homo.qcl	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝑄𝑦) ∈ 𝑆)

Assertion

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

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

Proof of Theorem seq3homo

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

Step	Hyp	Ref	Expression
1		seq3homo.3	. 2 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀))
2		2fveq3 5434	. . . . 5 ⊢ (𝑤 = 𝑀 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (𝐻‘(seq𝑀( + , 𝐹)‘𝑀)))
3		fveq2 5429	. . . . 5 ⊢ (𝑤 = 𝑀 → (seq𝑀(𝑄, 𝐺)‘𝑤) = (seq𝑀(𝑄, 𝐺)‘𝑀))
4	2, 3	eqeq12d 2155	. . . 4 ⊢ (𝑤 = 𝑀 → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤) ↔ (𝐻‘(seq𝑀( + , 𝐹)‘𝑀)) = (seq𝑀(𝑄, 𝐺)‘𝑀)))
5	4	imbi2d 229	. . 3 ⊢ (𝑤 = 𝑀 → ((𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤)) ↔ (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑀)) = (seq𝑀(𝑄, 𝐺)‘𝑀))))
6		2fveq3 5434	. . . . 5 ⊢ (𝑤 = 𝑛 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (𝐻‘(seq𝑀( + , 𝐹)‘𝑛)))
7		fveq2 5429	. . . . 5 ⊢ (𝑤 = 𝑛 → (seq𝑀(𝑄, 𝐺)‘𝑤) = (seq𝑀(𝑄, 𝐺)‘𝑛))
8	6, 7	eqeq12d 2155	. . . 4 ⊢ (𝑤 = 𝑛 → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤) ↔ (𝐻‘(seq𝑀( + , 𝐹)‘𝑛)) = (seq𝑀(𝑄, 𝐺)‘𝑛)))
9	8	imbi2d 229	. . 3 ⊢ (𝑤 = 𝑛 → ((𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤)) ↔ (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑛)) = (seq𝑀(𝑄, 𝐺)‘𝑛))))
10		2fveq3 5434	. . . . 5 ⊢ (𝑤 = (𝑛 + 1) → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))))
11		fveq2 5429	. . . . 5 ⊢ (𝑤 = (𝑛 + 1) → (seq𝑀(𝑄, 𝐺)‘𝑤) = (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1)))
12	10, 11	eqeq12d 2155	. . . 4 ⊢ (𝑤 = (𝑛 + 1) → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤) ↔ (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1))))
13	12	imbi2d 229	. . 3 ⊢ (𝑤 = (𝑛 + 1) → ((𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤)) ↔ (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1)))))
14		2fveq3 5434	. . . . 5 ⊢ (𝑤 = 𝑁 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (𝐻‘(seq𝑀( + , 𝐹)‘𝑁)))
15		fveq2 5429	. . . . 5 ⊢ (𝑤 = 𝑁 → (seq𝑀(𝑄, 𝐺)‘𝑤) = (seq𝑀(𝑄, 𝐺)‘𝑁))
16	14, 15	eqeq12d 2155	. . . 4 ⊢ (𝑤 = 𝑁 → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤) ↔ (𝐻‘(seq𝑀( + , 𝐹)‘𝑁)) = (seq𝑀(𝑄, 𝐺)‘𝑁)))
17	16	imbi2d 229	. . 3 ⊢ (𝑤 = 𝑁 → ((𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤)) ↔ (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑁)) = (seq𝑀(𝑄, 𝐺)‘𝑁))))
18		2fveq3 5434	. . . . . . 7 ⊢ (𝑥 = 𝑀 → (𝐻‘(𝐹‘𝑥)) = (𝐻‘(𝐹‘𝑀)))
19		fveq2 5429	. . . . . . 7 ⊢ (𝑥 = 𝑀 → (𝐺‘𝑥) = (𝐺‘𝑀))
20	18, 19	eqeq12d 2155	. . . . . 6 ⊢ (𝑥 = 𝑀 → ((𝐻‘(𝐹‘𝑥)) = (𝐺‘𝑥) ↔ (𝐻‘(𝐹‘𝑀)) = (𝐺‘𝑀)))
21		seq3homo.5	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐻‘(𝐹‘𝑥)) = (𝐺‘𝑥))
22	21	ralrimiva 2508	. . . . . 6 ⊢ (𝜑 → ∀𝑥 ∈ (ℤ≥‘𝑀)(𝐻‘(𝐹‘𝑥)) = (𝐺‘𝑥))
23		eluzel2 9355	. . . . . . . 8 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ)
24	1, 23	syl 14	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℤ)
25		uzid 9364	. . . . . . 7 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀))
26	24, 25	syl 14	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝑀))
27	20, 22, 26	rspcdva 2798	. . . . 5 ⊢ (𝜑 → (𝐻‘(𝐹‘𝑀)) = (𝐺‘𝑀))
28		seq3homo.2	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ 𝑆)
29		seq3homo.1	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
30	24, 28, 29	seq3-1 10264	. . . . . 6 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑀) = (𝐹‘𝑀))
31	30	fveq2d 5433	. . . . 5 ⊢ (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑀)) = (𝐻‘(𝐹‘𝑀)))
32		seq3homo.g	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑥) ∈ 𝑆)
33		seq3homo.qcl	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝑄𝑦) ∈ 𝑆)
34	24, 32, 33	seq3-1 10264	. . . . 5 ⊢ (𝜑 → (seq𝑀(𝑄, 𝐺)‘𝑀) = (𝐺‘𝑀))
35	27, 31, 34	3eqtr4d 2183	. . . 4 ⊢ (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑀)) = (seq𝑀(𝑄, 𝐺)‘𝑀))
36	35	a1i 9	. . 3 ⊢ (𝑀 ∈ ℤ → (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑀)) = (seq𝑀(𝑄, 𝐺)‘𝑀)))
37		oveq1 5789	. . . . . 6 ⊢ ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛)) = (seq𝑀(𝑄, 𝐺)‘𝑛) → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐺‘(𝑛 + 1))) = ((seq𝑀(𝑄, 𝐺)‘𝑛)𝑄(𝐺‘(𝑛 + 1))))
38		simpr 109	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → 𝑛 ∈ (ℤ≥‘𝑀))
39	28	adantlr 469	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ 𝑆)
40	29	adantlr 469	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
41	38, 39, 40	seq3p1 10266	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (seq𝑀( + , 𝐹)‘(𝑛 + 1)) = ((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))))
42	41	fveq2d 5433	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))))
43		seq3homo.4	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝐻‘(𝑥 + 𝑦)) = ((𝐻‘𝑥)𝑄(𝐻‘𝑦)))
44	43	ralrimivva 2517	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝐻‘(𝑥 + 𝑦)) = ((𝐻‘𝑥)𝑄(𝐻‘𝑦)))
45	44	adantr 274	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝐻‘(𝑥 + 𝑦)) = ((𝐻‘𝑥)𝑄(𝐻‘𝑦)))
46		eqid 2140	. . . . . . . . . . . 12 ⊢ (ℤ≥‘𝑀) = (ℤ≥‘𝑀)
47	46, 24, 28, 29	seqf 10265	. . . . . . . . . . 11 ⊢ (𝜑 → seq𝑀( + , 𝐹):(ℤ≥‘𝑀)⟶𝑆)
48	47	ffvelrnda 5563	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (seq𝑀( + , 𝐹)‘𝑛) ∈ 𝑆)
49		fveq2 5429	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝑛 + 1) → (𝐹‘𝑥) = (𝐹‘(𝑛 + 1)))
50	49	eleq1d 2209	. . . . . . . . . . 11 ⊢ (𝑥 = (𝑛 + 1) → ((𝐹‘𝑥) ∈ 𝑆 ↔ (𝐹‘(𝑛 + 1)) ∈ 𝑆))
51	28	ralrimiva 2508	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑥 ∈ (ℤ≥‘𝑀)(𝐹‘𝑥) ∈ 𝑆)
52	51	adantr 274	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ∀𝑥 ∈ (ℤ≥‘𝑀)(𝐹‘𝑥) ∈ 𝑆)
53		peano2uz 9405	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ (ℤ≥‘𝑀) → (𝑛 + 1) ∈ (ℤ≥‘𝑀))
54	38, 53	syl 14	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝑛 + 1) ∈ (ℤ≥‘𝑀))
55	50, 52, 54	rspcdva 2798	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐹‘(𝑛 + 1)) ∈ 𝑆)
56		oveq1 5789	. . . . . . . . . . . . 13 ⊢ (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → (𝑥 + 𝑦) = ((seq𝑀( + , 𝐹)‘𝑛) + 𝑦))
57	56	fveq2d 5433	. . . . . . . . . . . 12 ⊢ (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → (𝐻‘(𝑥 + 𝑦)) = (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + 𝑦)))
58		fveq2 5429	. . . . . . . . . . . . 13 ⊢ (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → (𝐻‘𝑥) = (𝐻‘(seq𝑀( + , 𝐹)‘𝑛)))
59	58	oveq1d 5797	. . . . . . . . . . . 12 ⊢ (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → ((𝐻‘𝑥)𝑄(𝐻‘𝑦)) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘𝑦)))
60	57, 59	eqeq12d 2155	. . . . . . . . . . 11 ⊢ (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → ((𝐻‘(𝑥 + 𝑦)) = ((𝐻‘𝑥)𝑄(𝐻‘𝑦)) ↔ (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + 𝑦)) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘𝑦))))
61		oveq2 5790	. . . . . . . . . . . . 13 ⊢ (𝑦 = (𝐹‘(𝑛 + 1)) → ((seq𝑀( + , 𝐹)‘𝑛) + 𝑦) = ((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))))
62	61	fveq2d 5433	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝐹‘(𝑛 + 1)) → (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + 𝑦)) = (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))))
63		fveq2 5429	. . . . . . . . . . . . 13 ⊢ (𝑦 = (𝐹‘(𝑛 + 1)) → (𝐻‘𝑦) = (𝐻‘(𝐹‘(𝑛 + 1))))
64	63	oveq2d 5798	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝐹‘(𝑛 + 1)) → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘𝑦)) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘(𝐹‘(𝑛 + 1)))))
65	62, 64	eqeq12d 2155	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐹‘(𝑛 + 1)) → ((𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + 𝑦)) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘𝑦)) ↔ (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘(𝐹‘(𝑛 + 1))))))
66	60, 65	rspc2v 2806	. . . . . . . . . 10 ⊢ (((seq𝑀( + , 𝐹)‘𝑛) ∈ 𝑆 ∧ (𝐹‘(𝑛 + 1)) ∈ 𝑆) → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝐻‘(𝑥 + 𝑦)) = ((𝐻‘𝑥)𝑄(𝐻‘𝑦)) → (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘(𝐹‘(𝑛 + 1))))))
67	48, 55, 66	syl2anc 409	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝐻‘(𝑥 + 𝑦)) = ((𝐻‘𝑥)𝑄(𝐻‘𝑦)) → (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘(𝐹‘(𝑛 + 1))))))
68	45, 67	mpd 13	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘(𝐹‘(𝑛 + 1)))))
69		2fveq3 5434	. . . . . . . . . . 11 ⊢ (𝑥 = (𝑛 + 1) → (𝐻‘(𝐹‘𝑥)) = (𝐻‘(𝐹‘(𝑛 + 1))))
70		fveq2 5429	. . . . . . . . . . 11 ⊢ (𝑥 = (𝑛 + 1) → (𝐺‘𝑥) = (𝐺‘(𝑛 + 1)))
71	69, 70	eqeq12d 2155	. . . . . . . . . 10 ⊢ (𝑥 = (𝑛 + 1) → ((𝐻‘(𝐹‘𝑥)) = (𝐺‘𝑥) ↔ (𝐻‘(𝐹‘(𝑛 + 1))) = (𝐺‘(𝑛 + 1))))
72	22	adantr 274	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ∀𝑥 ∈ (ℤ≥‘𝑀)(𝐻‘(𝐹‘𝑥)) = (𝐺‘𝑥))
73	71, 72, 54	rspcdva 2798	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐻‘(𝐹‘(𝑛 + 1))) = (𝐺‘(𝑛 + 1)))
74	73	oveq2d 5798	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘(𝐹‘(𝑛 + 1)))) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐺‘(𝑛 + 1))))
75	42, 68, 74	3eqtrd 2177	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐺‘(𝑛 + 1))))
76	32	adantlr 469	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑥) ∈ 𝑆)
77	33	adantlr 469	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝑄𝑦) ∈ 𝑆)
78	38, 76, 77	seq3p1 10266	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1)) = ((seq𝑀(𝑄, 𝐺)‘𝑛)𝑄(𝐺‘(𝑛 + 1))))
79	75, 78	eqeq12d 2155	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ((𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1)) ↔ ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐺‘(𝑛 + 1))) = ((seq𝑀(𝑄, 𝐺)‘𝑛)𝑄(𝐺‘(𝑛 + 1)))))
80	37, 79	syl5ibr 155	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛)) = (seq𝑀(𝑄, 𝐺)‘𝑛) → (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1))))
81	80	expcom 115	. . . 4 ⊢ (𝑛 ∈ (ℤ≥‘𝑀) → (𝜑 → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛)) = (seq𝑀(𝑄, 𝐺)‘𝑛) → (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1)))))
82	81	a2d 26	. . 3 ⊢ (𝑛 ∈ (ℤ≥‘𝑀) → ((𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑛)) = (seq𝑀(𝑄, 𝐺)‘𝑛)) → (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1)))))
83	5, 9, 13, 17, 36, 82	uzind4 9410	. 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑁)) = (seq𝑀(𝑄, 𝐺)‘𝑁)))
84	1, 83	mpcom 36	1 ⊢ (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑁)) = (seq𝑀(𝑄, 𝐺)‘𝑁))

Syntax hints:   → wi 4   ∧ wa 103   = wceq 1332   ∈ wcel 1481  ∀wral 2417  ‘cfv 5131  (class class class)co 5782  1c1 7645   + caddc 7647  ℤcz 9078  ℤ_≥cuz 9350  seqcseq 10249

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-coll 4051  ax-sep 4054  ax-nul 4062  ax-pow 4106  ax-pr 4139  ax-un 4363  ax-setind 4460  ax-iinf 4510  ax-cnex 7735  ax-resscn 7736  ax-1cn 7737  ax-1re 7738  ax-icn 7739  ax-addcl 7740  ax-addrcl 7741  ax-mulcl 7742  ax-addcom 7744  ax-addass 7746  ax-distr 7748  ax-i2m1 7749  ax-0lt1 7750  ax-0id 7752  ax-rnegex 7753  ax-cnre 7755  ax-pre-ltirr 7756  ax-pre-ltwlin 7757  ax-pre-lttrn 7758  ax-pre-ltadd 7760

This theorem depends on definitions:  df-bi 116  df-3or 964  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-nel 2405  df-ral 2422  df-rex 2423  df-reu 2424  df-rab 2426  df-v 2691  df-sbc 2914  df-csb 3008  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-nul 3369  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-int 3780  df-iun 3823  df-br 3938  df-opab 3998  df-mpt 3999  df-tr 4035  df-id 4223  df-iord 4296  df-on 4298  df-ilim 4299  df-suc 4301  df-iom 4513  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-f1 5136  df-fo 5137  df-f1o 5138  df-fv 5139  df-riota 5738  df-ov 5785  df-oprab 5786  df-mpo 5787  df-1st 6046  df-2nd 6047  df-recs 6210  df-frec 6296  df-pnf 7826  df-mnf 7827  df-xr 7828  df-ltxr 7829  df-le 7830  df-sub 7959  df-neg 7960  df-inn 8745  df-n0 9002  df-z 9079  df-uz 9351  df-seqfrec 10250

This theorem is referenced by:  seqfeq3  10316  seq3distr  10317  efcj  11416