summaryrefslogtreecommitdiff
path: root/backends/lean/Base
diff options
context:
space:
mode:
authorRyan Lahfa2024-06-11 16:04:19 +0200
committerRyan Lahfa2024-06-11 16:04:19 +0200
commit2b74d1e6c3a0e644afa5c6881a3e5d9f7365e61d (patch)
tree26f13a6dc2ff9a329e1d0a6c1a7746010bead092 /backends/lean/Base
parente60d525fe3dffa035d2a551af624747dca6e1c1e (diff)
feat: `PropHasImp` can have `Sort u` as premisses
This makes it possible to have `InBounds ... : Type 1` for example as `x`. Signed-off-by: Ryan Lahfa <ryan.lahfa@inria.fr>
Diffstat (limited to '')
-rw-r--r--backends/lean/Base/Arith/Int.lean2
1 files changed, 1 insertions, 1 deletions
diff --git a/backends/lean/Base/Arith/Int.lean b/backends/lean/Base/Arith/Int.lean
index 4a3db5f8..a9eb4051 100644
--- a/backends/lean/Base/Arith/Int.lean
+++ b/backends/lean/Base/Arith/Int.lean
@@ -22,7 +22,7 @@ class HasIntProp (a : Sort u) where
prop : ∀ x:a, prop_ty x
/- Proposition with implications: if we find P we can introduce Q in the context -/
-class PropHasImp (x : Prop) where
+class PropHasImp (x : Sort u) where
concl : Prop
prop : x → concl