proposition: Lemma le_ind2 m (P : nat -> Prop) : P m -> (forall n, P (S n) -> S n <= m -> P n) -> forall n, n <= m -> P n.
proof: Proof. intros. induction H1. - eauto. - eauto. Qed.
imports: Undecidability.H10(H10 dio_single dio_logic) Undecidability.L.Datatypes(LNat LOptions LSum) Undecidability.L(Tactics.LTactics Computability.MuRec Computability.Synthetic Tactics.GenEncode) Undecidability.Shared(DLW.Utils.finite DLW.Vec.vec DLW.Vec.pos) Undecidability.MuRec(MuRec recalg ra_sem_eq) Undecidability.L.Reductions.MuRec.MuRec_extract