lean2/tests/lean/apply_tac1.lean.expected.out

  Set: pp::colors
  Set: pp::unicode
  Imported 'tactic'
  Imported 'Int'
  Assumed: f
  Assumed: P
  Assumed: Ax1
  Proved: T1
  Assumed: b
  Assumed: Ax2
  Proved: T2
  Proved: T3
theorem T2 (a : ℤ) (H : P a a) : f a a := Ax1 a a H
theorem T3 (a : ℤ) (H : P a a) : f a a := Ax1 a a H
-												feat(library/tactic): add apply_tactic

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

											
										
										
											2013-12-05 03:22:12 -08:00
+								  Set: pp::colors
 								  Set: pp::unicode
-												refactor(builtin): only load the kernel and natural numbers by default

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

											
										
										
											2013-12-30 13:35:37 -08:00
+								  Imported 'tactic'
-												chore(builtin): rename nat, int and real modules to Nat, Int and Real.

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

											
										
										
											2014-01-01 13:52:25 -08:00
+								  Imported 'Int'
-												feat(library/tactic): add apply_tactic

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

											
										
										
											2013-12-05 03:22:12 -08:00
+								  Assumed: f
 								  Assumed: P
 								  Assumed: Ax1
 								  Proved: T1
 								  Assumed: b
 								  Assumed: Ax2
 								  Proved: T2
-												refactor(frontends/lean/parser): tactic macros, and tactic Lua bindings

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

											
										
										
											2013-12-26 15:54:53 -08:00
+								  Proved: T3
-												feat(kernel): use Pi as forall/implication

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

											
										
										
											2014-01-08 00:38:39 -08:00
+								theorem T2 (a : ℤ) (H : P a a) : f a a := Ax1 a a H
 								theorem T3 (a : ℤ) (H : P a a) : f a a := Ax1 a a H