5a2e46b021
This PR avoid reducing at transparency all in equational theorem generation. Fixes #10651.
36 lines
804 B
Text
36 lines
804 B
Text
-- set_option trace.Elab.definition.eqns true
|
|
|
|
def f (x : Nat) : Nat :=
|
|
match x with
|
|
| 0 => 1
|
|
| 100 => 2
|
|
| 1000 => 3
|
|
| x+1 => f x
|
|
termination_by x
|
|
|
|
/--
|
|
info: equations:
|
|
theorem f.eq_1 : f 0 = 1
|
|
theorem f.eq_2 : f 100 = 2
|
|
theorem f.eq_3 : f 1000 = 3
|
|
theorem f.eq_4 : ∀ (x_2 : Nat), (x_2 = 99 → False) → (x_2 = 999 → False) → f x_2.succ = f x_2
|
|
-/
|
|
#guard_msgs(pass trace, all) in
|
|
#print equations f
|
|
|
|
def g (x : Nat) : Nat :=
|
|
match x with
|
|
| 0 => 1
|
|
| 100 => 2
|
|
| 1000 => 3
|
|
| x+1 => x
|
|
|
|
/--
|
|
info: equations:
|
|
@[defeq] theorem g.eq_1 : g 0 = 1
|
|
@[defeq] theorem g.eq_2 : g 100 = 2
|
|
@[defeq] theorem g.eq_3 : g 1000 = 3
|
|
theorem g.eq_4 : ∀ (x_2 : Nat), (x_2 = 99 → False) → (x_2 = 999 → False) → g x_2.succ = x_2
|
|
-/
|
|
#guard_msgs(pass trace, all) in
|
|
#print equations g
|