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

Theorem seq3fveq2 10584
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 10124 . . 3 (𝑁 ∈ (ℤ𝐾) → 𝑁 ∈ (𝐾...𝑁))
31, 2syl 14 . 2 (𝜑𝑁 ∈ (𝐾...𝑁))
4 eleq1 2259 . . . . . 6 (𝑧 = 𝐾 → (𝑧 ∈ (𝐾...𝑁) ↔ 𝐾 ∈ (𝐾...𝑁)))
5 fveq2 5561 . . . . . . 7 (𝑧 = 𝐾 → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝑀( + , 𝐹)‘𝐾))
6 fveq2 5561 . . . . . . 7 (𝑧 = 𝐾 → (seq𝐾( + , 𝐺)‘𝑧) = (seq𝐾( + , 𝐺)‘𝐾))
75, 6eqeq12d 2211 . . . . . 6 (𝑧 = 𝐾 → ((seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧) ↔ (seq𝑀( + , 𝐹)‘𝐾) = (seq𝐾( + , 𝐺)‘𝐾)))
84, 7imbi12d 234 . . . . 5 (𝑧 = 𝐾 → ((𝑧 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧)) ↔ (𝐾 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝐾) = (seq𝐾( + , 𝐺)‘𝐾))))
98imbi2d 230 . . . 4 (𝑧 = 𝐾 → ((𝜑 → (𝑧 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧))) ↔ (𝜑 → (𝐾 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝐾) = (seq𝐾( + , 𝐺)‘𝐾)))))
10 eleq1 2259 . . . . . 6 (𝑧 = 𝑤 → (𝑧 ∈ (𝐾...𝑁) ↔ 𝑤 ∈ (𝐾...𝑁)))
11 fveq2 5561 . . . . . . 7 (𝑧 = 𝑤 → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝑀( + , 𝐹)‘𝑤))
12 fveq2 5561 . . . . . . 7 (𝑧 = 𝑤 → (seq𝐾( + , 𝐺)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑤))
1311, 12eqeq12d 2211 . . . . . 6 (𝑧 = 𝑤 → ((seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧) ↔ (seq𝑀( + , 𝐹)‘𝑤) = (seq𝐾( + , 𝐺)‘𝑤)))
1410, 13imbi12d 234 . . . . 5 (𝑧 = 𝑤 → ((𝑧 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧)) ↔ (𝑤 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑤) = (seq𝐾( + , 𝐺)‘𝑤))))
1514imbi2d 230 . . . 4 (𝑧 = 𝑤 → ((𝜑 → (𝑧 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧))) ↔ (𝜑 → (𝑤 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑤) = (seq𝐾( + , 𝐺)‘𝑤)))))
16 eleq1 2259 . . . . . 6 (𝑧 = (𝑤 + 1) → (𝑧 ∈ (𝐾...𝑁) ↔ (𝑤 + 1) ∈ (𝐾...𝑁)))
17 fveq2 5561 . . . . . . 7 (𝑧 = (𝑤 + 1) → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝑀( + , 𝐹)‘(𝑤 + 1)))
18 fveq2 5561 . . . . . . 7 (𝑧 = (𝑤 + 1) → (seq𝐾( + , 𝐺)‘𝑧) = (seq𝐾( + , 𝐺)‘(𝑤 + 1)))
1917, 18eqeq12d 2211 . . . . . 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 2259 . . . . . 6 (𝑧 = 𝑁 → (𝑧 ∈ (𝐾...𝑁) ↔ 𝑁 ∈ (𝐾...𝑁)))
23 fveq2 5561 . . . . . . 7 (𝑧 = 𝑁 → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝑀( + , 𝐹)‘𝑁))
24 fveq2 5561 . . . . . . 7 (𝑧 = 𝑁 → (seq𝐾( + , 𝐺)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑁))
2523, 24eqeq12d 2211 . . . . . 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 9627 . . . . . . . 8 (𝐾 ∈ (ℤ𝑀) → 𝐾 ∈ ℤ)
3129, 30syl 14 . . . . . . 7 (𝜑𝐾 ∈ ℤ)
32 seq3fveq2.g . . . . . . 7 ((𝜑𝑥 ∈ (ℤ𝐾)) → (𝐺𝑥) ∈ 𝑆)
33 seq3fveq2.pl . . . . . . 7 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
3431, 32, 33seq3-1 10571 . . . . . 6 (𝜑 → (seq𝐾( + , 𝐺)‘𝐾) = (𝐺𝐾))
3528, 34eqtr4d 2232 . . . . 5 (𝜑 → (seq𝑀( + , 𝐹)‘𝐾) = (seq𝐾( + , 𝐺)‘𝐾))
3635a1i13 24 . . . 4 (𝐾 ∈ ℤ → (𝜑 → (𝐾 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝐾) = (seq𝐾( + , 𝐺)‘𝐾))))
37 peano2fzr 10129 . . . . . . . 8 ((𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁)) → 𝑤 ∈ (𝐾...𝑁))
3837adantl 277 . . . . . . 7 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → 𝑤 ∈ (𝐾...𝑁))
3938expr 375 . . . . . 6 ((𝜑𝑤 ∈ (ℤ𝐾)) → ((𝑤 + 1) ∈ (𝐾...𝑁) → 𝑤 ∈ (𝐾...𝑁)))
4039imim1d 75 . . . . 5 ((𝜑𝑤 ∈ (ℤ𝐾)) → ((𝑤 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑤) = (seq𝐾( + , 𝐺)‘𝑤)) → ((𝑤 + 1) ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑤) = (seq𝐾( + , 𝐺)‘𝑤))))
41 oveq1 5932 . . . . . 6 ((seq𝑀( + , 𝐹)‘𝑤) = (seq𝐾( + , 𝐺)‘𝑤) → ((seq𝑀( + , 𝐹)‘𝑤) + (𝐹‘(𝑤 + 1))) = ((seq𝐾( + , 𝐺)‘𝑤) + (𝐹‘(𝑤 + 1))))
42 simprl 529 . . . . . . . . 9 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → 𝑤 ∈ (ℤ𝐾))
4329adantr 276 . . . . . . . . 9 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → 𝐾 ∈ (ℤ𝑀))
44 uztrn 9635 . . . . . . . . 9 ((𝑤 ∈ (ℤ𝐾) ∧ 𝐾 ∈ (ℤ𝑀)) → 𝑤 ∈ (ℤ𝑀))
4542, 43, 44syl2anc 411 . . . . . . . 8 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → 𝑤 ∈ (ℤ𝑀))
46 seq3fveq2.f . . . . . . . . 9 ((𝜑𝑥 ∈ (ℤ𝑀)) → (𝐹𝑥) ∈ 𝑆)
4746adantlr 477 . . . . . . . 8 (((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) ∧ 𝑥 ∈ (ℤ𝑀)) → (𝐹𝑥) ∈ 𝑆)
4833adantlr 477 . . . . . . . 8 (((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
4945, 47, 48seq3p1 10574 . . . . . . 7 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → (seq𝑀( + , 𝐹)‘(𝑤 + 1)) = ((seq𝑀( + , 𝐹)‘𝑤) + (𝐹‘(𝑤 + 1))))
5032adantlr 477 . . . . . . . . 9 (((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) ∧ 𝑥 ∈ (ℤ𝐾)) → (𝐺𝑥) ∈ 𝑆)
5142, 50, 48seq3p1 10574 . . . . . . . 8 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → (seq𝐾( + , 𝐺)‘(𝑤 + 1)) = ((seq𝐾( + , 𝐺)‘𝑤) + (𝐺‘(𝑤 + 1))))
52 fveq2 5561 . . . . . . . . . . 11 (𝑘 = (𝑤 + 1) → (𝐹𝑘) = (𝐹‘(𝑤 + 1)))
53 fveq2 5561 . . . . . . . . . . 11 (𝑘 = (𝑤 + 1) → (𝐺𝑘) = (𝐺‘(𝑤 + 1)))
5452, 53eqeq12d 2211 . . . . . . . . . 10 (𝑘 = (𝑤 + 1) → ((𝐹𝑘) = (𝐺𝑘) ↔ (𝐹‘(𝑤 + 1)) = (𝐺‘(𝑤 + 1))))
55 seq3fveq2.4 . . . . . . . . . . . 12 ((𝜑𝑘 ∈ ((𝐾 + 1)...𝑁)) → (𝐹𝑘) = (𝐺𝑘))
5655ralrimiva 2570 . . . . . . . . . . 11 (𝜑 → ∀𝑘 ∈ ((𝐾 + 1)...𝑁)(𝐹𝑘) = (𝐺𝑘))
5756adantr 276 . . . . . . . . . 10 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → ∀𝑘 ∈ ((𝐾 + 1)...𝑁)(𝐹𝑘) = (𝐺𝑘))
58 eluzp1p1 9644 . . . . . . . . . . . 12 (𝑤 ∈ (ℤ𝐾) → (𝑤 + 1) ∈ (ℤ‘(𝐾 + 1)))
5958ad2antrl 490 . . . . . . . . . . 11 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → (𝑤 + 1) ∈ (ℤ‘(𝐾 + 1)))
60 elfzuz3 10114 . . . . . . . . . . . 12 ((𝑤 + 1) ∈ (𝐾...𝑁) → 𝑁 ∈ (ℤ‘(𝑤 + 1)))
6160ad2antll 491 . . . . . . . . . . 11 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → 𝑁 ∈ (ℤ‘(𝑤 + 1)))
62 elfzuzb 10111 . . . . . . . . . . 11 ((𝑤 + 1) ∈ ((𝐾 + 1)...𝑁) ↔ ((𝑤 + 1) ∈ (ℤ‘(𝐾 + 1)) ∧ 𝑁 ∈ (ℤ‘(𝑤 + 1))))
6359, 61, 62sylanbrc 417 . . . . . . . . . 10 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → (𝑤 + 1) ∈ ((𝐾 + 1)...𝑁))
6454, 57, 63rspcdva 2873 . . . . . . . . 9 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → (𝐹‘(𝑤 + 1)) = (𝐺‘(𝑤 + 1)))
6564oveq2d 5941 . . . . . . . 8 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → ((seq𝐾( + , 𝐺)‘𝑤) + (𝐹‘(𝑤 + 1))) = ((seq𝐾( + , 𝐺)‘𝑤) + (𝐺‘(𝑤 + 1))))
6651, 65eqtr4d 2232 . . . . . . 7 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → (seq𝐾( + , 𝐺)‘(𝑤 + 1)) = ((seq𝐾( + , 𝐺)‘𝑤) + (𝐹‘(𝑤 + 1))))
6749, 66eqeq12d 2211 . . . . . 6 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → ((seq𝑀( + , 𝐹)‘(𝑤 + 1)) = (seq𝐾( + , 𝐺)‘(𝑤 + 1)) ↔ ((seq𝑀( + , 𝐹)‘𝑤) + (𝐹‘(𝑤 + 1))) = ((seq𝐾( + , 𝐺)‘𝑤) + (𝐹‘(𝑤 + 1)))))
6841, 67imbitrrid 156 . . . . 5 ((𝜑 ∧ (𝑤 ∈ (ℤ𝐾) ∧ (𝑤 + 1) ∈ (𝐾...𝑁))) → ((seq𝑀( + , 𝐹)‘𝑤) = (seq𝐾( + , 𝐺)‘𝑤) → (seq𝑀( + , 𝐹)‘(𝑤 + 1)) = (seq𝐾( + , 𝐺)‘(𝑤 + 1))))
6940, 68animpimp2impd 559 . . . 4 (𝑤 ∈ (ℤ𝐾) → ((𝜑 → (𝑤 ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘𝑤) = (seq𝐾( + , 𝐺)‘𝑤))) → (𝜑 → ((𝑤 + 1) ∈ (𝐾...𝑁) → (seq𝑀( + , 𝐹)‘(𝑤 + 1)) = (seq𝐾( + , 𝐺)‘(𝑤 + 1))))))
709, 15, 21, 27, 36, 69uzind4 9679 . . 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 1364  wcel 2167  wral 2475  cfv 5259  (class class class)co 5925  1c1 7897   + caddc 7899  cz 9343  cuz 9618  ...cfz 10100  seqcseq 10556
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-addass 7998  ax-distr 8000  ax-i2m1 8001  ax-0lt1 8002  ax-0id 8004  ax-rnegex 8005  ax-cnre 8007  ax-pre-ltirr 8008  ax-pre-ltwlin 8009  ax-pre-lttrn 8010  ax-pre-ltadd 8012
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-id 4329  df-iord 4402  df-on 4404  df-ilim 4405  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-recs 6372  df-frec 6458  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084  df-sub 8216  df-neg 8217  df-inn 9008  df-n0 9267  df-z 9344  df-uz 9619  df-fz 10101  df-seqfrec 10557
This theorem is referenced by:  seq3feq2  10585  seq3fveq  10588  gsumsplit1r  13100
  Copyright terms: Public domain W3C validator