Expand description
Proof-PRODUCING arithmetic oracle (untrusted search, kernel-checked proof).
Given an Int equality goal Eq Int lhs rhs, prove_int_eq searches for a
genuine kernel proof term and returns it — or None. Nothing here is trusted:
whatever it returns is re-checked by the kernel’s infer_type, so a wrong
proof is rejected, never believed. This is the Coq-lia/nia model — the fast
search lives outside the trusted base; a bug here can only cause a failed
proof, never a false one.
Trust boundary: closed/literal goals use exact kernel computation and reflexivity. Symbolic ring proofs apply the registered law names. The standard prelude now gives checked proof bodies to add_comm, add_zero, mul_comm, mul_one, mul_zero, mul_assoc, add_assoc, mul_distrib_add and sub_elim. These ring proofs now have empty transitive axiom dependencies. sub_elim states a - b = a + (-1)*b, exposing subtraction to this vocabulary. The oracle itself remains an untrusted proof producer.
Functions§
- prove_
int_ eq - Prove an
IntequalityEq Int lhs rhs, or returnNone.