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

Theorem seq3caopr2 10285
Description: The sum of two infinite series (generalized to an arbitrary commutative and associative operation). (Contributed by Mario Carneiro, 30-May-2014.) (Revised by Jim Kingdon, 23-Apr-2023.)
Hypotheses
Ref Expression
seqcaopr2.1 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
seqcaopr2.2 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥𝑄𝑦) ∈ 𝑆)
seqcaopr2.3 ((𝜑 ∧ ((𝑥𝑆𝑦𝑆) ∧ (𝑧𝑆𝑤𝑆))) → ((𝑥𝑄𝑧) + (𝑦𝑄𝑤)) = ((𝑥 + 𝑦)𝑄(𝑧 + 𝑤)))
seqcaopr2.4 (𝜑𝑁 ∈ (ℤ𝑀))
seq3caopr2.5 ((𝜑𝑘 ∈ (ℤ𝑀)) → (𝐹𝑘) ∈ 𝑆)
seq3caopr2.6 ((𝜑𝑘 ∈ (ℤ𝑀)) → (𝐺𝑘) ∈ 𝑆)
seq3caopr2.7 ((𝜑𝑘 ∈ (ℤ𝑀)) → (𝐻𝑘) = ((𝐹𝑘)𝑄(𝐺𝑘)))
Assertion
Ref Expression
seq3caopr2 (𝜑 → (seq𝑀( + , 𝐻)‘𝑁) = ((seq𝑀( + , 𝐹)‘𝑁)𝑄(seq𝑀( + , 𝐺)‘𝑁)))
Distinct variable groups:   𝑤, + ,𝑥,𝑦,𝑧   𝑘,𝐹,𝑤,𝑥,𝑦,𝑧   𝑘,𝐺,𝑤,𝑥,𝑦,𝑧   𝑘,𝐻,𝑥,𝑦,𝑧   𝑘,𝑀,𝑤,𝑥,𝑦,𝑧   𝑘,𝑁,𝑥,𝑦,𝑧   𝑄,𝑘,𝑤,𝑥,𝑦,𝑧   𝑆,𝑘,𝑤,𝑥,𝑦,𝑧   𝜑,𝑘,𝑤,𝑥,𝑦,𝑧
Allowed substitution hints:   + (𝑘)   𝐻(𝑤)   𝑁(𝑤)

Proof of Theorem seq3caopr2
Dummy variable 𝑛 is distinct from all other variables.
StepHypRef Expression
1 seqcaopr2.1 . 2 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
2 seqcaopr2.2 . 2 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥𝑄𝑦) ∈ 𝑆)
3 seqcaopr2.4 . 2 (𝜑𝑁 ∈ (ℤ𝑀))
4 seq3caopr2.5 . 2 ((𝜑𝑘 ∈ (ℤ𝑀)) → (𝐹𝑘) ∈ 𝑆)
5 seq3caopr2.6 . 2 ((𝜑𝑘 ∈ (ℤ𝑀)) → (𝐺𝑘) ∈ 𝑆)
6 seq3caopr2.7 . 2 ((𝜑𝑘 ∈ (ℤ𝑀)) → (𝐻𝑘) = ((𝐹𝑘)𝑄(𝐺𝑘)))
7 eqid 2140 . . . . 5 (ℤ𝑀) = (ℤ𝑀)
8 eluzel2 9354 . . . . . . 7 (𝑁 ∈ (ℤ𝑀) → 𝑀 ∈ ℤ)
93, 8syl 14 . . . . . 6 (𝜑𝑀 ∈ ℤ)
109adantr 274 . . . . 5 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → 𝑀 ∈ ℤ)
115ralrimiva 2508 . . . . . . 7 (𝜑 → ∀𝑘 ∈ (ℤ𝑀)(𝐺𝑘) ∈ 𝑆)
1211adantr 274 . . . . . 6 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → ∀𝑘 ∈ (ℤ𝑀)(𝐺𝑘) ∈ 𝑆)
13 fveq2 5428 . . . . . . . 8 (𝑘 = 𝑥 → (𝐺𝑘) = (𝐺𝑥))
1413eleq1d 2209 . . . . . . 7 (𝑘 = 𝑥 → ((𝐺𝑘) ∈ 𝑆 ↔ (𝐺𝑥) ∈ 𝑆))
1514rspccva 2791 . . . . . 6 ((∀𝑘 ∈ (ℤ𝑀)(𝐺𝑘) ∈ 𝑆𝑥 ∈ (ℤ𝑀)) → (𝐺𝑥) ∈ 𝑆)
1612, 15sylan 281 . . . . 5 (((𝜑𝑛 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (ℤ𝑀)) → (𝐺𝑥) ∈ 𝑆)
171adantlr 469 . . . . 5 (((𝜑𝑛 ∈ (𝑀..^𝑁)) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
187, 10, 16, 17seqf 10264 . . . 4 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → seq𝑀( + , 𝐺):(ℤ𝑀)⟶𝑆)
19 elfzouz 9958 . . . . 5 (𝑛 ∈ (𝑀..^𝑁) → 𝑛 ∈ (ℤ𝑀))
2019adantl 275 . . . 4 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → 𝑛 ∈ (ℤ𝑀))
2118, 20ffvelrnd 5563 . . 3 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → (seq𝑀( + , 𝐺)‘𝑛) ∈ 𝑆)
22 fzssuz 9875 . . . . 5 (𝑀...𝑁) ⊆ (ℤ𝑀)
23 fzofzp1 10034 . . . . 5 (𝑛 ∈ (𝑀..^𝑁) → (𝑛 + 1) ∈ (𝑀...𝑁))
2422, 23sseldi 3099 . . . 4 (𝑛 ∈ (𝑀..^𝑁) → (𝑛 + 1) ∈ (ℤ𝑀))
25 fveq2 5428 . . . . . 6 (𝑘 = (𝑛 + 1) → (𝐺𝑘) = (𝐺‘(𝑛 + 1)))
2625eleq1d 2209 . . . . 5 (𝑘 = (𝑛 + 1) → ((𝐺𝑘) ∈ 𝑆 ↔ (𝐺‘(𝑛 + 1)) ∈ 𝑆))
2726rspccva 2791 . . . 4 ((∀𝑘 ∈ (ℤ𝑀)(𝐺𝑘) ∈ 𝑆 ∧ (𝑛 + 1) ∈ (ℤ𝑀)) → (𝐺‘(𝑛 + 1)) ∈ 𝑆)
2811, 24, 27syl2an 287 . . 3 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → (𝐺‘(𝑛 + 1)) ∈ 𝑆)
294ralrimiva 2508 . . . . . . . 8 (𝜑 → ∀𝑘 ∈ (ℤ𝑀)(𝐹𝑘) ∈ 𝑆)
30 fveq2 5428 . . . . . . . . . 10 (𝑘 = 𝑥 → (𝐹𝑘) = (𝐹𝑥))
3130eleq1d 2209 . . . . . . . . 9 (𝑘 = 𝑥 → ((𝐹𝑘) ∈ 𝑆 ↔ (𝐹𝑥) ∈ 𝑆))
3231rspccva 2791 . . . . . . . 8 ((∀𝑘 ∈ (ℤ𝑀)(𝐹𝑘) ∈ 𝑆𝑥 ∈ (ℤ𝑀)) → (𝐹𝑥) ∈ 𝑆)
3329, 32sylan 281 . . . . . . 7 ((𝜑𝑥 ∈ (ℤ𝑀)) → (𝐹𝑥) ∈ 𝑆)
3433adantlr 469 . . . . . 6 (((𝜑𝑛 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (ℤ𝑀)) → (𝐹𝑥) ∈ 𝑆)
357, 10, 34, 17seqf 10264 . . . . 5 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → seq𝑀( + , 𝐹):(ℤ𝑀)⟶𝑆)
3635, 20ffvelrnd 5563 . . . 4 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → (seq𝑀( + , 𝐹)‘𝑛) ∈ 𝑆)
37 fveq2 5428 . . . . . . 7 (𝑘 = (𝑛 + 1) → (𝐹𝑘) = (𝐹‘(𝑛 + 1)))
3837eleq1d 2209 . . . . . 6 (𝑘 = (𝑛 + 1) → ((𝐹𝑘) ∈ 𝑆 ↔ (𝐹‘(𝑛 + 1)) ∈ 𝑆))
3938rspccva 2791 . . . . 5 ((∀𝑘 ∈ (ℤ𝑀)(𝐹𝑘) ∈ 𝑆 ∧ (𝑛 + 1) ∈ (ℤ𝑀)) → (𝐹‘(𝑛 + 1)) ∈ 𝑆)
4029, 24, 39syl2an 287 . . . 4 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → (𝐹‘(𝑛 + 1)) ∈ 𝑆)
41 seqcaopr2.3 . . . . . . . 8 ((𝜑 ∧ ((𝑥𝑆𝑦𝑆) ∧ (𝑧𝑆𝑤𝑆))) → ((𝑥𝑄𝑧) + (𝑦𝑄𝑤)) = ((𝑥 + 𝑦)𝑄(𝑧 + 𝑤)))
4241anassrs 398 . . . . . . 7 (((𝜑 ∧ (𝑥𝑆𝑦𝑆)) ∧ (𝑧𝑆𝑤𝑆)) → ((𝑥𝑄𝑧) + (𝑦𝑄𝑤)) = ((𝑥 + 𝑦)𝑄(𝑧 + 𝑤)))
4342ralrimivva 2517 . . . . . 6 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → ∀𝑧𝑆𝑤𝑆 ((𝑥𝑄𝑧) + (𝑦𝑄𝑤)) = ((𝑥 + 𝑦)𝑄(𝑧 + 𝑤)))
4443ralrimivva 2517 . . . . 5 (𝜑 → ∀𝑥𝑆𝑦𝑆𝑧𝑆𝑤𝑆 ((𝑥𝑄𝑧) + (𝑦𝑄𝑤)) = ((𝑥 + 𝑦)𝑄(𝑧 + 𝑤)))
4544adantr 274 . . . 4 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → ∀𝑥𝑆𝑦𝑆𝑧𝑆𝑤𝑆 ((𝑥𝑄𝑧) + (𝑦𝑄𝑤)) = ((𝑥 + 𝑦)𝑄(𝑧 + 𝑤)))
46 oveq1 5788 . . . . . . . 8 (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → (𝑥𝑄𝑧) = ((seq𝑀( + , 𝐹)‘𝑛)𝑄𝑧))
4746oveq1d 5796 . . . . . . 7 (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → ((𝑥𝑄𝑧) + (𝑦𝑄𝑤)) = (((seq𝑀( + , 𝐹)‘𝑛)𝑄𝑧) + (𝑦𝑄𝑤)))
48 oveq1 5788 . . . . . . . 8 (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → (𝑥 + 𝑦) = ((seq𝑀( + , 𝐹)‘𝑛) + 𝑦))
4948oveq1d 5796 . . . . . . 7 (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → ((𝑥 + 𝑦)𝑄(𝑧 + 𝑤)) = (((seq𝑀( + , 𝐹)‘𝑛) + 𝑦)𝑄(𝑧 + 𝑤)))
5047, 49eqeq12d 2155 . . . . . 6 (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → (((𝑥𝑄𝑧) + (𝑦𝑄𝑤)) = ((𝑥 + 𝑦)𝑄(𝑧 + 𝑤)) ↔ (((seq𝑀( + , 𝐹)‘𝑛)𝑄𝑧) + (𝑦𝑄𝑤)) = (((seq𝑀( + , 𝐹)‘𝑛) + 𝑦)𝑄(𝑧 + 𝑤))))
51502ralbidv 2462 . . . . 5 (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → (∀𝑧𝑆𝑤𝑆 ((𝑥𝑄𝑧) + (𝑦𝑄𝑤)) = ((𝑥 + 𝑦)𝑄(𝑧 + 𝑤)) ↔ ∀𝑧𝑆𝑤𝑆 (((seq𝑀( + , 𝐹)‘𝑛)𝑄𝑧) + (𝑦𝑄𝑤)) = (((seq𝑀( + , 𝐹)‘𝑛) + 𝑦)𝑄(𝑧 + 𝑤))))
52 oveq1 5788 . . . . . . . 8 (𝑦 = (𝐹‘(𝑛 + 1)) → (𝑦𝑄𝑤) = ((𝐹‘(𝑛 + 1))𝑄𝑤))
5352oveq2d 5797 . . . . . . 7 (𝑦 = (𝐹‘(𝑛 + 1)) → (((seq𝑀( + , 𝐹)‘𝑛)𝑄𝑧) + (𝑦𝑄𝑤)) = (((seq𝑀( + , 𝐹)‘𝑛)𝑄𝑧) + ((𝐹‘(𝑛 + 1))𝑄𝑤)))
54 oveq2 5789 . . . . . . . 8 (𝑦 = (𝐹‘(𝑛 + 1)) → ((seq𝑀( + , 𝐹)‘𝑛) + 𝑦) = ((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))))
5554oveq1d 5796 . . . . . . 7 (𝑦 = (𝐹‘(𝑛 + 1)) → (((seq𝑀( + , 𝐹)‘𝑛) + 𝑦)𝑄(𝑧 + 𝑤)) = (((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄(𝑧 + 𝑤)))
5653, 55eqeq12d 2155 . . . . . 6 (𝑦 = (𝐹‘(𝑛 + 1)) → ((((seq𝑀( + , 𝐹)‘𝑛)𝑄𝑧) + (𝑦𝑄𝑤)) = (((seq𝑀( + , 𝐹)‘𝑛) + 𝑦)𝑄(𝑧 + 𝑤)) ↔ (((seq𝑀( + , 𝐹)‘𝑛)𝑄𝑧) + ((𝐹‘(𝑛 + 1))𝑄𝑤)) = (((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄(𝑧 + 𝑤))))
57562ralbidv 2462 . . . . 5 (𝑦 = (𝐹‘(𝑛 + 1)) → (∀𝑧𝑆𝑤𝑆 (((seq𝑀( + , 𝐹)‘𝑛)𝑄𝑧) + (𝑦𝑄𝑤)) = (((seq𝑀( + , 𝐹)‘𝑛) + 𝑦)𝑄(𝑧 + 𝑤)) ↔ ∀𝑧𝑆𝑤𝑆 (((seq𝑀( + , 𝐹)‘𝑛)𝑄𝑧) + ((𝐹‘(𝑛 + 1))𝑄𝑤)) = (((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄(𝑧 + 𝑤))))
5851, 57rspc2va 2806 . . . 4 ((((seq𝑀( + , 𝐹)‘𝑛) ∈ 𝑆 ∧ (𝐹‘(𝑛 + 1)) ∈ 𝑆) ∧ ∀𝑥𝑆𝑦𝑆𝑧𝑆𝑤𝑆 ((𝑥𝑄𝑧) + (𝑦𝑄𝑤)) = ((𝑥 + 𝑦)𝑄(𝑧 + 𝑤))) → ∀𝑧𝑆𝑤𝑆 (((seq𝑀( + , 𝐹)‘𝑛)𝑄𝑧) + ((𝐹‘(𝑛 + 1))𝑄𝑤)) = (((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄(𝑧 + 𝑤)))
5936, 40, 45, 58syl21anc 1216 . . 3 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → ∀𝑧𝑆𝑤𝑆 (((seq𝑀( + , 𝐹)‘𝑛)𝑄𝑧) + ((𝐹‘(𝑛 + 1))𝑄𝑤)) = (((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄(𝑧 + 𝑤)))
60 oveq2 5789 . . . . . 6 (𝑧 = (seq𝑀( + , 𝐺)‘𝑛) → ((seq𝑀( + , 𝐹)‘𝑛)𝑄𝑧) = ((seq𝑀( + , 𝐹)‘𝑛)𝑄(seq𝑀( + , 𝐺)‘𝑛)))
6160oveq1d 5796 . . . . 5 (𝑧 = (seq𝑀( + , 𝐺)‘𝑛) → (((seq𝑀( + , 𝐹)‘𝑛)𝑄𝑧) + ((𝐹‘(𝑛 + 1))𝑄𝑤)) = (((seq𝑀( + , 𝐹)‘𝑛)𝑄(seq𝑀( + , 𝐺)‘𝑛)) + ((𝐹‘(𝑛 + 1))𝑄𝑤)))
62 oveq1 5788 . . . . . 6 (𝑧 = (seq𝑀( + , 𝐺)‘𝑛) → (𝑧 + 𝑤) = ((seq𝑀( + , 𝐺)‘𝑛) + 𝑤))
6362oveq2d 5797 . . . . 5 (𝑧 = (seq𝑀( + , 𝐺)‘𝑛) → (((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄(𝑧 + 𝑤)) = (((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄((seq𝑀( + , 𝐺)‘𝑛) + 𝑤)))
6461, 63eqeq12d 2155 . . . 4 (𝑧 = (seq𝑀( + , 𝐺)‘𝑛) → ((((seq𝑀( + , 𝐹)‘𝑛)𝑄𝑧) + ((𝐹‘(𝑛 + 1))𝑄𝑤)) = (((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄(𝑧 + 𝑤)) ↔ (((seq𝑀( + , 𝐹)‘𝑛)𝑄(seq𝑀( + , 𝐺)‘𝑛)) + ((𝐹‘(𝑛 + 1))𝑄𝑤)) = (((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄((seq𝑀( + , 𝐺)‘𝑛) + 𝑤))))
65 oveq2 5789 . . . . . 6 (𝑤 = (𝐺‘(𝑛 + 1)) → ((𝐹‘(𝑛 + 1))𝑄𝑤) = ((𝐹‘(𝑛 + 1))𝑄(𝐺‘(𝑛 + 1))))
6665oveq2d 5797 . . . . 5 (𝑤 = (𝐺‘(𝑛 + 1)) → (((seq𝑀( + , 𝐹)‘𝑛)𝑄(seq𝑀( + , 𝐺)‘𝑛)) + ((𝐹‘(𝑛 + 1))𝑄𝑤)) = (((seq𝑀( + , 𝐹)‘𝑛)𝑄(seq𝑀( + , 𝐺)‘𝑛)) + ((𝐹‘(𝑛 + 1))𝑄(𝐺‘(𝑛 + 1)))))
67 oveq2 5789 . . . . . 6 (𝑤 = (𝐺‘(𝑛 + 1)) → ((seq𝑀( + , 𝐺)‘𝑛) + 𝑤) = ((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘(𝑛 + 1))))
6867oveq2d 5797 . . . . 5 (𝑤 = (𝐺‘(𝑛 + 1)) → (((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄((seq𝑀( + , 𝐺)‘𝑛) + 𝑤)) = (((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘(𝑛 + 1)))))
6966, 68eqeq12d 2155 . . . 4 (𝑤 = (𝐺‘(𝑛 + 1)) → ((((seq𝑀( + , 𝐹)‘𝑛)𝑄(seq𝑀( + , 𝐺)‘𝑛)) + ((𝐹‘(𝑛 + 1))𝑄𝑤)) = (((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄((seq𝑀( + , 𝐺)‘𝑛) + 𝑤)) ↔ (((seq𝑀( + , 𝐹)‘𝑛)𝑄(seq𝑀( + , 𝐺)‘𝑛)) + ((𝐹‘(𝑛 + 1))𝑄(𝐺‘(𝑛 + 1)))) = (((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘(𝑛 + 1))))))
7064, 69rspc2va 2806 . . 3 ((((seq𝑀( + , 𝐺)‘𝑛) ∈ 𝑆 ∧ (𝐺‘(𝑛 + 1)) ∈ 𝑆) ∧ ∀𝑧𝑆𝑤𝑆 (((seq𝑀( + , 𝐹)‘𝑛)𝑄𝑧) + ((𝐹‘(𝑛 + 1))𝑄𝑤)) = (((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄(𝑧 + 𝑤))) → (((seq𝑀( + , 𝐹)‘𝑛)𝑄(seq𝑀( + , 𝐺)‘𝑛)) + ((𝐹‘(𝑛 + 1))𝑄(𝐺‘(𝑛 + 1)))) = (((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘(𝑛 + 1)))))
7121, 28, 59, 70syl21anc 1216 . 2 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → (((seq𝑀( + , 𝐹)‘𝑛)𝑄(seq𝑀( + , 𝐺)‘𝑛)) + ((𝐹‘(𝑛 + 1))𝑄(𝐺‘(𝑛 + 1)))) = (((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄((seq𝑀( + , 𝐺)‘𝑛) + (𝐺‘(𝑛 + 1)))))
721, 2, 3, 4, 5, 6, 71seq3caopr3 10284 1 (𝜑 → (seq𝑀( + , 𝐻)‘𝑁) = ((seq𝑀( + , 𝐹)‘𝑁)𝑄(seq𝑀( + , 𝐺)‘𝑁)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103   = wceq 1332  wcel 1481  wral 2417  cfv 5130  (class class class)co 5781  1c1 7644   + caddc 7646  cz 9077  cuz 9349  ...cfz 9820  ..^cfzo 9949  seqcseq 10248
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-coll 4050  ax-sep 4053  ax-nul 4061  ax-pow 4105  ax-pr 4138  ax-un 4362  ax-setind 4459  ax-iinf 4509  ax-cnex 7734  ax-resscn 7735  ax-1cn 7736  ax-1re 7737  ax-icn 7738  ax-addcl 7739  ax-addrcl 7740  ax-mulcl 7741  ax-addcom 7743  ax-addass 7745  ax-distr 7747  ax-i2m1 7748  ax-0lt1 7749  ax-0id 7751  ax-rnegex 7752  ax-cnre 7754  ax-pre-ltirr 7755  ax-pre-ltwlin 7756  ax-pre-lttrn 7757  ax-pre-ltadd 7759
This theorem depends on definitions:  df-bi 116  df-3or 964  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-nel 2405  df-ral 2422  df-rex 2423  df-reu 2424  df-rab 2426  df-v 2691  df-sbc 2913  df-csb 3007  df-dif 3077  df-un 3079  df-in 3081  df-ss 3088  df-nul 3368  df-pw 3516  df-sn 3537  df-pr 3538  df-op 3540  df-uni 3744  df-int 3779  df-iun 3822  df-br 3937  df-opab 3997  df-mpt 3998  df-tr 4034  df-id 4222  df-iord 4295  df-on 4297  df-ilim 4298  df-suc 4300  df-iom 4512  df-xp 4552  df-rel 4553  df-cnv 4554  df-co 4555  df-dm 4556  df-rn 4557  df-res 4558  df-ima 4559  df-iota 5095  df-fun 5132  df-fn 5133  df-f 5134  df-f1 5135  df-fo 5136  df-f1o 5137  df-fv 5138  df-riota 5737  df-ov 5784  df-oprab 5785  df-mpo 5786  df-1st 6045  df-2nd 6046  df-recs 6209  df-frec 6295  df-pnf 7825  df-mnf 7826  df-xr 7827  df-ltxr 7828  df-le 7829  df-sub 7958  df-neg 7959  df-inn 8744  df-n0 9001  df-z 9078  df-uz 9350  df-fz 9821  df-fzo 9950  df-seqfrec 10249
This theorem is referenced by:  seq3caopr  10286  ser3sub  10309
  Copyright terms: Public domain W3C validator