Theorem seq3homo 10744

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 5631	. . . . 5 ⊢ (𝑤 = 𝑀 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (𝐻‘(seq𝑀( + , 𝐹)‘𝑀)))
3		fveq2 5626	. . . . 5 ⊢ (𝑤 = 𝑀 → (seq𝑀(𝑄, 𝐺)‘𝑤) = (seq𝑀(𝑄, 𝐺)‘𝑀))
4	2, 3	eqeq12d 2244	. . . 4 ⊢ (𝑤 = 𝑀 → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤) ↔ (𝐻‘(seq𝑀( + , 𝐹)‘𝑀)) = (seq𝑀(𝑄, 𝐺)‘𝑀)))
5	4	imbi2d 230	. . 3 ⊢ (𝑤 = 𝑀 → ((𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤)) ↔ (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑀)) = (seq𝑀(𝑄, 𝐺)‘𝑀))))
6		2fveq3 5631	. . . . 5 ⊢ (𝑤 = 𝑛 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (𝐻‘(seq𝑀( + , 𝐹)‘𝑛)))
7		fveq2 5626	. . . . 5 ⊢ (𝑤 = 𝑛 → (seq𝑀(𝑄, 𝐺)‘𝑤) = (seq𝑀(𝑄, 𝐺)‘𝑛))
8	6, 7	eqeq12d 2244	. . . 4 ⊢ (𝑤 = 𝑛 → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤) ↔ (𝐻‘(seq𝑀( + , 𝐹)‘𝑛)) = (seq𝑀(𝑄, 𝐺)‘𝑛)))
9	8	imbi2d 230	. . 3 ⊢ (𝑤 = 𝑛 → ((𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤)) ↔ (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑛)) = (seq𝑀(𝑄, 𝐺)‘𝑛))))
10		2fveq3 5631	. . . . 5 ⊢ (𝑤 = (𝑛 + 1) → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))))
11		fveq2 5626	. . . . 5 ⊢ (𝑤 = (𝑛 + 1) → (seq𝑀(𝑄, 𝐺)‘𝑤) = (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1)))
12	10, 11	eqeq12d 2244	. . . 4 ⊢ (𝑤 = (𝑛 + 1) → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤) ↔ (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1))))
13	12	imbi2d 230	. . 3 ⊢ (𝑤 = (𝑛 + 1) → ((𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤)) ↔ (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1)))))
14		2fveq3 5631	. . . . 5 ⊢ (𝑤 = 𝑁 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (𝐻‘(seq𝑀( + , 𝐹)‘𝑁)))
15		fveq2 5626	. . . . 5 ⊢ (𝑤 = 𝑁 → (seq𝑀(𝑄, 𝐺)‘𝑤) = (seq𝑀(𝑄, 𝐺)‘𝑁))
16	14, 15	eqeq12d 2244	. . . 4 ⊢ (𝑤 = 𝑁 → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤) ↔ (𝐻‘(seq𝑀( + , 𝐹)‘𝑁)) = (seq𝑀(𝑄, 𝐺)‘𝑁)))
17	16	imbi2d 230	. . 3 ⊢ (𝑤 = 𝑁 → ((𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤)) ↔ (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑁)) = (seq𝑀(𝑄, 𝐺)‘𝑁))))
18		2fveq3 5631	. . . . . . 7 ⊢ (𝑥 = 𝑀 → (𝐻‘(𝐹‘𝑥)) = (𝐻‘(𝐹‘𝑀)))
19		fveq2 5626	. . . . . . 7 ⊢ (𝑥 = 𝑀 → (𝐺‘𝑥) = (𝐺‘𝑀))
20	18, 19	eqeq12d 2244	. . . . . 6 ⊢ (𝑥 = 𝑀 → ((𝐻‘(𝐹‘𝑥)) = (𝐺‘𝑥) ↔ (𝐻‘(𝐹‘𝑀)) = (𝐺‘𝑀)))
21		seq3homo.5	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐻‘(𝐹‘𝑥)) = (𝐺‘𝑥))
22	21	ralrimiva 2603	. . . . . 6 ⊢ (𝜑 → ∀𝑥 ∈ (ℤ≥‘𝑀)(𝐻‘(𝐹‘𝑥)) = (𝐺‘𝑥))
23		eluzel2 9723	. . . . . . . 8 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ)
24	1, 23	syl 14	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℤ)
25		uzid 9732	. . . . . . 7 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀))
26	24, 25	syl 14	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝑀))
27	20, 22, 26	rspcdva 2912	. . . . 5 ⊢ (𝜑 → (𝐻‘(𝐹‘𝑀)) = (𝐺‘𝑀))
28		seq3homo.2	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ 𝑆)
29		seq3homo.1	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
30	24, 28, 29	seq3-1 10679	. . . . . 6 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑀) = (𝐹‘𝑀))
31	30	fveq2d 5630	. . . . 5 ⊢ (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑀)) = (𝐻‘(𝐹‘𝑀)))
32		seq3homo.g	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑥) ∈ 𝑆)
33		seq3homo.qcl	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝑄𝑦) ∈ 𝑆)
34	24, 32, 33	seq3-1 10679	. . . . 5 ⊢ (𝜑 → (seq𝑀(𝑄, 𝐺)‘𝑀) = (𝐺‘𝑀))
35	27, 31, 34	3eqtr4d 2272	. . . 4 ⊢ (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑀)) = (seq𝑀(𝑄, 𝐺)‘𝑀))
36	35	a1i 9	. . 3 ⊢ (𝑀 ∈ ℤ → (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑀)) = (seq𝑀(𝑄, 𝐺)‘𝑀)))
37		oveq1 6007	. . . . . 6 ⊢ ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛)) = (seq𝑀(𝑄, 𝐺)‘𝑛) → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐺‘(𝑛 + 1))) = ((seq𝑀(𝑄, 𝐺)‘𝑛)𝑄(𝐺‘(𝑛 + 1))))
38		simpr 110	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → 𝑛 ∈ (ℤ≥‘𝑀))
39	28	adantlr 477	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ 𝑆)
40	29	adantlr 477	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
41	38, 39, 40	seq3p1 10682	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (seq𝑀( + , 𝐹)‘(𝑛 + 1)) = ((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))))
42	41	fveq2d 5630	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))))
43		seq3homo.4	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝐻‘(𝑥 + 𝑦)) = ((𝐻‘𝑥)𝑄(𝐻‘𝑦)))
44	43	ralrimivva 2612	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝐻‘(𝑥 + 𝑦)) = ((𝐻‘𝑥)𝑄(𝐻‘𝑦)))
45	44	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝐻‘(𝑥 + 𝑦)) = ((𝐻‘𝑥)𝑄(𝐻‘𝑦)))
46		eqid 2229	. . . . . . . . . . . 12 ⊢ (ℤ≥‘𝑀) = (ℤ≥‘𝑀)
47	46, 24, 28, 29	seqf 10681	. . . . . . . . . . 11 ⊢ (𝜑 → seq𝑀( + , 𝐹):(ℤ≥‘𝑀)⟶𝑆)
48	47	ffvelcdmda 5769	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (seq𝑀( + , 𝐹)‘𝑛) ∈ 𝑆)
49		fveq2 5626	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝑛 + 1) → (𝐹‘𝑥) = (𝐹‘(𝑛 + 1)))
50	49	eleq1d 2298	. . . . . . . . . . 11 ⊢ (𝑥 = (𝑛 + 1) → ((𝐹‘𝑥) ∈ 𝑆 ↔ (𝐹‘(𝑛 + 1)) ∈ 𝑆))
51	28	ralrimiva 2603	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑥 ∈ (ℤ≥‘𝑀)(𝐹‘𝑥) ∈ 𝑆)
52	51	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ∀𝑥 ∈ (ℤ≥‘𝑀)(𝐹‘𝑥) ∈ 𝑆)
53		peano2uz 9774	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ (ℤ≥‘𝑀) → (𝑛 + 1) ∈ (ℤ≥‘𝑀))
54	38, 53	syl 14	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝑛 + 1) ∈ (ℤ≥‘𝑀))
55	50, 52, 54	rspcdva 2912	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐹‘(𝑛 + 1)) ∈ 𝑆)
56		oveq1 6007	. . . . . . . . . . . . 13 ⊢ (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → (𝑥 + 𝑦) = ((seq𝑀( + , 𝐹)‘𝑛) + 𝑦))
57	56	fveq2d 5630	. . . . . . . . . . . 12 ⊢ (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → (𝐻‘(𝑥 + 𝑦)) = (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + 𝑦)))
58		fveq2 5626	. . . . . . . . . . . . 13 ⊢ (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → (𝐻‘𝑥) = (𝐻‘(seq𝑀( + , 𝐹)‘𝑛)))
59	58	oveq1d 6015	. . . . . . . . . . . 12 ⊢ (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → ((𝐻‘𝑥)𝑄(𝐻‘𝑦)) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘𝑦)))
60	57, 59	eqeq12d 2244	. . . . . . . . . . 11 ⊢ (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → ((𝐻‘(𝑥 + 𝑦)) = ((𝐻‘𝑥)𝑄(𝐻‘𝑦)) ↔ (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + 𝑦)) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘𝑦))))
61		oveq2 6008	. . . . . . . . . . . . 13 ⊢ (𝑦 = (𝐹‘(𝑛 + 1)) → ((seq𝑀( + , 𝐹)‘𝑛) + 𝑦) = ((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))))
62	61	fveq2d 5630	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝐹‘(𝑛 + 1)) → (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + 𝑦)) = (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))))
63		fveq2 5626	. . . . . . . . . . . . 13 ⊢ (𝑦 = (𝐹‘(𝑛 + 1)) → (𝐻‘𝑦) = (𝐻‘(𝐹‘(𝑛 + 1))))
64	63	oveq2d 6016	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝐹‘(𝑛 + 1)) → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘𝑦)) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘(𝐹‘(𝑛 + 1)))))
65	62, 64	eqeq12d 2244	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐹‘(𝑛 + 1)) → ((𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + 𝑦)) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘𝑦)) ↔ (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘(𝐹‘(𝑛 + 1))))))
66	60, 65	rspc2v 2920	. . . . . . . . . 10 ⊢ (((seq𝑀( + , 𝐹)‘𝑛) ∈ 𝑆 ∧ (𝐹‘(𝑛 + 1)) ∈ 𝑆) → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝐻‘(𝑥 + 𝑦)) = ((𝐻‘𝑥)𝑄(𝐻‘𝑦)) → (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘(𝐹‘(𝑛 + 1))))))
67	48, 55, 66	syl2anc 411	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝐻‘(𝑥 + 𝑦)) = ((𝐻‘𝑥)𝑄(𝐻‘𝑦)) → (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘(𝐹‘(𝑛 + 1))))))
68	45, 67	mpd 13	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘(𝐹‘(𝑛 + 1)))))
69		2fveq3 5631	. . . . . . . . . . 11 ⊢ (𝑥 = (𝑛 + 1) → (𝐻‘(𝐹‘𝑥)) = (𝐻‘(𝐹‘(𝑛 + 1))))
70		fveq2 5626	. . . . . . . . . . 11 ⊢ (𝑥 = (𝑛 + 1) → (𝐺‘𝑥) = (𝐺‘(𝑛 + 1)))
71	69, 70	eqeq12d 2244	. . . . . . . . . 10 ⊢ (𝑥 = (𝑛 + 1) → ((𝐻‘(𝐹‘𝑥)) = (𝐺‘𝑥) ↔ (𝐻‘(𝐹‘(𝑛 + 1))) = (𝐺‘(𝑛 + 1))))
72	22	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ∀𝑥 ∈ (ℤ≥‘𝑀)(𝐻‘(𝐹‘𝑥)) = (𝐺‘𝑥))
73	71, 72, 54	rspcdva 2912	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐻‘(𝐹‘(𝑛 + 1))) = (𝐺‘(𝑛 + 1)))
74	73	oveq2d 6016	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘(𝐹‘(𝑛 + 1)))) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐺‘(𝑛 + 1))))
75	42, 68, 74	3eqtrd 2266	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐺‘(𝑛 + 1))))
76	32	adantlr 477	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑥) ∈ 𝑆)
77	33	adantlr 477	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝑄𝑦) ∈ 𝑆)
78	38, 76, 77	seq3p1 10682	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1)) = ((seq𝑀(𝑄, 𝐺)‘𝑛)𝑄(𝐺‘(𝑛 + 1))))
79	75, 78	eqeq12d 2244	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ((𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1)) ↔ ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐺‘(𝑛 + 1))) = ((seq𝑀(𝑄, 𝐺)‘𝑛)𝑄(𝐺‘(𝑛 + 1)))))
80	37, 79	imbitrrid 156	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛)) = (seq𝑀(𝑄, 𝐺)‘𝑛) → (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1))))
81	80	expcom 116	. . . 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 9779	. 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑁)) = (seq𝑀(𝑄, 𝐺)‘𝑁)))
84	1, 83	mpcom 36	1 ⊢ (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑁)) = (seq𝑀(𝑄, 𝐺)‘𝑁))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1395   ∈ wcel 2200  ∀wral 2508  ‘cfv 5317  (class class class)co 6000  1c1 7996   + caddc 7998  ℤcz 9442  ℤ_≥cuz 9718  seqcseq 10664

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 4198  ax-sep 4201  ax-nul 4209  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-iinf 4679  ax-cnex 8086  ax-resscn 8087  ax-1cn 8088  ax-1re 8089  ax-icn 8090  ax-addcl 8091  ax-addrcl 8092  ax-mulcl 8093  ax-addcom 8095  ax-addass 8097  ax-distr 8099  ax-i2m1 8100  ax-0lt1 8101  ax-0id 8103  ax-rnegex 8104  ax-cnre 8106  ax-pre-ltirr 8107  ax-pre-ltwlin 8108  ax-pre-lttrn 8109  ax-pre-ltadd 8111

This theorem depends on definitions:  df-bi 117  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-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-tr 4182  df-id 4383  df-iord 4456  df-on 4458  df-ilim 4459  df-suc 4461  df-iom 4682  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-recs 6449  df-frec 6535  df-pnf 8179  df-mnf 8180  df-xr 8181  df-ltxr 8182  df-le 8183  df-sub 8315  df-neg 8316  df-inn 9107  df-n0 9366  df-z 9443  df-uz 9719  df-seqfrec 10665

This theorem is referenced by:  seqfeq3  10746  seq3distr  10749  efcj  12179