lean2/tests/lean/backward_rule1.lean.expected.out

constant H [backward] : A → B
constant G [backward] : A → B → C
constant f [backward] : T → A
backward rules
exists_unique ==> exists_unique.intro (poly)
B ==> H
A ==> f (poly)
C ==> G
Exists ==> Exists.intro (poly)
feat(library/blast/backward): backward chaining strategy 2015-11-18 23:41:44 +00:00			`constant H [backward] : A → B`
			`constant G [backward] : A → B → C`
			`constant f [backward] : T → A`
			`backward rules`
feat(frontends/lean): add '[intro]' and '[elim]' annotations 2015-12-08 01:08:32 +00:00			`exists_unique ==> exists_unique.intro (poly)`
feat(library/blast/backward): backward chaining strategy 2015-11-18 23:41:44 +00:00			`B ==> H`
			`A ==> f (poly)`
			`C ==> G`
feat(frontends/lean): add '[intro]' and '[elim]' annotations 2015-12-08 01:08:32 +00:00			`Exists ==> Exists.intro (poly)`