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

Theorem seqfeq3 10288
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 2139 . . . 4 (ℤ𝑀) = (ℤ𝑀)
2 seqfeq3.m . . . 4 (𝜑𝑀 ∈ ℤ)
3 seqfeq3.f . . . 4 ((𝜑𝑥 ∈ (ℤ𝑀)) → (𝐹𝑥) ∈ 𝑆)
4 seqfeq3.cl . . . 4 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
51, 2, 3, 4seqf 10237 . . 3 (𝜑 → seq𝑀( + , 𝐹):(ℤ𝑀)⟶𝑆)
65ffnd 5273 . 2 (𝜑 → seq𝑀( + , 𝐹) Fn (ℤ𝑀))
7 seqfeq3.id . . . . 5 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) = (𝑥𝑄𝑦))
87, 4eqeltrrd 2217 . . . 4 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥𝑄𝑦) ∈ 𝑆)
91, 2, 3, 8seqf 10237 . . 3 (𝜑 → seq𝑀(𝑄, 𝐹):(ℤ𝑀)⟶𝑆)
109ffnd 5273 . 2 (𝜑 → seq𝑀(𝑄, 𝐹) Fn (ℤ𝑀))
115ffvelrnda 5555 . . . 4 ((𝜑𝑎 ∈ (ℤ𝑀)) → (seq𝑀( + , 𝐹)‘𝑎) ∈ 𝑆)
12 fvi 5478 . . . 4 ((seq𝑀( + , 𝐹)‘𝑎) ∈ 𝑆 → ( I ‘(seq𝑀( + , 𝐹)‘𝑎)) = (seq𝑀( + , 𝐹)‘𝑎))
1311, 12syl 14 . . 3 ((𝜑𝑎 ∈ (ℤ𝑀)) → ( I ‘(seq𝑀( + , 𝐹)‘𝑎)) = (seq𝑀( + , 𝐹)‘𝑎))
144adantlr 468 . . . 4 (((𝜑𝑎 ∈ (ℤ𝑀)) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
153adantlr 468 . . . 4 (((𝜑𝑎 ∈ (ℤ𝑀)) ∧ 𝑥 ∈ (ℤ𝑀)) → (𝐹𝑥) ∈ 𝑆)
16 simpr 109 . . . 4 ((𝜑𝑎 ∈ (ℤ𝑀)) → 𝑎 ∈ (ℤ𝑀))
177adantlr 468 . . . . 5 (((𝜑𝑎 ∈ (ℤ𝑀)) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) = (𝑥𝑄𝑦))
18 fvi 5478 . . . . . 6 ((𝑥 + 𝑦) ∈ 𝑆 → ( I ‘(𝑥 + 𝑦)) = (𝑥 + 𝑦))
1914, 18syl 14 . . . . 5 (((𝜑𝑎 ∈ (ℤ𝑀)) ∧ (𝑥𝑆𝑦𝑆)) → ( I ‘(𝑥 + 𝑦)) = (𝑥 + 𝑦))
20 fvi 5478 . . . . . . 7 (𝑥𝑆 → ( I ‘𝑥) = 𝑥)
2120ad2antrl 481 . . . . . 6 (((𝜑𝑎 ∈ (ℤ𝑀)) ∧ (𝑥𝑆𝑦𝑆)) → ( I ‘𝑥) = 𝑥)
22 fvi 5478 . . . . . . 7 (𝑦𝑆 → ( I ‘𝑦) = 𝑦)
2322ad2antll 482 . . . . . 6 (((𝜑𝑎 ∈ (ℤ𝑀)) ∧ (𝑥𝑆𝑦𝑆)) → ( I ‘𝑦) = 𝑦)
2421, 23oveq12d 5792 . . . . 5 (((𝜑𝑎 ∈ (ℤ𝑀)) ∧ (𝑥𝑆𝑦𝑆)) → (( I ‘𝑥)𝑄( I ‘𝑦)) = (𝑥𝑄𝑦))
2517, 19, 243eqtr4d 2182 . . . 4 (((𝜑𝑎 ∈ (ℤ𝑀)) ∧ (𝑥𝑆𝑦𝑆)) → ( I ‘(𝑥 + 𝑦)) = (( I ‘𝑥)𝑄( I ‘𝑦)))
26 fvi 5478 . . . . 5 ((𝐹𝑥) ∈ 𝑆 → ( I ‘(𝐹𝑥)) = (𝐹𝑥))
2715, 26syl 14 . . . 4 (((𝜑𝑎 ∈ (ℤ𝑀)) ∧ 𝑥 ∈ (ℤ𝑀)) → ( I ‘(𝐹𝑥)) = (𝐹𝑥))
288adantlr 468 . . . 4 (((𝜑𝑎 ∈ (ℤ𝑀)) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥𝑄𝑦) ∈ 𝑆)
2914, 15, 16, 25, 27, 15, 28seq3homo 10286 . . 3 ((𝜑𝑎 ∈ (ℤ𝑀)) → ( I ‘(seq𝑀( + , 𝐹)‘𝑎)) = (seq𝑀(𝑄, 𝐹)‘𝑎))
3013, 29eqtr3d 2174 . 2 ((𝜑𝑎 ∈ (ℤ𝑀)) → (seq𝑀( + , 𝐹)‘𝑎) = (seq𝑀(𝑄, 𝐹)‘𝑎))
316, 10, 30eqfnfvd 5521 1 (𝜑 → seq𝑀( + , 𝐹) = seq𝑀(𝑄, 𝐹))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103   = wceq 1331  wcel 1480   I cid 4210  cfv 5123  (class class class)co 5774  cz 9057  cuz 9329  seqcseq 10221
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 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-iinf 4502  ax-cnex 7714  ax-resscn 7715  ax-1cn 7716  ax-1re 7717  ax-icn 7718  ax-addcl 7719  ax-addrcl 7720  ax-mulcl 7721  ax-addcom 7723  ax-addass 7725  ax-distr 7727  ax-i2m1 7728  ax-0lt1 7729  ax-0id 7731  ax-rnegex 7732  ax-cnre 7734  ax-pre-ltirr 7735  ax-pre-ltwlin 7736  ax-pre-lttrn 7737  ax-pre-ltadd 7739
This theorem depends on definitions:  df-bi 116  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-nel 2404  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-id 4215  df-iord 4288  df-on 4290  df-ilim 4291  df-suc 4293  df-iom 4505  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-riota 5730  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-recs 6202  df-frec 6288  df-pnf 7805  df-mnf 7806  df-xr 7807  df-ltxr 7808  df-le 7809  df-sub 7938  df-neg 7939  df-inn 8724  df-n0 8981  df-z 9058  df-uz 9330  df-seqfrec 10222
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator