4 commits

Author	SHA1	Message	Date
Leonardo de Moura	5db13da95f	test(tests/lean/run/div_wf): cleanup div based on well founded recursion	2014-11-22 09:56:47 -08:00
Leonardo de Moura	064ecd3e3d	refactor(library/data/nat): declare lt and le asap using inductive definitions, and make key theorems transparent for definitional package ... We also define key theorems that will be used to generate the automatically generated a well-founded subterm relation for inductive datatypes. We also prove decidability and wf theorems asap.	2014-11-22 00:19:39 -08:00
Leonardo de Moura	4fbb5cfcca	test(tests/lean/run/div_wf): cleanup	2014-11-18 17:59:14 -08:00
Leonardo de Moura	5fbe990c7a	test(tests/lean/run): define div using wf package	2014-11-18 13:55:58 -08:00