diff options
author | 2007-07-13 15:18:18 +0000 | |
---|---|---|
committer | 2007-07-13 15:18:18 +0000 | |
commit | d445f5714b772b8240e20d41c8a489e3d4e66253 (patch) | |
tree | dc4ff2a5011af81308ed761172f48b02e736f4b6 /theories/QArith/Qfield.v | |
parent | 246909f2c587ed798bc42b65fb90c7b77dfa52b7 (diff) |
Small cleanup
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@9996 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'theories/QArith/Qfield.v')
-rw-r--r-- | theories/QArith/Qfield.v | 18 |
1 files changed, 14 insertions, 4 deletions
diff --git a/theories/QArith/Qfield.v b/theories/QArith/Qfield.v index 4d8a80611..f54a6c286 100644 --- a/theories/QArith/Qfield.v +++ b/theories/QArith/Qfield.v @@ -12,7 +12,7 @@ Require Export Field. Require Export QArith_base. Require Import NArithRing. -(** * A ring tactic for rational numbers *) +(** * field and ring tactics for rational numbers *) Definition Qeq_bool (x y : Q) := if Qeq_dec x y then true else false. @@ -23,6 +23,11 @@ Proof. intros _ H; inversion H. Qed. +Lemma Qeq_bool_complete : forall x y : Q, x==y -> Qeq_bool x y = true. +Proof. + intros x y; unfold Qeq_bool in |- *; case (Qeq_dec x y); simpl in |- *; auto. +Qed. + Definition Qsft : field_theory 0 1 Qplus Qmult Qminus Qopp Qdiv Qinv Qeq. Proof. constructor. @@ -77,7 +82,12 @@ Ltac Qpow_tac t := | _ => NotConstant end. -Add Field Qfield : Qsft(decidable Qeq_bool_correct, constants [Qcst], power_tac Qpower_theory [Qpow_tac]). +Add Field Qfield : Qsft + (decidable Qeq_bool_correct, + completeness Qeq_bool_complete, + constants [Qcst], + power_tac Qpower_theory [Qpow_tac]). + (** Exemple of use: *) Section Examples. @@ -109,7 +119,7 @@ Let ex6 : (1#1)+(1#1) == 2#1. ring. Qed. -Let ex7 : forall x : Q, x-x== 0#1. +Let ex7 : forall x : Q, x-x== 0. intro. ring. Qed. @@ -124,7 +134,7 @@ Let ex9 : forall x : Q, x^0 == 1. ring. Qed. -Example test_field : forall x y : Q, ~(y==0) -> (x/y)*y == x. +Let ex10 : forall x y : Q, ~(y==0) -> (x/y)*y == x. intros. field. auto. |