lean2/tests/lean/run/tactic25.lean

import logic
open tactic

definition my_tac1 := apply @eq.refl
definition my_tac2 := repeat (or_else (apply and.intro) assumption)

tactic_hint my_tac1
tactic_hint my_tac2

theorem T1 {A : Type.{2}} (a : A) : a = a

theorem T2 {a b c : Prop} (Ha : a) (Hb : b) (Hc : c) : a ∧ b ∧ c

notation `(` h `|` r:(foldl `|` (e r, tactic.or_else r e) h) `)` := r
infixl `;`:15 := tactic.and_then

definition my_tac3 := fixpoint (λ f, (apply or.intro_left; f  |
                                      apply or.intro_right; f |
                                      assumption))

tactic_hint my_tac3
theorem T3 {a b c : Prop} (Hb : b) : a ∨ b ∨ c
-												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): allow user to suppress proofs in theorems, and let them be inferred automatically using tactic_hints

Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>

											
										
										
											2014-07-08 21:38:57 +00:00
-												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 23:36:06 +00:00
+								definition my_tac1 := apply @eq.refl
-												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
+								definition my_tac2 := repeat (or_else (apply and.intro) assumption)
-												feat(frontends/lean): allow user to suppress proofs in theorems, and let them be inferred automatically using tactic_hints

Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>

											
										
										
											2014-07-08 21:38:57 +00:00
 								tactic_hint my_tac1
 								tactic_hint my_tac2
 								theorem T1 {A : Type.{2}} (a : A) : a = a
-												refactor(*): rename Bool to Prop

Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>

											
										
										
											2014-07-22 16:43:18 +00:00
+								theorem T2 {a b c : Prop} (Ha : a) (Hb : b) (Hc : c) : a ∧ b ∧ c
-												feat(frontends/lean): allow user to suppress proofs in theorems, and let them be inferred automatically using tactic_hints

Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>

											
										
										
											2014-07-08 21:38:57 +00:00
-												feat(frontends/lean): add tactic_notation command

This addresses the first part of issue #461

We still need support for tactic definitions

											
										
										
											2015-04-28 00:46:13 +00:00
+								notation `(` h `|` r:(foldl `|` (e r, tactic.or_else r e) h) `)` := r
 								infixl `;`:15 := tactic.and_then
 								definition my_tac3 := fixpoint (λ f, (apply or.intro_left; f  |
 								                                      apply or.intro_right; f |
-												feat(frontends/lean): round parenthesis for [tactic1 | tactic2]

This commit also replaces the notation for divides
     `(` a `|` b `)`
with
      a `∣` b

The character `∣` is entered by typing \|

closes #516

											
										
										
											2015-04-06 16:24:09 +00:00
+								                                      assumption))
-												feat(frontends/lean): allow user to suppress proofs in theorems, and let them be inferred automatically using tactic_hints

Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>

											
										
										
											2014-07-08 21:38:57 +00:00
-												feat(frontends/lean): remove tactic hints for specific classes

The idea is to separate class-instance resolution and tactic framework
as two independent engines.

											
										
										
											2014-10-07 16:44:01 +00:00
+								tactic_hint my_tac3
-												refactor(*): rename Bool to Prop

Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>

											
										
										
											2014-07-22 16:43:18 +00:00
+								theorem T3 {a b c : Prop} (Hb : b) : a ∨ b ∨ c