lean2/tests/lean/bad9.lean.expected.out

  Set: pp::colors
  Set: pp::unicode
  Set: lean::pp::implicit
  Set: pp::colors
  Assumed: N
λ (a : N) (f : N → N) (H : @eq N (f a) a),
  let calc1 : @eq N (f a) a := @substp N (f a) a (λ x : N, @eq N (f a) x) (@refl N (f a)) H in calc1 :
    ∀ (a : N) (f : N → N), @eq N (f a) a → @eq N (f a) a
feat(kernel/metavar): is instantiate_metavars, we are also instantiating assigned metavariables that occur in the local context of unassinged ones. This modification improves the effectiveness of the process_metavar_inst procedure in the Lean elaborator. For example, suppose we have the constraint ctx \|- ?M1[inst:0 ?M2] == a If ?M1 and ?M2 are unassigned, then we have to consider the two possible solutions: ?M1 == a or ?M1 == #0 and ?M2 == a On the other hand, if ?M2 is assigned to b, then we can ignore the second case. Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-01-03 00:08:32 +00:00			`Set: pp::colors`
			`Set: pp::unicode`
			`Set: lean::pp::implicit`
			`Set: pp::colors`
			`Assumed: N`
refactor(kernel): remove heterogeneous equality Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-01-16 23:07:51 +00:00			`λ (a : N) (f : N → N) (H : @eq N (f a) a),`
			`let calc1 : @eq N (f a) a := @substp N (f a) a (λ x : N, @eq N (f a) x) (@refl N (f a)) H in calc1 :`
			`∀ (a : N) (f : N → N), @eq N (f a) a → @eq N (f a) a`