lean2/tests/lean/tactic14.lean.expected.out

  Set: pp::colors
  Set: pp::unicode
  Imported 'Int'
  Proved: T1
Theorem T1 (a b : ℤ) (f : ℤ → ℤ) (assumption : a = b) : f (f a) = f (f b) :=
    Congr (Refl f) (Congr (Refl f) assumption)
-												fix(frontends/lean/frontend_elaborator): must elaborate type attached to placeholder, it may also contain holes

The test tactic14.lean exposes the problem.

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

											
										
										
											2013-12-07 23:37:54 +00: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 21:52:25 +00:00
+								  Imported 'Int'
-												fix(frontends/lean/frontend_elaborator): must elaborate type attached to placeholder, it may also contain holes

The test tactic14.lean exposes the problem.

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

											
										
										
											2013-12-07 23:37:54 +00:00
+								  Proved: T1
-												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 20:46:14 +00:00
+								Theorem T1 (a b : ℤ) (f : ℤ → ℤ) (assumption : a = b) : f (f a) = f (f b) :=
-												fix(frontends/lean/frontend_elaborator): must elaborate type attached to placeholder, it may also contain holes

The test tactic14.lean exposes the problem.

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

											
										
										
											2013-12-07 23:37:54 +00:00
+								    Congr (Refl f) (Congr (Refl f) assumption)