lean2/tests/lean/interactive/t7.lean.expected.out

#   Set: pp::colors
  Set: pp::unicode
  Imported 'Int'
#   Assumed: q
#   Assumed: p
#   Assumed: Ax
#   Assumed: a
# Proof state:
x : ℤ ⊢ q a x ⇒ p x
## Proof state:
H : q a x, x : ℤ ⊢ p x
## Proof state:
H : q a x, x : ℤ ⊢ q a x
## Proof state:
no goals
##   Proved: T
#
-												feat(frontends/lean/parser): add assumption command, and allow Lean expressions (proof terms) to be used with apply tactic command

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

											
										
										
											2013-12-05 20:08:36 -08:00
+								#   Set: pp::colors
 								  Set: pp::unicode
-												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'
-												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
+								#   Assumed: q
-												feat(frontends/lean/parser): add assumption command, and allow Lean expressions (proof terms) to be used with apply tactic command

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

											
										
										
											2013-12-05 20:08:36 -08:00
+								#   Assumed: p
 								#   Assumed: Ax
 								#   Assumed: a
 								# Proof state:
-												fix(frontends/lean/pp): make sure pp and parser are using the same precedences

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

											
										
										
											2013-12-19 12:46:14 -08:00
+								x : ℤ ⊢ q a x ⇒ p x
-												feat(frontends/lean/parser): add assumption command, and allow Lean expressions (proof terms) to be used with apply tactic command

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

											
										
										
											2013-12-05 20:08:36 -08:00
+								## Proof state:
 								H : q a x, x : ℤ ⊢ p x
 								## Proof state:
 								H : q a x, x : ℤ ⊢ q a x
 								## Proof state:
 								no goals
 								##   Proved: T
 								#