lean2/tests/lean/run/tactic7.lean

import logic
open tactic

theorem tst {A B : Prop} (H1 : A) (H2 : B) : A ∧ B ∧ A
:= by apply and.intro; state; assumption; apply and.intro; !assumption
check tst

theorem tst2 {A B : Prop} (H1 : A) (H2 : B) : A ∧ B ∧ A
:= by repeat ([apply @and.intro | assumption] ; trace "STEP"; state; trace "----------")

check tst2
chore(*): minimize dependencies on tests Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-08-24 19:58:48 -07:00			`import logic`
feat(frontends/lean): rename 'using' command to 'open' Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-09-03 16:00:38 -07:00			`open tactic`
feat(library/tactic): add apply tactic Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-06-29 18:26:07 -07:00
refactor(*): rename Bool to Prop Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-22 09:43:18 -07:00			`theorem tst {A B : Prop} (H1 : A) (H2 : B) : A ∧ B ∧ A`
feat(frontends/lean/inductive_cmd): prefix introduction rules with the name of the inductive datatype Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-09-04 16:36:06 -07:00			`:= by apply and.intro; state; assumption; apply and.intro; !assumption`
feat(library/tactic): new apply tactic Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-02 13:14:50 -07:00			`check tst`

refactor(*): rename Bool to Prop Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-22 09:43:18 -07:00			`theorem tst2 {A B : Prop} (H1 : A) (H2 : B) : A ∧ B ∧ A`
refactor(library/data/nat): use new operator '!' 2014-10-01 18:39:47 -07:00			`:= by repeat ([apply @and.intro \| assumption] ; trace "STEP"; state; trace "----------")`
feat(library/tactic): new apply tactic Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-02 13:14:50 -07:00
			`check tst2`