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
..
lean	refactor(library/data/nat): declare lt and le asap using inductive definitions, and make key theorems transparent for definitional package	2014-11-22 00:19:39 -08:00
lua	feat(kernel/inductive): relax conditions for an inductive datatype in Prop to be able to eliminate into Type	2014-11-06 09:36:54 -08:00