lean2/tests/lean/run/eq17.lean

open nat

definition lt_of_succ : ∀ {a b : nat}, succ a < b → a < b
| lt_of_succ (lt.base (succ a)) := lt.trans (lt.base a) (lt.base (succ a))
| lt_of_succ (lt.step h)        := lt.step  (lt_of_succ h)
fix(library/definitional/equations): bug in "complete" transition 2015-01-06 00:27:29 +00:00			`open nat`

feat(frontends/lean): ML-like notation for match and recursive equations 2015-02-26 00:20:44 +00:00			`definition lt_of_succ : ∀ {a b : nat}, succ a < b → a < b`
			`\| lt_of_succ (lt.base (succ a)) := lt.trans (lt.base a) (lt.base (succ a))`
			`\| lt_of_succ (lt.step h) := lt.step (lt_of_succ h)`