01003b79cc
closes #1675 After this commit, the following example works as expected. ``` example (p : nat → Prop) (a b : nat) : a = 0 ∧ b = 0 → p (a + b) → p 0 := begin intros h₁ h₂, simp [h₁] at *, /- produces the state (p : nat → Prop) (a b : nat) h₁ : true h₂ : p 0 |- p 0 -/ assumption end ``` as expected. Remark: the original issue raised by issue #1675 is actually solved by the `simp_all` tactic. |
||
|---|---|---|
| .. | ||
| basic.lean | ||
| bitwise.lean | ||
| comp_lemmas.lean | ||
| default.lean | ||
| lemmas.lean | ||
| order.lean | ||