lean2/tests/lean/interactive/findp.input.expected.out

-- BEGINWAIT
-- ENDWAIT
-- BEGINFINDP STALE
false|Prop
false.rec|Π (C : Type), false → C
false_elim|false → ?c
false.rec_on|Π (C : Type), false → C
false.cases_on|Π (C : Type), false → C
false.induction_on|∀ (C : Prop), false → C
not_false_trivial|¬ false
true_ne_false|¬ true = false
p_ne_false|?p → ?p ≠ false
eq_false_elim|?a = false → ¬ ?a
-- ENDFINDP
feat(frontends/lean/server): sort exact matches by size in FINDP 2014-09-29 23:40:17 +00:00			`-- BEGINWAIT`
			`-- ENDWAIT`
			`-- BEGINFINDP STALE`
			`false\|Prop`
fix(kernel/inductive): relax eliminator generation rules for empty types This commit also removes the workaround false.rec_type. It is not needed anymore 2014-10-28 17:31:00 +00:00			`false.rec\|Π (C : Type), false → C`
feat(frontends/lean/server): sort exact matches by size in FINDP 2014-09-29 23:40:17 +00:00			`false_elim\|false → ?c`
fix(kernel/inductive): relax eliminator generation rules for empty types This commit also removes the workaround false.rec_type. It is not needed anymore 2014-10-28 17:31:00 +00:00			`false.rec_on\|Π (C : Type), false → C`
feat(frontends/lean): allow expressions to be used to define precedence, closes #335 2014-11-30 02:29:48 +00:00			`false.cases_on\|Π (C : Type), false → C`
feat(library/definitional/induction_on): automatically add 'induction_on' 2014-10-25 20:36:38 +00:00			`false.induction_on\|∀ (C : Prop), false → C`
feat(frontends/lean/pp): take notation declarations into account when pretty printing TODO: support foldl/foldr and binders 2014-10-19 15:40:56 +00:00			`not_false_trivial\|¬ false`
			`true_ne_false\|¬ true = false`
			`p_ne_false\|?p → ?p ≠ false`
			`eq_false_elim\|?a = false → ¬ ?a`
feat(frontends/lean/server): sort exact matches by size in FINDP 2014-09-29 23:40:17 +00:00			`-- ENDFINDP`