proposition: Theorem FueledFix_continuous {A B C} (F : (B -> C -> option A) -> B -> C -> option A) : (forall n a b c, FueledFix' F n b c = Some a -> FueledFix' F (Datatypes.S n) b c = Some a) -> forall n n', n <= n' -> forall a b c, FueledFix' F n b c = Some a -> FueledFix' F n' b c = Some a.
proof: Proof. intros; induction H0; eauto. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.ZArith.ZArith Coq.Strings.String Coq.Vectors.Vector Fiat.Computation Fiat.Narcissus.Common.Specs Fiat.Narcissus.Formats.Base.FMapFormat Fiat.Computation.FixComp