From 2b74d1e6c3a0e644afa5c6881a3e5d9f7365e61d Mon Sep 17 00:00:00 2001 From: Ryan Lahfa Date: Tue, 11 Jun 2024 16:04:19 +0200 Subject: 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 --- backends/lean/Base/Arith/Int.lean | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'backends') 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 -- cgit v1.2.3