proposition: Lemma cvg_comp_shift {T : Type} {K : numDomainType} {R : normedModType K} (x y : R) (f : R -> T) : (f \o shift x) @ y = f @ (y + x).
proof: Proof. rewrite funeqE => A; rewrite /= !near_simpl (near_shift (y + x)). by rewrite (_ : _ \o _ = A \o f) // funeqE=> z; rewrite /= opprD addNKr addrNK. Qed.
imports: HB(structures) mathcomp(all_ssreflect ssralg ssrint ssrnum finmap matrix) mathcomp(rat interval zmodp vector fieldext falgebra) mathcomp(mathcomp_extra boolp classical_sets functions) mathcomp(cardinality set_interval Rstruct) ereal reals signed topology prodnormedzmodule