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)) := nat.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-05 16:27:29 -08:00			`open nat`

feat(frontends/lean): ML-like notation for match and recursive equations 2015-02-25 16:20:44 -08:00			`definition lt_of_succ : ∀ {a b : nat}, succ a < b → a < b`
fix(tests/lean/*): fix tests 2015-10-23 10:24:30 -04:00			`\| lt_of_succ (lt.base (succ a)) := nat.lt_trans (lt.base a) (lt.base (succ a))`
feat(frontends/lean): ML-like notation for match and recursive equations 2015-02-25 16:20:44 -08:00			`\| lt_of_succ (lt.step h) := lt.step (lt_of_succ h)`