proposition: Lemma divmod_gt_10 : forall m, 9 < m -> 0 < fst (NPeano.divmod m 9 0 8).
proof: Proof. intros; pose proof (NPeano.divmod_spec m 9 0 8 (Le.le_n_Sn _)). destruct (NPeano.divmod m 9 0 8); intuition. simpl in *. destruct n; eauto; simpl in *. rewrite Plus.plus_comm in H1; simpl in *. rewrite Plus.plus_comm in H1; simpl in *. destruct n0; try omega. destruct n0; try omega. destruct n0; try omega. destruct n0; try omega. destruct n0; try omega. destruct n0; try omega. destruct n0; try omega. destruct n0; try omega. destruct n0; try omega. destruct n0; try omega. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.Numbers.Natural.Peano.NPeano Coq.Strings.String Coq.Arith.Lt Coq.Arith.Compare_dec Coq.Lists.List Coq.ZArith.ZArith