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

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

Proof of Theorem iseqcaopr2
Dummy variable 𝑛 is distinct from all other variables.
StepHypRef Expression
1 iseqcaopr2.1 . 2 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
2 iseqcaopr2.2 . 2 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥𝑄𝑦) ∈ 𝑆)
3 iseqcaopr2.4 . 2 (𝜑𝑁 ∈ (ℤ𝑀))
4 iseqcaopr2.5 . 2 ((𝜑𝑘 ∈ (ℤ𝑀)) → (𝐹𝑘) ∈ 𝑆)
5 iseqcaopr2.6 . 2 ((𝜑𝑘 ∈ (ℤ𝑀)) → (𝐺𝑘) ∈ 𝑆)
6 iseqcaopr2.7 . 2 ((𝜑𝑘 ∈ (ℤ𝑀)) → (𝐻𝑘) = ((𝐹𝑘)𝑄(𝐺𝑘)))
7 elfzouz 8951 . . . . 5 (𝑛 ∈ (𝑀..^𝑁) → 𝑛 ∈ (ℤ𝑀))
87adantl 262 . . . 4 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → 𝑛 ∈ (ℤ𝑀))
9 iseqcaopr2.s . . . . 5 (𝜑𝑆𝑉)
109adantr 261 . . . 4 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → 𝑆𝑉)
115ralrimiva 2389 . . . . . 6 (𝜑 → ∀𝑘 ∈ (ℤ𝑀)(𝐺𝑘) ∈ 𝑆)
1211adantr 261 . . . . 5 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → ∀𝑘 ∈ (ℤ𝑀)(𝐺𝑘) ∈ 𝑆)
13 fveq2 5141 . . . . . . 7 (𝑘 = 𝑥 → (𝐺𝑘) = (𝐺𝑥))
1413eleq1d 2106 . . . . . 6 (𝑘 = 𝑥 → ((𝐺𝑘) ∈ 𝑆 ↔ (𝐺𝑥) ∈ 𝑆))
1514rspccva 2652 . . . . 5 ((∀𝑘 ∈ (ℤ𝑀)(𝐺𝑘) ∈ 𝑆𝑥 ∈ (ℤ𝑀)) → (𝐺𝑥) ∈ 𝑆)
1612, 15sylan 267 . . . 4 (((𝜑𝑛 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (ℤ𝑀)) → (𝐺𝑥) ∈ 𝑆)
171adantlr 446 . . . 4 (((𝜑𝑛 ∈ (𝑀..^𝑁)) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
188, 10, 16, 17iseqcl 9077 . . 3 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → (seq𝑀( + , 𝐺, 𝑆)‘𝑛) ∈ 𝑆)
19 fzssuz 8871 . . . . 5 (𝑀...𝑁) ⊆ (ℤ𝑀)
20 fzofzp1 9026 . . . . 5 (𝑛 ∈ (𝑀..^𝑁) → (𝑛 + 1) ∈ (𝑀...𝑁))
2119, 20sseldi 2940 . . . 4 (𝑛 ∈ (𝑀..^𝑁) → (𝑛 + 1) ∈ (ℤ𝑀))
22 fveq2 5141 . . . . . 6 (𝑘 = (𝑛 + 1) → (𝐺𝑘) = (𝐺‘(𝑛 + 1)))
2322eleq1d 2106 . . . . 5 (𝑘 = (𝑛 + 1) → ((𝐺𝑘) ∈ 𝑆 ↔ (𝐺‘(𝑛 + 1)) ∈ 𝑆))
2423rspccva 2652 . . . 4 ((∀𝑘 ∈ (ℤ𝑀)(𝐺𝑘) ∈ 𝑆 ∧ (𝑛 + 1) ∈ (ℤ𝑀)) → (𝐺‘(𝑛 + 1)) ∈ 𝑆)
2511, 21, 24syl2an 273 . . 3 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → (𝐺‘(𝑛 + 1)) ∈ 𝑆)
264ralrimiva 2389 . . . . . . 7 (𝜑 → ∀𝑘 ∈ (ℤ𝑀)(𝐹𝑘) ∈ 𝑆)
27 fveq2 5141 . . . . . . . . 9 (𝑘 = 𝑥 → (𝐹𝑘) = (𝐹𝑥))
2827eleq1d 2106 . . . . . . . 8 (𝑘 = 𝑥 → ((𝐹𝑘) ∈ 𝑆 ↔ (𝐹𝑥) ∈ 𝑆))
2928rspccva 2652 . . . . . . 7 ((∀𝑘 ∈ (ℤ𝑀)(𝐹𝑘) ∈ 𝑆𝑥 ∈ (ℤ𝑀)) → (𝐹𝑥) ∈ 𝑆)
3026, 29sylan 267 . . . . . 6 ((𝜑𝑥 ∈ (ℤ𝑀)) → (𝐹𝑥) ∈ 𝑆)
3130adantlr 446 . . . . 5 (((𝜑𝑛 ∈ (𝑀..^𝑁)) ∧ 𝑥 ∈ (ℤ𝑀)) → (𝐹𝑥) ∈ 𝑆)
328, 10, 31, 17iseqcl 9077 . . . 4 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → (seq𝑀( + , 𝐹, 𝑆)‘𝑛) ∈ 𝑆)
33 fveq2 5141 . . . . . . 7 (𝑘 = (𝑛 + 1) → (𝐹𝑘) = (𝐹‘(𝑛 + 1)))
3433eleq1d 2106 . . . . . 6 (𝑘 = (𝑛 + 1) → ((𝐹𝑘) ∈ 𝑆 ↔ (𝐹‘(𝑛 + 1)) ∈ 𝑆))
3534rspccva 2652 . . . . 5 ((∀𝑘 ∈ (ℤ𝑀)(𝐹𝑘) ∈ 𝑆 ∧ (𝑛 + 1) ∈ (ℤ𝑀)) → (𝐹‘(𝑛 + 1)) ∈ 𝑆)
3626, 21, 35syl2an 273 . . . 4 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → (𝐹‘(𝑛 + 1)) ∈ 𝑆)
37 iseqcaopr2.3 . . . . . . . 8 ((𝜑 ∧ ((𝑥𝑆𝑦𝑆) ∧ (𝑧𝑆𝑤𝑆))) → ((𝑥𝑄𝑧) + (𝑦𝑄𝑤)) = ((𝑥 + 𝑦)𝑄(𝑧 + 𝑤)))
3837anassrs 380 . . . . . . 7 (((𝜑 ∧ (𝑥𝑆𝑦𝑆)) ∧ (𝑧𝑆𝑤𝑆)) → ((𝑥𝑄𝑧) + (𝑦𝑄𝑤)) = ((𝑥 + 𝑦)𝑄(𝑧 + 𝑤)))
3938ralrimivva 2398 . . . . . 6 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → ∀𝑧𝑆𝑤𝑆 ((𝑥𝑄𝑧) + (𝑦𝑄𝑤)) = ((𝑥 + 𝑦)𝑄(𝑧 + 𝑤)))
4039ralrimivva 2398 . . . . 5 (𝜑 → ∀𝑥𝑆𝑦𝑆𝑧𝑆𝑤𝑆 ((𝑥𝑄𝑧) + (𝑦𝑄𝑤)) = ((𝑥 + 𝑦)𝑄(𝑧 + 𝑤)))
4140adantr 261 . . . 4 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → ∀𝑥𝑆𝑦𝑆𝑧𝑆𝑤𝑆 ((𝑥𝑄𝑧) + (𝑦𝑄𝑤)) = ((𝑥 + 𝑦)𝑄(𝑧 + 𝑤)))
42 oveq1 5482 . . . . . . . 8 (𝑥 = (seq𝑀( + , 𝐹, 𝑆)‘𝑛) → (𝑥𝑄𝑧) = ((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄𝑧))
4342oveq1d 5490 . . . . . . 7 (𝑥 = (seq𝑀( + , 𝐹, 𝑆)‘𝑛) → ((𝑥𝑄𝑧) + (𝑦𝑄𝑤)) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄𝑧) + (𝑦𝑄𝑤)))
44 oveq1 5482 . . . . . . . 8 (𝑥 = (seq𝑀( + , 𝐹, 𝑆)‘𝑛) → (𝑥 + 𝑦) = ((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + 𝑦))
4544oveq1d 5490 . . . . . . 7 (𝑥 = (seq𝑀( + , 𝐹, 𝑆)‘𝑛) → ((𝑥 + 𝑦)𝑄(𝑧 + 𝑤)) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + 𝑦)𝑄(𝑧 + 𝑤)))
4643, 45eqeq12d 2054 . . . . . 6 (𝑥 = (seq𝑀( + , 𝐹, 𝑆)‘𝑛) → (((𝑥𝑄𝑧) + (𝑦𝑄𝑤)) = ((𝑥 + 𝑦)𝑄(𝑧 + 𝑤)) ↔ (((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄𝑧) + (𝑦𝑄𝑤)) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + 𝑦)𝑄(𝑧 + 𝑤))))
47462ralbidv 2345 . . . . 5 (𝑥 = (seq𝑀( + , 𝐹, 𝑆)‘𝑛) → (∀𝑧𝑆𝑤𝑆 ((𝑥𝑄𝑧) + (𝑦𝑄𝑤)) = ((𝑥 + 𝑦)𝑄(𝑧 + 𝑤)) ↔ ∀𝑧𝑆𝑤𝑆 (((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄𝑧) + (𝑦𝑄𝑤)) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + 𝑦)𝑄(𝑧 + 𝑤))))
48 oveq1 5482 . . . . . . . 8 (𝑦 = (𝐹‘(𝑛 + 1)) → (𝑦𝑄𝑤) = ((𝐹‘(𝑛 + 1))𝑄𝑤))
4948oveq2d 5491 . . . . . . 7 (𝑦 = (𝐹‘(𝑛 + 1)) → (((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄𝑧) + (𝑦𝑄𝑤)) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄𝑧) + ((𝐹‘(𝑛 + 1))𝑄𝑤)))
50 oveq2 5483 . . . . . . . 8 (𝑦 = (𝐹‘(𝑛 + 1)) → ((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + 𝑦) = ((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + (𝐹‘(𝑛 + 1))))
5150oveq1d 5490 . . . . . . 7 (𝑦 = (𝐹‘(𝑛 + 1)) → (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + 𝑦)𝑄(𝑧 + 𝑤)) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄(𝑧 + 𝑤)))
5249, 51eqeq12d 2054 . . . . . 6 (𝑦 = (𝐹‘(𝑛 + 1)) → ((((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄𝑧) + (𝑦𝑄𝑤)) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + 𝑦)𝑄(𝑧 + 𝑤)) ↔ (((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄𝑧) + ((𝐹‘(𝑛 + 1))𝑄𝑤)) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄(𝑧 + 𝑤))))
53522ralbidv 2345 . . . . 5 (𝑦 = (𝐹‘(𝑛 + 1)) → (∀𝑧𝑆𝑤𝑆 (((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄𝑧) + (𝑦𝑄𝑤)) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + 𝑦)𝑄(𝑧 + 𝑤)) ↔ ∀𝑧𝑆𝑤𝑆 (((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄𝑧) + ((𝐹‘(𝑛 + 1))𝑄𝑤)) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄(𝑧 + 𝑤))))
5447, 53rspc2va 2660 . . . 4 ((((seq𝑀( + , 𝐹, 𝑆)‘𝑛) ∈ 𝑆 ∧ (𝐹‘(𝑛 + 1)) ∈ 𝑆) ∧ ∀𝑥𝑆𝑦𝑆𝑧𝑆𝑤𝑆 ((𝑥𝑄𝑧) + (𝑦𝑄𝑤)) = ((𝑥 + 𝑦)𝑄(𝑧 + 𝑤))) → ∀𝑧𝑆𝑤𝑆 (((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄𝑧) + ((𝐹‘(𝑛 + 1))𝑄𝑤)) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄(𝑧 + 𝑤)))
5532, 36, 41, 54syl21anc 1134 . . 3 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → ∀𝑧𝑆𝑤𝑆 (((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄𝑧) + ((𝐹‘(𝑛 + 1))𝑄𝑤)) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄(𝑧 + 𝑤)))
56 oveq2 5483 . . . . . 6 (𝑧 = (seq𝑀( + , 𝐺, 𝑆)‘𝑛) → ((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄𝑧) = ((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄(seq𝑀( + , 𝐺, 𝑆)‘𝑛)))
5756oveq1d 5490 . . . . 5 (𝑧 = (seq𝑀( + , 𝐺, 𝑆)‘𝑛) → (((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄𝑧) + ((𝐹‘(𝑛 + 1))𝑄𝑤)) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄(seq𝑀( + , 𝐺, 𝑆)‘𝑛)) + ((𝐹‘(𝑛 + 1))𝑄𝑤)))
58 oveq1 5482 . . . . . 6 (𝑧 = (seq𝑀( + , 𝐺, 𝑆)‘𝑛) → (𝑧 + 𝑤) = ((seq𝑀( + , 𝐺, 𝑆)‘𝑛) + 𝑤))
5958oveq2d 5491 . . . . 5 (𝑧 = (seq𝑀( + , 𝐺, 𝑆)‘𝑛) → (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄(𝑧 + 𝑤)) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄((seq𝑀( + , 𝐺, 𝑆)‘𝑛) + 𝑤)))
6057, 59eqeq12d 2054 . . . 4 (𝑧 = (seq𝑀( + , 𝐺, 𝑆)‘𝑛) → ((((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄𝑧) + ((𝐹‘(𝑛 + 1))𝑄𝑤)) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄(𝑧 + 𝑤)) ↔ (((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄(seq𝑀( + , 𝐺, 𝑆)‘𝑛)) + ((𝐹‘(𝑛 + 1))𝑄𝑤)) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄((seq𝑀( + , 𝐺, 𝑆)‘𝑛) + 𝑤))))
61 oveq2 5483 . . . . . 6 (𝑤 = (𝐺‘(𝑛 + 1)) → ((𝐹‘(𝑛 + 1))𝑄𝑤) = ((𝐹‘(𝑛 + 1))𝑄(𝐺‘(𝑛 + 1))))
6261oveq2d 5491 . . . . 5 (𝑤 = (𝐺‘(𝑛 + 1)) → (((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄(seq𝑀( + , 𝐺, 𝑆)‘𝑛)) + ((𝐹‘(𝑛 + 1))𝑄𝑤)) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄(seq𝑀( + , 𝐺, 𝑆)‘𝑛)) + ((𝐹‘(𝑛 + 1))𝑄(𝐺‘(𝑛 + 1)))))
63 oveq2 5483 . . . . . 6 (𝑤 = (𝐺‘(𝑛 + 1)) → ((seq𝑀( + , 𝐺, 𝑆)‘𝑛) + 𝑤) = ((seq𝑀( + , 𝐺, 𝑆)‘𝑛) + (𝐺‘(𝑛 + 1))))
6463oveq2d 5491 . . . . 5 (𝑤 = (𝐺‘(𝑛 + 1)) → (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄((seq𝑀( + , 𝐺, 𝑆)‘𝑛) + 𝑤)) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄((seq𝑀( + , 𝐺, 𝑆)‘𝑛) + (𝐺‘(𝑛 + 1)))))
6562, 64eqeq12d 2054 . . . 4 (𝑤 = (𝐺‘(𝑛 + 1)) → ((((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄(seq𝑀( + , 𝐺, 𝑆)‘𝑛)) + ((𝐹‘(𝑛 + 1))𝑄𝑤)) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄((seq𝑀( + , 𝐺, 𝑆)‘𝑛) + 𝑤)) ↔ (((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄(seq𝑀( + , 𝐺, 𝑆)‘𝑛)) + ((𝐹‘(𝑛 + 1))𝑄(𝐺‘(𝑛 + 1)))) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄((seq𝑀( + , 𝐺, 𝑆)‘𝑛) + (𝐺‘(𝑛 + 1))))))
6660, 65rspc2va 2660 . . 3 ((((seq𝑀( + , 𝐺, 𝑆)‘𝑛) ∈ 𝑆 ∧ (𝐺‘(𝑛 + 1)) ∈ 𝑆) ∧ ∀𝑧𝑆𝑤𝑆 (((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄𝑧) + ((𝐹‘(𝑛 + 1))𝑄𝑤)) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄(𝑧 + 𝑤))) → (((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄(seq𝑀( + , 𝐺, 𝑆)‘𝑛)) + ((𝐹‘(𝑛 + 1))𝑄(𝐺‘(𝑛 + 1)))) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄((seq𝑀( + , 𝐺, 𝑆)‘𝑛) + (𝐺‘(𝑛 + 1)))))
6718, 25, 55, 66syl21anc 1134 . 2 ((𝜑𝑛 ∈ (𝑀..^𝑁)) → (((seq𝑀( + , 𝐹, 𝑆)‘𝑛)𝑄(seq𝑀( + , 𝐺, 𝑆)‘𝑛)) + ((𝐹‘(𝑛 + 1))𝑄(𝐺‘(𝑛 + 1)))) = (((seq𝑀( + , 𝐹, 𝑆)‘𝑛) + (𝐹‘(𝑛 + 1)))𝑄((seq𝑀( + , 𝐺, 𝑆)‘𝑛) + (𝐺‘(𝑛 + 1)))))
681, 2, 3, 4, 5, 6, 67, 9iseqcaopr3 9094 1 (𝜑 → (seq𝑀( + , 𝐻, 𝑆)‘𝑁) = ((seq𝑀( + , 𝐹, 𝑆)‘𝑁)𝑄(seq𝑀( + , 𝐺, 𝑆)‘𝑁)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 97   = wceq 1243  wcel 1393  wral 2303  cfv 4865  (class class class)co 5475  1c1 6847   + caddc 6849  cuz 8421  ...cfz 8817  ..^cfzo 8942  seqcseq 9065
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-coll 3869  ax-sep 3872  ax-nul 3880  ax-pow 3924  ax-pr 3941  ax-un 4142  ax-setind 4232  ax-iinf 4274  ax-cnex 6932  ax-resscn 6933  ax-1cn 6934  ax-1re 6935  ax-icn 6936  ax-addcl 6937  ax-addrcl 6938  ax-mulcl 6939  ax-addcom 6941  ax-addass 6943  ax-distr 6945  ax-i2m1 6946  ax-0id 6949  ax-rnegex 6950  ax-cnre 6952  ax-pre-ltirr 6953  ax-pre-ltwlin 6954  ax-pre-lttrn 6955  ax-pre-ltadd 6957
This theorem depends on definitions:  df-bi 110  df-dc 743  df-3or 886  df-3an 887  df-tru 1246  df-fal 1249  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-nel 2207  df-ral 2308  df-rex 2309  df-reu 2310  df-rab 2312  df-v 2556  df-sbc 2762  df-csb 2850  df-dif 2917  df-un 2919  df-in 2921  df-ss 2928  df-nul 3222  df-pw 3358  df-sn 3378  df-pr 3379  df-op 3381  df-uni 3578  df-int 3613  df-iun 3656  df-br 3762  df-opab 3816  df-mpt 3817  df-tr 3852  df-eprel 4023  df-id 4027  df-po 4030  df-iso 4031  df-iord 4075  df-on 4077  df-suc 4080  df-iom 4277  df-xp 4314  df-rel 4315  df-cnv 4316  df-co 4317  df-dm 4318  df-rn 4319  df-res 4320  df-ima 4321  df-iota 4830  df-fun 4867  df-fn 4868  df-f 4869  df-f1 4870  df-fo 4871  df-f1o 4872  df-fv 4873  df-riota 5431  df-ov 5478  df-oprab 5479  df-mpt2 5480  df-1st 5730  df-2nd 5731  df-recs 5883  df-irdg 5920  df-frec 5941  df-1o 5964  df-2o 5965  df-oadd 5968  df-omul 5969  df-er 6069  df-ec 6071  df-qs 6075  df-ni 6359  df-pli 6360  df-mi 6361  df-lti 6362  df-plpq 6399  df-mpq 6400  df-enq 6402  df-nqqs 6403  df-plqqs 6404  df-mqqs 6405  df-1nqqs 6406  df-rq 6407  df-ltnqqs 6408  df-enq0 6479  df-nq0 6480  df-0nq0 6481  df-plq0 6482  df-mq0 6483  df-inp 6521  df-i1p 6522  df-iplp 6523  df-iltp 6525  df-enr 6768  df-nr 6769  df-ltr 6772  df-0r 6773  df-1r 6774  df-0 6853  df-1 6854  df-r 6856  df-lt 6859  df-pnf 7018  df-mnf 7019  df-xr 7020  df-ltxr 7021  df-le 7022  df-sub 7140  df-neg 7141  df-inn 7867  df-n0 8130  df-z 8194  df-uz 8422  df-fz 8818  df-fzo 8943  df-iseq 9066
This theorem is referenced by:  iseqcaopr  9096  isersub  9098
  Copyright terms: Public domain W3C validator