proposition: Lemma rec_contractive_noinv_to_rec_contractive : forall A B (E:binary B) (P:A->Prop) (F:(A->B)->(A->B)) (R:binary A), rec_contractive_noinv E P F R -> rec_contractive E P F R post_true.
proof: Proof. Proof using. introv Cont. unfolds. intros. split~. apply~ Cont. intros. forwards*: H0. Qed.
imports: TLC(LibTactics LibLogic LibReflect LibEpsilon LibInt LibProd LibSum LibOperation LibRelation LibWf LibOrder LibMin)