proposition: Lemma loop_fulfills k a b : loop a k = Some b -> p b = true.
proof: Proof. revert a; induction k; intros; cbn in *. - now destruct (p a) eqn:E; inv H. - destruct (p a) eqn:E. + now inv H. + eapply IHk; eauto. Qed.
imports: Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin Undecidability.Shared.Libs.PSL.Vectors.FinNotation Undecidability.Shared.Libs.PSL.Inhabited Undecidability.Shared.Libs.PSL.Base Undecidability.Shared.Libs.PSL.Vectors.Vectors Lia