epfl-lara / lisa

Proof assistant based on first-order logic and set theory
Apache License 2.0
33 stars 18 forks source link

Partial def #132

Closed SimonGuilloud closed 1 year ago

SimonGuilloud commented 1 year ago

Ability to do sub-specified definitions. If you want an object with propriety P(x), you can feed a proof of unique existence of Q(x) as long as Q is OL-smaller than P (so in particular it holds if Q=P/\S). There is an example with a non-empty set in Exercise.scala.