Definition State S X := S -> X * S.Definition ret {S X} : X -> State S X := pair.Definition bind {S X Y} : State S X ->
  (X -> State S Y) -> State S Y :=
  fun m f s => let (x, s') := m s in f x s'.Definition get {S} : State S S :=
  fun s => (s, s).Definition put {S} : S -> State S unit :=
  fun s _ => (tt, s).Definition state_lift {S X} (Pre Post : S -> Prop)
  (P : X -> Prop) : State S X -> Prop :=
  fun f => forall s, Pre s ->
    P (fst (f s)) /\ Post (snd (f s)).

Lemma weaken_lemma {S X} {Pre : S -> Prop} (Post : S -> Prop) {Post' : S -> Prop} (P : X -> Prop) {P' : X -> Prop} (m : State S X) : (forall s, Post s -> Post' s) -> (forall x, P x -> P' x) -> state_lift Pre Post P m -> state_lift Pre Post' P' m.