From Undecidability.L Require Import Tactics.Computable Lproc Lbeta ComputableTime mixedTactics.
(* *** Lrewrite: simplification with correctness statements*)
(* This module simplifies L-terms by rewriting with correctness-lemmatas form the hint library Lrewrite *)
(* For Time Complexity: *)

Lemma redLe_app_helper s s' t t' u i j k:
s >(<= i) s' -> t >(<= j) t' -> s' t' >(<=k) u -> s t >(<=i+j+k) u.