proposition: Lemma lem_small_to_big : forall c s s', (c, s) -->* (Nop, s') -> c >> s ==> s'.
proof: Proof. enough (forall p p', p -->* p' -> forall c s s', p = (c, s) -> p' = (Nop, s') -> c >> s ==> s') by eauto. time (induction 1; sauto use: lem_small_to_big_aux_2). Undo. time (induction 1; sauto l: on use: lem_small_to_big_aux_2). Qed.
imports: Hammer(Tactics Reflect) String Arith Lia Relations