proposition: Lemma StateWhile_TerminatesIn l : (forall l, pM l ⊨ R l) -> (forall l, projT1 (pM l) ↓ T l) -> StateWhileTM l ↓ StateWhile_T l.
proof: Proof. intros HRel HTerm. eapply StateWhile_TerminatesIn_ind; eauto. intros l' tin k' HCoInd. destruct HCoInd; eauto. Qed.
imports: Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs EqdepFacts