Theorem seq3z 10943

Description: If the operation + has an absorbing element 𝑍 (a.k.a. zero element), then any sequence containing a 𝑍 evaluates to 𝑍. (Contributed by Mario Carneiro, 27-May-2014.) (Revised by Jim Kingdon, 23-Apr-2023.)

Hypotheses

Ref	Expression
seq3homo.1	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
seq3homo.2	⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ 𝑆)
seqz.3	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑍 + 𝑥) = 𝑍)
seqz.4	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑥 + 𝑍) = 𝑍)
seqz.5	⊢ (𝜑 → 𝐾 ∈ (𝑀...𝑁))
seqz.7	⊢ (𝜑 → (𝐹‘𝐾) = 𝑍)

Assertion

Ref	Expression
seq3z	⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) = 𝑍)

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

Proof of Theorem seq3z

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

Step	Hyp	Ref	Expression
1		seqz.5	. . 3 ⊢ (𝜑 → 𝐾 ∈ (𝑀...𝑁))
2		elfzuz3 10404	. . 3 ⊢ (𝐾 ∈ (𝑀...𝑁) → 𝑁 ∈ (ℤ≥‘𝐾))
3	1, 2	syl 14	. 2 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝐾))
4		fveqeq2 5699	. . . 4 ⊢ (𝑤 = 𝐾 → ((seq𝑀( + , 𝐹)‘𝑤) = 𝑍 ↔ (seq𝑀( + , 𝐹)‘𝐾) = 𝑍))
5	4	imbi2d 230	. . 3 ⊢ (𝑤 = 𝐾 → ((𝜑 → (seq𝑀( + , 𝐹)‘𝑤) = 𝑍) ↔ (𝜑 → (seq𝑀( + , 𝐹)‘𝐾) = 𝑍)))
6		fveqeq2 5699	. . . 4 ⊢ (𝑤 = 𝑘 → ((seq𝑀( + , 𝐹)‘𝑤) = 𝑍 ↔ (seq𝑀( + , 𝐹)‘𝑘) = 𝑍))
7	6	imbi2d 230	. . 3 ⊢ (𝑤 = 𝑘 → ((𝜑 → (seq𝑀( + , 𝐹)‘𝑤) = 𝑍) ↔ (𝜑 → (seq𝑀( + , 𝐹)‘𝑘) = 𝑍)))
8		fveqeq2 5699	. . . 4 ⊢ (𝑤 = (𝑘 + 1) → ((seq𝑀( + , 𝐹)‘𝑤) = 𝑍 ↔ (seq𝑀( + , 𝐹)‘(𝑘 + 1)) = 𝑍))
9	8	imbi2d 230	. . 3 ⊢ (𝑤 = (𝑘 + 1) → ((𝜑 → (seq𝑀( + , 𝐹)‘𝑤) = 𝑍) ↔ (𝜑 → (seq𝑀( + , 𝐹)‘(𝑘 + 1)) = 𝑍)))
10		fveqeq2 5699	. . . 4 ⊢ (𝑤 = 𝑁 → ((seq𝑀( + , 𝐹)‘𝑤) = 𝑍 ↔ (seq𝑀( + , 𝐹)‘𝑁) = 𝑍))
11	10	imbi2d 230	. . 3 ⊢ (𝑤 = 𝑁 → ((𝜑 → (seq𝑀( + , 𝐹)‘𝑤) = 𝑍) ↔ (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) = 𝑍)))
12		elfzuz 10403	. . . . . . . . . 10 ⊢ (𝐾 ∈ (𝑀...𝑁) → 𝐾 ∈ (ℤ≥‘𝑀))
13	1, 12	syl 14	. . . . . . . . 9 ⊢ (𝜑 → 𝐾 ∈ (ℤ≥‘𝑀))
14		eluzelz 9910	. . . . . . . . 9 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → 𝐾 ∈ ℤ)
15	13, 14	syl 14	. . . . . . . 8 ⊢ (𝜑 → 𝐾 ∈ ℤ)
16		simpr 110	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝐾)) → 𝑥 ∈ (ℤ≥‘𝐾))
17	13	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝐾)) → 𝐾 ∈ (ℤ≥‘𝑀))
18		uztrn 9918	. . . . . . . . . 10 ⊢ ((𝑥 ∈ (ℤ≥‘𝐾) ∧ 𝐾 ∈ (ℤ≥‘𝑀)) → 𝑥 ∈ (ℤ≥‘𝑀))
19	16, 17, 18	syl2anc 415	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝐾)) → 𝑥 ∈ (ℤ≥‘𝑀))
20		seq3homo.2	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ 𝑆)
21	19, 20	syldan 282	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝐾)) → (𝐹‘𝑥) ∈ 𝑆)
22		seq3homo.1	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
23	15, 21, 22	seq3-1 10877	. . . . . . 7 ⊢ (𝜑 → (seq𝐾( + , 𝐹)‘𝐾) = (𝐹‘𝐾))
24		seqz.7	. . . . . . 7 ⊢ (𝜑 → (𝐹‘𝐾) = 𝑍)
25	23, 24	eqtrd 2271	. . . . . 6 ⊢ (𝜑 → (seq𝐾( + , 𝐹)‘𝐾) = 𝑍)
26		seqeq1 10865	. . . . . . . 8 ⊢ (𝐾 = 𝑀 → seq𝐾( + , 𝐹) = seq𝑀( + , 𝐹))
27	26	fveq1d 5692	. . . . . . 7 ⊢ (𝐾 = 𝑀 → (seq𝐾( + , 𝐹)‘𝐾) = (seq𝑀( + , 𝐹)‘𝐾))
28	27	eqeq1d 2247	. . . . . 6 ⊢ (𝐾 = 𝑀 → ((seq𝐾( + , 𝐹)‘𝐾) = 𝑍 ↔ (seq𝑀( + , 𝐹)‘𝐾) = 𝑍))
29	25, 28	syl5ibcom 155	. . . . 5 ⊢ (𝜑 → (𝐾 = 𝑀 → (seq𝑀( + , 𝐹)‘𝐾) = 𝑍))
30		eluzel2 9905	. . . . . . . . . 10 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ)
31	13, 30	syl 14	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℤ)
32	31	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐾 ∈ (ℤ≥‘(𝑀 + 1))) → 𝑀 ∈ ℤ)
33		simpr 110	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐾 ∈ (ℤ≥‘(𝑀 + 1))) → 𝐾 ∈ (ℤ≥‘(𝑀 + 1)))
34	20	adantlr 481	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐾 ∈ (ℤ≥‘(𝑀 + 1))) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ 𝑆)
35	22	adantlr 481	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐾 ∈ (ℤ≥‘(𝑀 + 1))) ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
36	32, 33, 34, 35	seq3m1 10888	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐾 ∈ (ℤ≥‘(𝑀 + 1))) → (seq𝑀( + , 𝐹)‘𝐾) = ((seq𝑀( + , 𝐹)‘(𝐾 − 1)) + (𝐹‘𝐾)))
37	24	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐾 ∈ (ℤ≥‘(𝑀 + 1))) → (𝐹‘𝐾) = 𝑍)
38	37	oveq2d 6091	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐾 ∈ (ℤ≥‘(𝑀 + 1))) → ((seq𝑀( + , 𝐹)‘(𝐾 − 1)) + (𝐹‘𝐾)) = ((seq𝑀( + , 𝐹)‘(𝐾 − 1)) + 𝑍))
39		oveq1 6082	. . . . . . . . 9 ⊢ (𝑥 = (seq𝑀( + , 𝐹)‘(𝐾 − 1)) → (𝑥 + 𝑍) = ((seq𝑀( + , 𝐹)‘(𝐾 − 1)) + 𝑍))
40	39	eqeq1d 2247	. . . . . . . 8 ⊢ (𝑥 = (seq𝑀( + , 𝐹)‘(𝐾 − 1)) → ((𝑥 + 𝑍) = 𝑍 ↔ ((seq𝑀( + , 𝐹)‘(𝐾 − 1)) + 𝑍) = 𝑍))
41		seqz.4	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑥 + 𝑍) = 𝑍)
42	41	ralrimiva 2623	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 (𝑥 + 𝑍) = 𝑍)
43	42	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐾 ∈ (ℤ≥‘(𝑀 + 1))) → ∀𝑥 ∈ 𝑆 (𝑥 + 𝑍) = 𝑍)
44		eqid 2238	. . . . . . . . . 10 ⊢ (ℤ≥‘𝑀) = (ℤ≥‘𝑀)
45	44, 32, 34, 35	seqf 10879	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐾 ∈ (ℤ≥‘(𝑀 + 1))) → seq𝑀( + , 𝐹):(ℤ≥‘𝑀)⟶𝑆)
46		eluzp1m1 9925	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ (ℤ≥‘(𝑀 + 1))) → (𝐾 − 1) ∈ (ℤ≥‘𝑀))
47	31, 46	sylan 283	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐾 ∈ (ℤ≥‘(𝑀 + 1))) → (𝐾 − 1) ∈ (ℤ≥‘𝑀))
48	45, 47	ffvelcdmd 5835	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐾 ∈ (ℤ≥‘(𝑀 + 1))) → (seq𝑀( + , 𝐹)‘(𝐾 − 1)) ∈ 𝑆)
49	40, 43, 48	rspcdva 2934	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐾 ∈ (ℤ≥‘(𝑀 + 1))) → ((seq𝑀( + , 𝐹)‘(𝐾 − 1)) + 𝑍) = 𝑍)
50	36, 38, 49	3eqtrd 2275	. . . . . 6 ⊢ ((𝜑 ∧ 𝐾 ∈ (ℤ≥‘(𝑀 + 1))) → (seq𝑀( + , 𝐹)‘𝐾) = 𝑍)
51	50	ex 115	. . . . 5 ⊢ (𝜑 → (𝐾 ∈ (ℤ≥‘(𝑀 + 1)) → (seq𝑀( + , 𝐹)‘𝐾) = 𝑍))
52		uzp1 9935	. . . . . 6 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (𝐾 = 𝑀 ∨ 𝐾 ∈ (ℤ≥‘(𝑀 + 1))))
53	13, 52	syl 14	. . . . 5 ⊢ (𝜑 → (𝐾 = 𝑀 ∨ 𝐾 ∈ (ℤ≥‘(𝑀 + 1))))
54	29, 51, 53	mpjaod 730	. . . 4 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝐾) = 𝑍)
55	54	a1i 9	. . 3 ⊢ (𝐾 ∈ ℤ → (𝜑 → (seq𝑀( + , 𝐹)‘𝐾) = 𝑍))
56		simpr 110	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) → 𝑘 ∈ (ℤ≥‘𝐾))
57	13	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) → 𝐾 ∈ (ℤ≥‘𝑀))
58		uztrn 9918	. . . . . . . . . 10 ⊢ ((𝑘 ∈ (ℤ≥‘𝐾) ∧ 𝐾 ∈ (ℤ≥‘𝑀)) → 𝑘 ∈ (ℤ≥‘𝑀))
59	56, 57, 58	syl2anc 415	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) → 𝑘 ∈ (ℤ≥‘𝑀))
60	20	adantlr 481	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ 𝑆)
61	22	adantlr 481	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
62	59, 60, 61	seq3p1 10880	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) → (seq𝑀( + , 𝐹)‘(𝑘 + 1)) = ((seq𝑀( + , 𝐹)‘𝑘) + (𝐹‘(𝑘 + 1))))
63	62	adantr 276	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) ∧ (seq𝑀( + , 𝐹)‘𝑘) = 𝑍) → (seq𝑀( + , 𝐹)‘(𝑘 + 1)) = ((seq𝑀( + , 𝐹)‘𝑘) + (𝐹‘(𝑘 + 1))))
64		simpr 110	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) ∧ (seq𝑀( + , 𝐹)‘𝑘) = 𝑍) → (seq𝑀( + , 𝐹)‘𝑘) = 𝑍)
65	64	oveq1d 6090	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) ∧ (seq𝑀( + , 𝐹)‘𝑘) = 𝑍) → ((seq𝑀( + , 𝐹)‘𝑘) + (𝐹‘(𝑘 + 1))) = (𝑍 + (𝐹‘(𝑘 + 1))))
66		oveq2 6083	. . . . . . . . . 10 ⊢ (𝑥 = (𝐹‘(𝑘 + 1)) → (𝑍 + 𝑥) = (𝑍 + (𝐹‘(𝑘 + 1))))
67	66	eqeq1d 2247	. . . . . . . . 9 ⊢ (𝑥 = (𝐹‘(𝑘 + 1)) → ((𝑍 + 𝑥) = 𝑍 ↔ (𝑍 + (𝐹‘(𝑘 + 1))) = 𝑍))
68		seqz.3	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑍 + 𝑥) = 𝑍)
69	68	ralrimiva 2623	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 (𝑍 + 𝑥) = 𝑍)
70	69	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) → ∀𝑥 ∈ 𝑆 (𝑍 + 𝑥) = 𝑍)
71		fveq2 5690	. . . . . . . . . . 11 ⊢ (𝑥 = (𝑘 + 1) → (𝐹‘𝑥) = (𝐹‘(𝑘 + 1)))
72	71	eleq1d 2307	. . . . . . . . . 10 ⊢ (𝑥 = (𝑘 + 1) → ((𝐹‘𝑥) ∈ 𝑆 ↔ (𝐹‘(𝑘 + 1)) ∈ 𝑆))
73	20	ralrimiva 2623	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑥 ∈ (ℤ≥‘𝑀)(𝐹‘𝑥) ∈ 𝑆)
74	73	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) → ∀𝑥 ∈ (ℤ≥‘𝑀)(𝐹‘𝑥) ∈ 𝑆)
75		peano2uz 9962	. . . . . . . . . . 11 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → (𝑘 + 1) ∈ (ℤ≥‘𝑀))
76	59, 75	syl 14	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) → (𝑘 + 1) ∈ (ℤ≥‘𝑀))
77	72, 74, 76	rspcdva 2934	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) → (𝐹‘(𝑘 + 1)) ∈ 𝑆)
78	67, 70, 77	rspcdva 2934	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) → (𝑍 + (𝐹‘(𝑘 + 1))) = 𝑍)
79	78	adantr 276	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) ∧ (seq𝑀( + , 𝐹)‘𝑘) = 𝑍) → (𝑍 + (𝐹‘(𝑘 + 1))) = 𝑍)
80	63, 65, 79	3eqtrd 2275	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) ∧ (seq𝑀( + , 𝐹)‘𝑘) = 𝑍) → (seq𝑀( + , 𝐹)‘(𝑘 + 1)) = 𝑍)
81	80	ex 115	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) → ((seq𝑀( + , 𝐹)‘𝑘) = 𝑍 → (seq𝑀( + , 𝐹)‘(𝑘 + 1)) = 𝑍))
82	81	expcom 116	. . . 4 ⊢ (𝑘 ∈ (ℤ≥‘𝐾) → (𝜑 → ((seq𝑀( + , 𝐹)‘𝑘) = 𝑍 → (seq𝑀( + , 𝐹)‘(𝑘 + 1)) = 𝑍)))
83	82	a2d 26	. . 3 ⊢ (𝑘 ∈ (ℤ≥‘𝐾) → ((𝜑 → (seq𝑀( + , 𝐹)‘𝑘) = 𝑍) → (𝜑 → (seq𝑀( + , 𝐹)‘(𝑘 + 1)) = 𝑍)))
84	5, 7, 9, 11, 55, 83	uzind4 9967	. 2 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) → (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) = 𝑍))
85	3, 84	mpcom 36	1 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) = 𝑍)

Syntax hints:   → wi 4   ∧ wa 104   ∨ wo 720   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ‘cfv 5372  (class class class)co 6075  1c1 8170   + caddc 8172   − cmin 8487  ℤcz 9623  ℤ_≥cuz 9900  ...cfz 10390  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-seqfrec 10863

This theorem is referenced by:  bcval5  11179  lgsne0  16071