proposition: Lemma FixFun_fix_partial : forall A (R:binary A) (P:A->Prop) B {IB:Inhab B} (F:(A->B)->(A->B)) (f:A->B), f = FixFun F -> wf R -> rec_contractive_noinv eq P F R -> (forall x, P x -> f x = F f x).
proof: Proof. Proof using. introv Def Wf Cont. forwards~ [H _]: (@FixFun_fix_partial_inv A R P B post_true). apply~ rec_contractive_noinv_to_rec_contractive. subst~. Qed.
imports: TLC(LibTactics LibLogic LibReflect LibEpsilon LibInt LibProd LibSum LibOperation LibRelation LibWf LibOrder LibMin)