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

Theorem seqfeq3 10468
Description: Equality of series under different addition operations which agree on an additively closed subset. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by Mario Carneiro, 25-Apr-2016.)
Hypotheses
Ref Expression
seqfeq3.m (𝜑𝑀 ∈ ℤ)
seqfeq3.f ((𝜑𝑥 ∈ (ℤ𝑀)) → (𝐹𝑥) ∈ 𝑆)
seqfeq3.cl ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
seqfeq3.id ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) = (𝑥𝑄𝑦))
Assertion
Ref Expression
seqfeq3 (𝜑 → seq𝑀( + , 𝐹) = seq𝑀(𝑄, 𝐹))
Distinct variable groups:   𝜑,𝑥,𝑦   𝑥,𝐹,𝑦   𝑥,𝑀,𝑦   𝑥, + ,𝑦   𝑥,𝑄,𝑦   𝑥,𝑆,𝑦

Proof of Theorem seqfeq3
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 eqid 2170 . . . 4 (ℤ𝑀) = (ℤ𝑀)
2 seqfeq3.m . . . 4 (𝜑𝑀 ∈ ℤ)
3 seqfeq3.f . . . 4 ((𝜑𝑥 ∈ (ℤ𝑀)) → (𝐹𝑥) ∈ 𝑆)
4 seqfeq3.cl . . . 4 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
51, 2, 3, 4seqf 10417 . . 3 (𝜑 → seq𝑀( + , 𝐹):(ℤ𝑀)⟶𝑆)
65ffnd 5348 . 2 (𝜑 → seq𝑀( + , 𝐹) Fn (ℤ𝑀))
7 seqfeq3.id . . . . 5 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) = (𝑥𝑄𝑦))
87, 4eqeltrrd 2248 . . . 4 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥𝑄𝑦) ∈ 𝑆)
91, 2, 3, 8seqf 10417 . . 3 (𝜑 → seq𝑀(𝑄, 𝐹):(ℤ𝑀)⟶𝑆)
109ffnd 5348 . 2 (𝜑 → seq𝑀(𝑄, 𝐹) Fn (ℤ𝑀))
115ffvelrnda 5631 . . . 4 ((𝜑𝑎 ∈ (ℤ𝑀)) → (seq𝑀( + , 𝐹)‘𝑎) ∈ 𝑆)
12 fvi 5553 . . . 4 ((seq𝑀( + , 𝐹)‘𝑎) ∈ 𝑆 → ( I ‘(seq𝑀( + , 𝐹)‘𝑎)) = (seq𝑀( + , 𝐹)‘𝑎))
1311, 12syl 14 . . 3 ((𝜑𝑎 ∈ (ℤ𝑀)) → ( I ‘(seq𝑀( + , 𝐹)‘𝑎)) = (seq𝑀( + , 𝐹)‘𝑎))
144adantlr 474 . . . 4 (((𝜑𝑎 ∈ (ℤ𝑀)) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
153adantlr 474 . . . 4 (((𝜑𝑎 ∈ (ℤ𝑀)) ∧ 𝑥 ∈ (ℤ𝑀)) → (𝐹𝑥) ∈ 𝑆)
16 simpr 109 . . . 4 ((𝜑𝑎 ∈ (ℤ𝑀)) → 𝑎 ∈ (ℤ𝑀))
177adantlr 474 . . . . 5 (((𝜑𝑎 ∈ (ℤ𝑀)) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) = (𝑥𝑄𝑦))
18 fvi 5553 . . . . . 6 ((𝑥 + 𝑦) ∈ 𝑆 → ( I ‘(𝑥 + 𝑦)) = (𝑥 + 𝑦))
1914, 18syl 14 . . . . 5 (((𝜑𝑎 ∈ (ℤ𝑀)) ∧ (𝑥𝑆𝑦𝑆)) → ( I ‘(𝑥 + 𝑦)) = (𝑥 + 𝑦))
20 fvi 5553 . . . . . . 7 (𝑥𝑆 → ( I ‘𝑥) = 𝑥)
2120ad2antrl 487 . . . . . 6 (((𝜑𝑎 ∈ (ℤ𝑀)) ∧ (𝑥𝑆𝑦𝑆)) → ( I ‘𝑥) = 𝑥)
22 fvi 5553 . . . . . . 7 (𝑦𝑆 → ( I ‘𝑦) = 𝑦)
2322ad2antll 488 . . . . . 6 (((𝜑𝑎 ∈ (ℤ𝑀)) ∧ (𝑥𝑆𝑦𝑆)) → ( I ‘𝑦) = 𝑦)
2421, 23oveq12d 5871 . . . . 5 (((𝜑𝑎 ∈ (ℤ𝑀)) ∧ (𝑥𝑆𝑦𝑆)) → (( I ‘𝑥)𝑄( I ‘𝑦)) = (𝑥𝑄𝑦))
2517, 19, 243eqtr4d 2213 . . . 4 (((𝜑𝑎 ∈ (ℤ𝑀)) ∧ (𝑥𝑆𝑦𝑆)) → ( I ‘(𝑥 + 𝑦)) = (( I ‘𝑥)𝑄( I ‘𝑦)))
26 fvi 5553 . . . . 5 ((𝐹𝑥) ∈ 𝑆 → ( I ‘(𝐹𝑥)) = (𝐹𝑥))
2715, 26syl 14 . . . 4 (((𝜑𝑎 ∈ (ℤ𝑀)) ∧ 𝑥 ∈ (ℤ𝑀)) → ( I ‘(𝐹𝑥)) = (𝐹𝑥))
288adantlr 474 . . . 4 (((𝜑𝑎 ∈ (ℤ𝑀)) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥𝑄𝑦) ∈ 𝑆)
2914, 15, 16, 25, 27, 15, 28seq3homo 10466 . . 3 ((𝜑𝑎 ∈ (ℤ𝑀)) → ( I ‘(seq𝑀( + , 𝐹)‘𝑎)) = (seq𝑀(𝑄, 𝐹)‘𝑎))
3013, 29eqtr3d 2205 . 2 ((𝜑𝑎 ∈ (ℤ𝑀)) → (seq𝑀( + , 𝐹)‘𝑎) = (seq𝑀(𝑄, 𝐹)‘𝑎))
316, 10, 30eqfnfvd 5596 1 (𝜑 → seq𝑀( + , 𝐹) = seq𝑀(𝑄, 𝐹))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103   = wceq 1348  wcel 2141   I cid 4273  cfv 5198  (class class class)co 5853  cz 9212  cuz 9487  seqcseq 10401
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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4104  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-iinf 4572  ax-cnex 7865  ax-resscn 7866  ax-1cn 7867  ax-1re 7868  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-addcom 7874  ax-addass 7876  ax-distr 7878  ax-i2m1 7879  ax-0lt1 7880  ax-0id 7882  ax-rnegex 7883  ax-cnre 7885  ax-pre-ltirr 7886  ax-pre-ltwlin 7887  ax-pre-lttrn 7888  ax-pre-ltadd 7890
This theorem depends on definitions:  df-bi 116  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-reu 2455  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-id 4278  df-iord 4351  df-on 4353  df-ilim 4354  df-suc 4356  df-iom 4575  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-1st 6119  df-2nd 6120  df-recs 6284  df-frec 6370  df-pnf 7956  df-mnf 7957  df-xr 7958  df-ltxr 7959  df-le 7960  df-sub 8092  df-neg 8093  df-inn 8879  df-n0 9136  df-z 9213  df-uz 9488  df-seqfrec 10402
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator