proposition: Lemma divmod_eq : forall n m, NPeano.divmod n 9 0 8 = NPeano.divmod m 9 0 8 -> n = m.
proof: Proof. intros; pose proof (NPeano.divmod_spec m 9 0 8 (Le.le_n_Sn _)). pose proof (NPeano.divmod_spec n 9 0 8 (Le.le_n_Sn _)). destruct (NPeano.divmod m 9 0 8); destruct (NPeano.divmod n 9 0 8); intuition. simpl in *. rewrite Plus.plus_comm in *; simpl in *. rewrite Plus.plus_comm in *; simpl in *. injection H; intros; subst. 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