27df5e968a
This PR implements `Simp.Config.implicitDefEqsProofs`. When `true` (default: `true`), `simp` will **not** create a proof term for a rewriting rule associated with an `rfl`-theorem. Rewriting rules are provided by users by annotating theorems with the attribute `@[simp]`. If the proof of the theorem is just `rfl` (reflexivity), and `implicitDefEqProofs := true`, `simp` will **not** create a proof term which is an application of the annotated theorem. The default setting does change the existing behavior. Users can use `simp -implicitDefEqProofs` to force `simp` to create a proof term for `rfl`-theorems. This can positively impact proof checking time in the kernel. This PR also fixes an issue in the `split` tactic that has been exposed by this feature. It was looking for `split` candidates in proofs and implicit arguments. See new test for issue exposed by the previous feature. --------- Co-authored-by: Kim Morrison <kim@tqft.net>
8 lines
208 B
Text
8 lines
208 B
Text
def inc (x : Nat) := x + 1
|
|
|
|
@[simp] theorem inc_eq : inc x = x + 1 := rfl
|
|
|
|
theorem ex (a b : Fin (inc n)) (h : a = b) : b = a := by
|
|
simp +implicitDefEqProofs only [inc_eq] at a
|
|
trace_state
|
|
exact h.symm
|