proposition: Theorem mklist_lt: forall n1 x, (In x (mklist n1)) -> (x < n1)%nat.
proof: Proof. intros n1; elim n1; simpl; auto; clear n1. intros x H; case H. intros n1 Hrec x [H1 | H1]; try subst x; auto with arith. Qed.
imports: ZArith Znumtheory Eqdep_dec List Lia UList