Theorem seq3f1oleml 10683

Description: Lemma for seq3f1o 10684. This is more or less the result, but stated in terms of 𝐹 and 𝐺 without 𝐻. 𝐿 and 𝐻 may differ in terms of what happens to terms after 𝑁. The terms after 𝑁 don't matter for the value at 𝑁 but we need some definition given the way our theorems concerning seq work. (Contributed by Jim Kingdon, 17-Aug-2022.)

Hypotheses

Ref	Expression
iseqf1o.1	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
iseqf1o.2	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
iseqf1o.3	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
iseqf1o.4	⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀))
iseqf1o.6	⊢ (𝜑 → 𝐹:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
iseqf1o.7	⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑥) ∈ 𝑆)
iseqf1o.l	⊢ 𝐿 = (𝑥 ∈ (ℤ≥‘𝑀) ↦ if(𝑥 ≤ 𝑁, (𝐺‘(𝐹‘𝑥)), (𝐺‘𝑀)))

Assertion

Ref	Expression
seq3f1oleml	⊢ (𝜑 → (seq𝑀( + , 𝐿)‘𝑁) = (seq𝑀( + , 𝐺)‘𝑁))

Distinct variable groups:   𝑥, + ,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥,𝐺,𝑦,𝑧   𝑥,𝐿,𝑦,𝑧   𝑥,𝑀,𝑦,𝑧   𝑥,𝑁,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧

Proof of Theorem seq3f1oleml

Dummy variables 𝑓 𝑘 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		iseqf1o.1	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
2		iseqf1o.2	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
3		iseqf1o.3	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
4		iseqf1o.4	. . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀))
5		iseqf1o.6	. . 3 ⊢ (𝜑 → 𝐹:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
6		iseqf1o.7	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑥) ∈ 𝑆)
7		iseqf1o.l	. . 3 ⊢ 𝐿 = (𝑥 ∈ (ℤ≥‘𝑀) ↦ if(𝑥 ≤ 𝑁, (𝐺‘(𝐹‘𝑥)), (𝐺‘𝑀)))
8		breq1 4054	. . . . 5 ⊢ (𝑎 = 𝑥 → (𝑎 ≤ 𝑁 ↔ 𝑥 ≤ 𝑁))
9		2fveq3 5594	. . . . 5 ⊢ (𝑎 = 𝑥 → (𝐺‘(𝑓‘𝑎)) = (𝐺‘(𝑓‘𝑥)))
10	8, 9	ifbieq1d 3598	. . . 4 ⊢ (𝑎 = 𝑥 → if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀)) = if(𝑥 ≤ 𝑁, (𝐺‘(𝑓‘𝑥)), (𝐺‘𝑀)))
11	10	cbvmptv 4148	. . 3 ⊢ (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))) = (𝑥 ∈ (ℤ≥‘𝑀) ↦ if(𝑥 ≤ 𝑁, (𝐺‘(𝑓‘𝑥)), (𝐺‘𝑀)))
12	1, 2, 3, 4, 5, 6, 7, 11	seq3f1olemp 10682	. 2 ⊢ (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑁)(𝑓‘𝑥) = 𝑥 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
13		fveq2 5589	. . . . . 6 ⊢ (𝑏 = 𝑥 → (𝑓‘𝑏) = (𝑓‘𝑥))
14		id 19	. . . . . 6 ⊢ (𝑏 = 𝑥 → 𝑏 = 𝑥)
15	13, 14	eqeq12d 2221	. . . . 5 ⊢ (𝑏 = 𝑥 → ((𝑓‘𝑏) = 𝑏 ↔ (𝑓‘𝑥) = 𝑥))
16	15	cbvralv 2739	. . . 4 ⊢ (∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ↔ ∀𝑥 ∈ (𝑀...𝑁)(𝑓‘𝑥) = 𝑥)
17	16	3anbi2i 1194	. . 3 ⊢ ((𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑁)(𝑓‘𝑥) = 𝑥 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
18		simpr3 1008	. . . 4 ⊢ ((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
19	4	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → 𝑁 ∈ (ℤ≥‘𝑀))
20		elfzuz 10163	. . . . . . . 8 ⊢ (𝑘 ∈ (𝑀...𝑁) → 𝑘 ∈ (ℤ≥‘𝑀))
21	20	adantl 277	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝑘 ∈ (ℤ≥‘𝑀))
22		elfzle2 10170	. . . . . . . . . 10 ⊢ (𝑘 ∈ (𝑀...𝑁) → 𝑘 ≤ 𝑁)
23	22	adantl 277	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝑘 ≤ 𝑁)
24	23	iftrued 3582	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑘 ∈ (𝑀...𝑁)) → if(𝑘 ≤ 𝑁, (𝐺‘(𝑓‘𝑘)), (𝐺‘𝑀)) = (𝐺‘(𝑓‘𝑘)))
25		fveq2 5589	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝑘 → (𝑓‘𝑏) = (𝑓‘𝑘))
26		id 19	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝑘 → 𝑏 = 𝑘)
27	25, 26	eqeq12d 2221	. . . . . . . . . . 11 ⊢ (𝑏 = 𝑘 → ((𝑓‘𝑏) = 𝑏 ↔ (𝑓‘𝑘) = 𝑘))
28		simplr2 1043	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑘 ∈ (𝑀...𝑁)) → ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏)
29		simpr 110	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝑘 ∈ (𝑀...𝑁))
30	27, 28, 29	rspcdva 2886	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝑓‘𝑘) = 𝑘)
31	30	fveq2d 5593	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐺‘(𝑓‘𝑘)) = (𝐺‘𝑘))
32		fveq2 5589	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑘 → (𝐺‘𝑥) = (𝐺‘𝑘))
33	32	eleq1d 2275	. . . . . . . . . 10 ⊢ (𝑥 = 𝑘 → ((𝐺‘𝑥) ∈ 𝑆 ↔ (𝐺‘𝑘) ∈ 𝑆))
34	6	ralrimiva 2580	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑥 ∈ (ℤ≥‘𝑀)(𝐺‘𝑥) ∈ 𝑆)
35	34	ad2antrr 488	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑘 ∈ (𝑀...𝑁)) → ∀𝑥 ∈ (ℤ≥‘𝑀)(𝐺‘𝑥) ∈ 𝑆)
36	33, 35, 21	rspcdva 2886	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐺‘𝑘) ∈ 𝑆)
37	31, 36	eqeltrd 2283	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐺‘(𝑓‘𝑘)) ∈ 𝑆)
38	24, 37	eqeltrd 2283	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑘 ∈ (𝑀...𝑁)) → if(𝑘 ≤ 𝑁, (𝐺‘(𝑓‘𝑘)), (𝐺‘𝑀)) ∈ 𝑆)
39		breq1 4054	. . . . . . . . 9 ⊢ (𝑎 = 𝑘 → (𝑎 ≤ 𝑁 ↔ 𝑘 ≤ 𝑁))
40		2fveq3 5594	. . . . . . . . 9 ⊢ (𝑎 = 𝑘 → (𝐺‘(𝑓‘𝑎)) = (𝐺‘(𝑓‘𝑘)))
41	39, 40	ifbieq1d 3598	. . . . . . . 8 ⊢ (𝑎 = 𝑘 → if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀)) = if(𝑘 ≤ 𝑁, (𝐺‘(𝑓‘𝑘)), (𝐺‘𝑀)))
42		eqid 2206	. . . . . . . 8 ⊢ (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))) = (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀)))
43	41, 42	fvmptg 5668	. . . . . . 7 ⊢ ((𝑘 ∈ (ℤ≥‘𝑀) ∧ if(𝑘 ≤ 𝑁, (𝐺‘(𝑓‘𝑘)), (𝐺‘𝑀)) ∈ 𝑆) → ((𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀)))‘𝑘) = if(𝑘 ≤ 𝑁, (𝐺‘(𝑓‘𝑘)), (𝐺‘𝑀)))
44	21, 38, 43	syl2anc 411	. . . . . 6 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑘 ∈ (𝑀...𝑁)) → ((𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀)))‘𝑘) = if(𝑘 ≤ 𝑁, (𝐺‘(𝑓‘𝑘)), (𝐺‘𝑀)))
45	44, 24, 31	3eqtrd 2243	. . . . 5 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑘 ∈ (𝑀...𝑁)) → ((𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀)))‘𝑘) = (𝐺‘𝑘))
46		simpr 110	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → 𝑥 ∈ (ℤ≥‘𝑀))
47		fveq2 5589	. . . . . . . . . 10 ⊢ (𝑎 = (𝑓‘𝑥) → (𝐺‘𝑎) = (𝐺‘(𝑓‘𝑥)))
48	47	eleq1d 2275	. . . . . . . . 9 ⊢ (𝑎 = (𝑓‘𝑥) → ((𝐺‘𝑎) ∈ 𝑆 ↔ (𝐺‘(𝑓‘𝑥)) ∈ 𝑆))
49	34	ad3antrrr 492	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) ∧ 𝑥 ≤ 𝑁) → ∀𝑥 ∈ (ℤ≥‘𝑀)(𝐺‘𝑥) ∈ 𝑆)
50		fveq2 5589	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑥 → (𝐺‘𝑎) = (𝐺‘𝑥))
51	50	eleq1d 2275	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑥 → ((𝐺‘𝑎) ∈ 𝑆 ↔ (𝐺‘𝑥) ∈ 𝑆))
52	51	cbvralv 2739	. . . . . . . . . 10 ⊢ (∀𝑎 ∈ (ℤ≥‘𝑀)(𝐺‘𝑎) ∈ 𝑆 ↔ ∀𝑥 ∈ (ℤ≥‘𝑀)(𝐺‘𝑥) ∈ 𝑆)
53	49, 52	sylibr 134	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) ∧ 𝑥 ≤ 𝑁) → ∀𝑎 ∈ (ℤ≥‘𝑀)(𝐺‘𝑎) ∈ 𝑆)
54		simpr1 1006	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → 𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
55	54	ad2antrr 488	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) ∧ 𝑥 ≤ 𝑁) → 𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
56		f1of 5534	. . . . . . . . . . . 12 ⊢ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) → 𝑓:(𝑀...𝑁)⟶(𝑀...𝑁))
57	55, 56	syl 14	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) ∧ 𝑥 ≤ 𝑁) → 𝑓:(𝑀...𝑁)⟶(𝑀...𝑁))
58		simpr 110	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) ∧ 𝑥 ≤ 𝑁) → 𝑥 ≤ 𝑁)
59	46	adantr 276	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) ∧ 𝑥 ≤ 𝑁) → 𝑥 ∈ (ℤ≥‘𝑀))
60		eluzelz 9677	. . . . . . . . . . . . . . 15 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ)
61	4, 60	syl 14	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑁 ∈ ℤ)
62	61	ad3antrrr 492	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) ∧ 𝑥 ≤ 𝑁) → 𝑁 ∈ ℤ)
63		elfz5 10159	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ (ℤ≥‘𝑀) ∧ 𝑁 ∈ ℤ) → (𝑥 ∈ (𝑀...𝑁) ↔ 𝑥 ≤ 𝑁))
64	59, 62, 63	syl2anc 411	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) ∧ 𝑥 ≤ 𝑁) → (𝑥 ∈ (𝑀...𝑁) ↔ 𝑥 ≤ 𝑁))
65	58, 64	mpbird 167	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) ∧ 𝑥 ≤ 𝑁) → 𝑥 ∈ (𝑀...𝑁))
66	57, 65	ffvelcdmd 5729	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) ∧ 𝑥 ≤ 𝑁) → (𝑓‘𝑥) ∈ (𝑀...𝑁))
67		elfzuz 10163	. . . . . . . . . 10 ⊢ ((𝑓‘𝑥) ∈ (𝑀...𝑁) → (𝑓‘𝑥) ∈ (ℤ≥‘𝑀))
68	66, 67	syl 14	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) ∧ 𝑥 ≤ 𝑁) → (𝑓‘𝑥) ∈ (ℤ≥‘𝑀))
69	48, 53, 68	rspcdva 2886	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) ∧ 𝑥 ≤ 𝑁) → (𝐺‘(𝑓‘𝑥)) ∈ 𝑆)
70		fveq2 5589	. . . . . . . . . 10 ⊢ (𝑎 = 𝑀 → (𝐺‘𝑎) = (𝐺‘𝑀))
71	70	eleq1d 2275	. . . . . . . . 9 ⊢ (𝑎 = 𝑀 → ((𝐺‘𝑎) ∈ 𝑆 ↔ (𝐺‘𝑀) ∈ 𝑆))
72	34, 52	sylibr 134	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑎 ∈ (ℤ≥‘𝑀)(𝐺‘𝑎) ∈ 𝑆)
73	72	ad3antrrr 492	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) ∧ ¬ 𝑥 ≤ 𝑁) → ∀𝑎 ∈ (ℤ≥‘𝑀)(𝐺‘𝑎) ∈ 𝑆)
74		eluzel2 9673	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ)
75	4, 74	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑀 ∈ ℤ)
76	75	ad3antrrr 492	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) ∧ ¬ 𝑥 ≤ 𝑁) → 𝑀 ∈ ℤ)
77		uzid 9682	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀))
78	76, 77	syl 14	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) ∧ ¬ 𝑥 ≤ 𝑁) → 𝑀 ∈ (ℤ≥‘𝑀))
79	71, 73, 78	rspcdva 2886	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) ∧ ¬ 𝑥 ≤ 𝑁) → (𝐺‘𝑀) ∈ 𝑆)
80		eluzelz 9677	. . . . . . . . . 10 ⊢ (𝑥 ∈ (ℤ≥‘𝑀) → 𝑥 ∈ ℤ)
81	80	adantl 277	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → 𝑥 ∈ ℤ)
82	61	ad2antrr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → 𝑁 ∈ ℤ)
83		zdcle 9469	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝑥 ≤ 𝑁)
84	81, 82, 83	syl2anc 411	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → DECID 𝑥 ≤ 𝑁)
85	69, 79, 84	ifcldadc 3605	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → if(𝑥 ≤ 𝑁, (𝐺‘(𝑓‘𝑥)), (𝐺‘𝑀)) ∈ 𝑆)
86	10, 42	fvmptg 5668	. . . . . . 7 ⊢ ((𝑥 ∈ (ℤ≥‘𝑀) ∧ if(𝑥 ≤ 𝑁, (𝐺‘(𝑓‘𝑥)), (𝐺‘𝑀)) ∈ 𝑆) → ((𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀)))‘𝑥) = if(𝑥 ≤ 𝑁, (𝐺‘(𝑓‘𝑥)), (𝐺‘𝑀)))
87	46, 85, 86	syl2anc 411	. . . . . 6 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → ((𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀)))‘𝑥) = if(𝑥 ≤ 𝑁, (𝐺‘(𝑓‘𝑥)), (𝐺‘𝑀)))
88	87, 85	eqeltrd 2283	. . . . 5 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → ((𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀)))‘𝑥) ∈ 𝑆)
89	6	adantlr 477	. . . . 5 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑥) ∈ 𝑆)
90	1	adantlr 477	. . . . 5 ⊢ (((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
91	19, 45, 88, 89, 90	seq3fveq 10646	. . . 4 ⊢ ((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐺)‘𝑁))
92	18, 91	eqtr3d 2241	. . 3 ⊢ ((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑏 ∈ (𝑀...𝑁)(𝑓‘𝑏) = 𝑏 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → (seq𝑀( + , 𝐿)‘𝑁) = (seq𝑀( + , 𝐺)‘𝑁))
93	17, 92	sylan2br 288	. 2 ⊢ ((𝜑 ∧ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑁)(𝑓‘𝑥) = 𝑥 ∧ (seq𝑀( + , (𝑎 ∈ (ℤ≥‘𝑀) ↦ if(𝑎 ≤ 𝑁, (𝐺‘(𝑓‘𝑎)), (𝐺‘𝑀))))‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → (seq𝑀( + , 𝐿)‘𝑁) = (seq𝑀( + , 𝐺)‘𝑁))
94	12, 93	exlimddv 1923	1 ⊢ (𝜑 → (seq𝑀( + , 𝐿)‘𝑁) = (seq𝑀( + , 𝐺)‘𝑁))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105  DECID wdc 836   ∧ w3a 981   = wceq 1373   ∈ wcel 2177  ∀wral 2485  ifcif 3575   class class class wbr 4051   ↦ cmpt 4113  ⟶wf 5276  –1-1-onto→wf1o 5279  ‘cfv 5280  (class class class)co 5957   ≤ cle 8128  ℤcz 9392  ℤ_≥cuz 9668  ...cfz 10150  seqcseq 10614

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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4167  ax-sep 4170  ax-nul 4178  ax-pow 4226  ax-pr 4261  ax-un 4488  ax-setind 4593  ax-iinf 4644  ax-cnex 8036  ax-resscn 8037  ax-1cn 8038  ax-1re 8039  ax-icn 8040  ax-addcl 8041  ax-addrcl 8042  ax-mulcl 8043  ax-addcom 8045  ax-addass 8047  ax-distr 8049  ax-i2m1 8050  ax-0lt1 8051  ax-0id 8053  ax-rnegex 8054  ax-cnre 8056  ax-pre-ltirr 8057  ax-pre-ltwlin 8058  ax-pre-lttrn 8059  ax-pre-apti 8060  ax-pre-ltadd 8061

This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-nel 2473  df-ral 2490  df-rex 2491  df-reu 2492  df-rab 2494  df-v 2775  df-sbc 3003  df-csb 3098  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-nul 3465  df-if 3576  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-uni 3857  df-int 3892  df-iun 3935  df-br 4052  df-opab 4114  df-mpt 4115  df-tr 4151  df-id 4348  df-iord 4421  df-on 4423  df-ilim 4424  df-suc 4426  df-iom 4647  df-xp 4689  df-rel 4690  df-cnv 4691  df-co 4692  df-dm 4693  df-rn 4694  df-res 4695  df-ima 4696  df-iota 5241  df-fun 5282  df-fn 5283  df-f 5284  df-f1 5285  df-fo 5286  df-f1o 5287  df-fv 5288  df-riota 5912  df-ov 5960  df-oprab 5961  df-mpo 5962  df-1st 6239  df-2nd 6240  df-recs 6404  df-frec 6490  df-1o 6515  df-er 6633  df-en 6841  df-fin 6843  df-pnf 8129  df-mnf 8130  df-xr 8131  df-ltxr 8132  df-le 8133  df-sub 8265  df-neg 8266  df-inn 9057  df-n0 9316  df-z 9393  df-uz 9669  df-fz 10151  df-fzo 10285  df-seqfrec 10615

This theorem is referenced by:  seq3f1o  10684