lean2/tests/lean/run/tactic9.lean

import logic
open tactic

theorem tst {A B : Prop} (H1 : A) (H2 : B) : ((fun x : Prop, x) A) ∧ B ∧ A
:= by repeat (split | assumption)
chore(*): minimize dependencies on tests Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-08-25 02:58:48 +00:00			`import logic`
feat(frontends/lean): rename 'using' command to 'open' Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-09-03 23:00:38 +00:00			`open tactic`
feat(frontends/lean): add beta-reduction tactic command Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-06-30 02:41:54 +00:00
refactor(*): rename Bool to Prop Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-22 16:43:18 +00:00			`theorem tst {A B : Prop} (H1 : A) (H2 : B) : ((fun x : Prop, x) A) ∧ B ∧ A`
feat(library/tactic): improve 'assumption' tactic - It uses the unifier in "conservative" mode - It only affects the current goal closes #570 2015-05-03 00:32:03 +00:00			`:= by repeat (split \| assumption)`