Zulip Chat Archive

Stream: general

Topic: Can't = compare axioms?


Marvin (Feb 13 2026 at 11:13):

I define an axiom which many other expressions will reduce down to. In this case I make a trivial synonym

axiom p : Prop
abbrev q := p
#eval p = q

I get

failed to compile definition, compiler IR check failed at `_eval`. Error: depends on declaration 'Prop.linearOrder', which has no executable code; consider marking definition as 'noncomputable'```
Why is this?

Kevin Buzzard (Feb 13 2026 at 11:27):

If we could #eval props then we could figure out if the Riemann Hypothesis is true by #eval RiemannHypothesis = True

Kevin Buzzard (Feb 13 2026 at 11:29):

As has been suggested to you in another thread, you probably want to make your own computable Formula type rather than using Lean's Prop universe.


Last updated: Feb 28 2026 at 14:05 UTC