diff options
| author |  mohring <mohring@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2002-03-26 16:29:59 +0000 |
|---|---|---|
| committer | mohring <mohring@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2002-03-26 16:29:59 +0000 |
| commit | 3dd52dacc7846b85a11f83c398945c00bb65bad2 (patch) | |
| tree | 4f5f004e7f617b1bfe8aab8f9eebb0508954da26 /theories/Logic/Berardi.v | |
| parent | 3bd24bddb74d7a351cbfc8cba7a5e3735f478832 (diff) | |
Prise en compte des dependances dans la tactique Case
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@2567 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'theories/Logic/Berardi.v')
| -rw-r--r-- | theories/Logic/Berardi.v | 7 |
1 files changed, 2 insertions, 5 deletions
diff --git a/theories/Logic/Berardi.v b/theories/Logic/Berardi.v index b50485d3c..9f6217320 100644 --- a/theories/Logic/Berardi.v +++ b/theories/Logic/Berardi.v @@ -26,8 +26,6 @@ } >> *) -Require Elimdep. - Set Implicit Arguments. Section Berardis_paradox. @@ -51,7 +49,7 @@ Lemma AC_IF : (P,B:Prop)(e1,e2:P)(Q:P->Prop) Proof. Intros P B e1 e2 Q p1 p2. Unfold IFProp. -Elim (EM B) using or_indd; Assumption. +Case (EM B); Assumption. Qed. @@ -82,13 +80,12 @@ Record retract_cond : Prop := { inv2: retract -> (a:A)(j2 (i2 a))==a }. -Scheme retract_cond_indd := Induction for retract_cond Sort Prop. (** The dependent elimination above implies the axiom of choice: *) Lemma AC: (r:retract_cond) retract -> (a:A)((j2 r) ((i2 r) a))==a. Proof. Intros r. -Elim r using retract_cond_indd; Simpl. +Case r; Simpl. Trivial. Qed. |