diff options
| -rw-r--r-- | theories/Logic/ConstructiveEpsilon.v | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/theories/Logic/ConstructiveEpsilon.v b/theories/Logic/ConstructiveEpsilon.v index 98260c7fc1..36ff2681b5 100644 --- a/theories/Logic/ConstructiveEpsilon.v +++ b/theories/Logic/ConstructiveEpsilon.v @@ -49,7 +49,7 @@ numbers we try. Namely, [y] is [R]-less then [x] if we try [y] after infinite [R]-descending chain from 0 is equivalent to the termination of our searching algorithm. *) -Definition R (x y : nat) : Prop := x = S y /\ ~ P y. +Let R (x y : nat) : Prop := x = S y /\ ~ P y. Notation Local "'acc' x" := (Acc R x) (at level 10). |