ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  seq3fveq2 GIF version

Theorem seq3fveq2 10890
Description: Equality of sequences. (Contributed by Jim Kingdon, 3-Jun-2020.)
Hypotheses
Ref Expression
seq3fveq2.1 (𝜑𝐾 ∈ (ℤ𝑀))
seq3fveq2.2 (𝜑 → (seq𝑀( + , 𝐹)‘𝐾) = (𝐺𝐾))
seq3fveq2.f ((𝜑𝑥 ∈ (ℤ𝑀)) → (𝐹𝑥) ∈ 𝑆)
seq3fveq2.g ((𝜑𝑥 ∈ (ℤ𝐾)) → (𝐺𝑥) ∈ 𝑆)
seq3fveq2.pl ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
seq3fveq2.3 (𝜑𝑁 ∈ (ℤ𝐾))
seq3fveq2.4 ((𝜑𝑘 ∈ ((𝐾 + 1)...𝑁)) → (𝐹𝑘) = (𝐺𝑘))
Assertion
Ref Expression
seq3fveq2 (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) = (seq𝐾( + , 𝐺)‘𝑁))
Distinct variable groups:   𝑥,𝑘,𝑦,𝐹   𝑘,𝐺,𝑥,𝑦   𝑘,𝐾,𝑥,𝑦   𝑘,𝑁,𝑥,𝑦   𝜑,𝑘,𝑥,𝑦   𝑘,𝑀,𝑥,𝑦   + ,𝑘,𝑥,𝑦   𝑆,𝑘,𝑥,𝑦

Proof of Theorem seq3fveq2
Dummy variables 𝑧 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 seq3fveq2.3 . . 3 (𝜑𝑁 ∈ (ℤ𝐾))
2 eluzfz2 10415 . . 3 (𝑁 ∈ (ℤ𝐾) → 𝑁 ∈ (𝐾...𝑁))
31, 2syl 14 . 2 (𝜑𝑁 ∈ (𝐾...𝑁))
4 eleq1 2301 . . . . . 6 (𝑧 = 𝐾 → (𝑧 ∈ (𝐾...𝑁) ↔ 𝐾 ∈ (𝐾...𝑁)))
5 fveq2 5690 . . . . . . 7 (𝑧 = 𝐾 → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝑀( + , 𝐹)‘𝐾))
6 fveq2 5690 . . . . . . 7 (𝑧 = 𝐾 → (seq𝐾( + , 𝐺)‘𝑧) = (seq𝐾( + , 𝐺)‘𝐾))
75, 6eqeq12d 2253 . . . . . 6 (𝑧 = 𝐾 → ((seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧) ↔ (seq𝑀( + , 𝐹)‘𝐾) = (seq𝐾( + , 𝐺)‘𝐾)))
84, 7imbi12d 234 . . . . 5 (𝑧 = 𝐾 → ((𝑧 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧)) ↔ (𝐾 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝐾) = (seq𝐾( + , 𝐺)‘𝐾))))
98imbi2d 230 . . . 4 (𝑧 = 𝐾 → ((𝜑 → (𝑧 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧))) ↔ (𝜑 → (𝐾 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝐾) = (seq𝐾( + , 𝐺)‘𝐾)))))
10 eleq1 2301 . . . . . 6 (𝑧 = 𝑤 → (𝑧 ∈ (𝐾...𝑁) ↔ 𝑤 ∈ (𝐾...𝑁)))
11 fveq2 5690 . . . . . . 7 (𝑧 = 𝑤 → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝑀( + , 𝐹)‘𝑤))
12 fveq2 5690 . . . . . . 7 (𝑧 = 𝑤 → (seq𝐾( + , 𝐺)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑤))
1311, 12eqeq12d 2253 . . . . . 6 (𝑧 = 𝑤 → ((seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧) ↔ (seq𝑀( + , 𝐹)‘𝑤) = (seq𝐾( + , 𝐺)‘𝑤)))
1410, 13imbi12d 234 . . . . 5 (𝑧 = 𝑤 → ((𝑧 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧)) ↔ (𝑤 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑤) = (seq𝐾( + , 𝐺)‘𝑤))))
1514imbi2d 230 . . . 4 (𝑧 = 𝑤 → ((𝜑 → (𝑧 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧))) ↔ (𝜑 → (𝑤 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑤) = (seq𝐾( + , 𝐺)‘𝑤)))))
16 eleq1 2301 . . . . . 6 (𝑧 = (𝑤 + 1) → (𝑧 ∈ (𝐾...𝑁) ↔ (𝑤 + 1) ∈ (𝐾...𝑁)))
17 fveq2 5690 . . . . . . 7 (𝑧 = (𝑤 + 1) → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝑀( + , 𝐹)‘(𝑤 + 1)))
18 fveq2 5690 . . . . . . 7 (𝑧 = (𝑤 + 1) → (seq𝐾( + , 𝐺)‘𝑧) = (seq𝐾( + , 𝐺)‘(𝑤 + 1)))
1917, 18eqeq12d 2253 . . . . . 6 (𝑧 = (𝑤 + 1) → ((seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧) ↔ (seq𝑀( + , 𝐹)‘(𝑤 + 1)) = (seq𝐾( + , 𝐺)‘(𝑤 + 1))))
2016, 19imbi12d 234 . . . . 5 (𝑧 = (𝑤 + 1) → ((𝑧 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧)) ↔ ((𝑤 + 1) ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘(𝑤 + 1)) = (seq𝐾( + , 𝐺)‘(𝑤 + 1)))))
2120imbi2d 230 . . . 4 (𝑧 = (𝑤 + 1) → ((𝜑 → (𝑧 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧))) ↔ (𝜑 → ((𝑤 + 1) ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘(𝑤 + 1)) = (seq𝐾( + , 𝐺)‘(𝑤 + 1))))))
22 eleq1 2301 . . . . . 6 (𝑧 = 𝑁 → (𝑧 ∈ (𝐾...𝑁) ↔ 𝑁 ∈ (𝐾...𝑁)))
23 fveq2 5690 . . . . . . 7 (𝑧 = 𝑁 → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝑀( + , 𝐹)‘𝑁))
24 fveq2 5690 . . . . . . 7 (𝑧 = 𝑁 → (seq𝐾( + , 𝐺)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑁))
2523, 24eqeq12d 2253 . . . . . 6 (𝑧 = 𝑁 → ((seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧) ↔ (seq𝑀( + , 𝐹)‘𝑁) = (seq𝐾( + , 𝐺)‘𝑁)))
2622, 25imbi12d 234 . . . . 5 (𝑧 = 𝑁 → ((𝑧 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧)) ↔ (𝑁 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑁) = (seq𝐾( + , 𝐺)‘𝑁))))
2726imbi2d 230 . . . 4 (𝑧 = 𝑁 → ((𝜑 → (𝑧 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧))) ↔ (𝜑 → (𝑁 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑁) = (seq𝐾( + , 𝐺)‘𝑁)))))
28 seq3fveq2.2 . . . . . 6 (𝜑 → (seq𝑀( + , 𝐹)‘𝐾) = (𝐺𝐾))
29 seq3fveq2.1 . . . . . . . 8 (𝜑𝐾 ∈ (ℤ𝑀))
30 eluzelz 9910 . . . . . . . 8 (𝐾 ∈ (ℤ𝑀) → 𝐾 ∈ ℤ)
3129, 30syl 14 . . . . . . 7 (𝜑𝐾 ∈ ℤ)
32 seq3fveq2.g . . . . . . 7 ((𝜑𝑥 ∈ (ℤ𝐾)) → (𝐺𝑥) ∈ 𝑆)
33 seq3fveq2.pl . . . . . . 7 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
3431, 32, 33seq3-1 10877 . . . . . 6 (𝜑 → (seq𝐾( + , 𝐺)‘𝐾) = (𝐺𝐾))
3528, 34eqtr4d 2274 . . . . 5 (𝜑 → (seq𝑀( + , 𝐹)‘𝐾) = (seq𝐾( + , 𝐺)‘𝐾))
3635a1i13 24 . . . 4 (𝐾 ∈ ℤ → (𝜑 → (𝐾 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝐾) = (seq𝐾( + , 𝐺)‘𝐾))))
37 peano2fzr 10420 . . . . . . . 8 ((𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁)) → 𝑤 ∈ (𝐾...𝑁))
3837adantl 277 . . . . . . 7 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → 𝑤 ∈ (𝐾...𝑁))
3938expr 375 . . . . . 6 ((𝜑𝑤 ∈ (ℤ𝐾)) → ((𝑤 + 1) ∈ (𝐾...𝑁) → 𝑤 ∈ (𝐾...𝑁)))
4039imim1d 75 . . . . 5 ((𝜑𝑤 ∈ (ℤ𝐾)) → ((𝑤 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑤) = (seq𝐾( + , 𝐺)‘𝑤)) → ((𝑤 + 1) ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑤) = (seq𝐾( + , 𝐺)‘𝑤))))
41 oveq1 6082 . . . . . 6 ((seq𝑀( + , 𝐹)‘𝑤) = (seq𝐾( + , 𝐺)‘𝑤) → ((seq𝑀( + , 𝐹)‘𝑤) + (𝐹‘(𝑤 + 1))) = ((seq𝐾( + , 𝐺)‘𝑤) + (𝐹‘(𝑤 + 1))))
42 simprl 535 . . . . . . . . 9 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → 𝑤 ∈ (ℤ𝐾))
4329adantr 276 . . . . . . . . 9 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → 𝐾 ∈ (ℤ𝑀))
44 uztrn 9918 . . . . . . . . 9 ((𝑤 ∈ (ℤ𝐾) ∧ 𝐾 ∈ (ℤ𝑀)) → 𝑤 ∈ (ℤ𝑀))
4542, 43, 44syl2anc 415 . . . . . . . 8 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → 𝑤 ∈ (ℤ𝑀))
46 seq3fveq2.f . . . . . . . . 9 ((𝜑𝑥 ∈ (ℤ𝑀)) → (𝐹𝑥) ∈ 𝑆)
4746adantlr 481 . . . . . . . 8 (((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) ∧ 𝑥 ∈ (ℤ𝑀)) → (𝐹𝑥) ∈ 𝑆)
4833adantlr 481 . . . . . . . 8 (((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
4945, 47, 48seq3p1 10880 . . . . . . 7 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → (seq𝑀( + , 𝐹)‘(𝑤 + 1)) = ((seq𝑀( + , 𝐹)‘𝑤) + (𝐹‘(𝑤 + 1))))
5032adantlr 481 . . . . . . . . 9 (((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) ∧ 𝑥 ∈ (ℤ𝐾)) → (𝐺𝑥) ∈ 𝑆)
5142, 50, 48seq3p1 10880 . . . . . . . 8 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → (seq𝐾( + , 𝐺)‘(𝑤 + 1)) = ((seq𝐾( + , 𝐺)‘𝑤) + (𝐺‘(𝑤 + 1))))
52 fveq2 5690 . . . . . . . . . . 11 (𝑘 = (𝑤 + 1) → (𝐹𝑘) = (𝐹‘(𝑤 + 1)))
53 fveq2 5690 . . . . . . . . . . 11 (𝑘 = (𝑤 + 1) → (𝐺𝑘) = (𝐺‘(𝑤 + 1)))
5452, 53eqeq12d 2253 . . . . . . . . . 10 (𝑘 = (𝑤 + 1) → ((𝐹𝑘) = (𝐺𝑘) ↔ (𝐹‘(𝑤 + 1)) = (𝐺‘(𝑤 + 1))))
55 seq3fveq2.4 . . . . . . . . . . . 12 ((𝜑𝑘 ∈ ((𝐾 + 1)...𝑁)) → (𝐹𝑘) = (𝐺𝑘))
5655ralrimiva 2623 . . . . . . . . . . 11 (𝜑 → ∀𝑘 ∈ ((𝐾 + 1)...𝑁)(𝐹𝑘) = (𝐺𝑘))
5756adantr 276 . . . . . . . . . 10 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → ∀𝑘 ∈ ((𝐾 + 1)...𝑁)(𝐹𝑘) = (𝐺𝑘))
58 eluzp1p1 9927 . . . . . . . . . . . 12 (𝑤 ∈ (ℤ𝐾) → (𝑤 + 1) ∈ (ℤ‘(𝐾 + 1)))
5958ad2antrl 494 . . . . . . . . . . 11 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → (𝑤 + 1) ∈ (ℤ‘(𝐾 + 1)))
60 elfzuz3 10404 . . . . . . . . . . . 12 ((𝑤 + 1) ∈ (𝐾...𝑁) → 𝑁 ∈ (ℤ‘(𝑤 + 1)))
6160ad2antll 495 . . . . . . . . . . 11 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → 𝑁 ∈ (ℤ‘(𝑤 + 1)))
62 elfzuzb 10401 . . . . . . . . . . 11 ((𝑤 + 1) ∈ ((𝐾 + 1)...𝑁) ↔ ((𝑤 + 1) ∈ (ℤ‘(𝐾 + 1)) ∧ 𝑁 ∈ (ℤ‘(𝑤 + 1))))
6359, 61, 62sylanbrc 421 . . . . . . . . . 10 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → (𝑤 + 1) ∈ ((𝐾 + 1)...𝑁))
6454, 57, 63rspcdva 2934 . . . . . . . . 9 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → (𝐹‘(𝑤 + 1)) = (𝐺‘(𝑤 + 1)))
6564oveq2d 6091 . . . . . . . 8 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → ((seq𝐾( + , 𝐺)‘𝑤) + (𝐹‘(𝑤 + 1))) = ((seq𝐾( + , 𝐺)‘𝑤) + (𝐺‘(𝑤 + 1))))
6651, 65eqtr4d 2274 . . . . . . 7 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → (seq𝐾( + , 𝐺)‘(𝑤 + 1)) = ((seq𝐾( + , 𝐺)‘𝑤) + (𝐹‘(𝑤 + 1))))
6749, 66eqeq12d 2253 . . . . . 6 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → ((seq𝑀( + , 𝐹)‘(𝑤 + 1)) = (seq𝐾( + , 𝐺)‘(𝑤 + 1)) ↔ ((seq𝑀( + , 𝐹)‘𝑤) + (𝐹‘(𝑤 + 1))) = ((seq𝐾( + , 𝐺)‘𝑤) + (𝐹‘(𝑤 + 1)))))
6841, 67imbitrrid 156 . . . . 5 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → ((seq𝑀( + , 𝐹)‘𝑤) = (seq𝐾( + , 𝐺)‘𝑤) → (seq𝑀( + , 𝐹)‘(𝑤 + 1)) = (seq𝐾( + , 𝐺)‘(𝑤 + 1))))
6940, 68animpimp2impd 565 . . . 4 (𝑤 ∈ (ℤ𝐾) → ((𝜑 → (𝑤 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑤) = (seq𝐾( + , 𝐺)‘𝑤))) → (𝜑 → ((𝑤 + 1) ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘(𝑤 + 1)) = (seq𝐾( + , 𝐺)‘(𝑤 + 1))))))
709, 15, 21, 27, 36, 69uzind4 9967 . . 3 (𝑁 ∈ (ℤ𝐾) → (𝜑 → (𝑁 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑁) = (seq𝐾( + , 𝐺)‘𝑁))))
711, 70mpcom 36 . 2 (𝜑 → (𝑁 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑁) = (seq𝐾( + , 𝐺)‘𝑁)))
723, 71mpd 13 1 (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) = (seq𝐾( + , 𝐺)‘𝑁))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1402  wcel 2209  wral 2528  cfv 5372  (class class class)co 6075  1c1 8170   + caddc 8172  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:  seq3feq2  10891  seq3fveq  10894
  Copyright terms: Public domain W3C validator