lean4-htt/tests/lean/run/1026.lean
Leonardo de Moura bb07a732e7
refactor: use mkAuxLemma in mkAuxTheorem (#7762)
cc @Kha

---------

Co-authored-by: Sebastian Ullrich <sebasti@nullri.ch>
2025-03-31 22:50:30 +00:00

23 lines
387 B
Text

def foo (n : Nat) : Nat :=
if n = 0 then 0 else
let x := n - 1
have := match () with | _ => trivial
foo x
termination_by n
decreasing_by sorry
theorem ex : foo 0 = 0 := by
unfold foo
sorry
/--
info: foo.eq_def (n : Nat) :
foo n =
if n = 0 then 0
else
let x := n - 1;
let_fun this := foo._proof_4;
foo x
-/
#guard_msgs in
#check foo.eq_def