lean4-htt/library/init/data/nat
Leonardo de Moura ea8ecfd390 fix(library/init/meta/interactive): use replace_target at simp_goal
replace_target uses id_locked.
The id_locked solution is more robust because simp may build a proof
using refl lemmas, but type_context may not be able to establish that
the previous and new target are definitionally equal.

@Armael This commit fixes the issue in the KreMLin proof you showed me.
Now, the following tactic succeeds (as expected)
```
        simp [lowstar_semantics.apply_ectx],
```
and the resulting goal is
```
...
|- exp.subbuf (exp.loc (b, n, list.nil field)) a_1 = exp.subbuf ↑?m_1 ?m_2
```
2017-06-05 15:21:20 -07:00
..
basic.lean chore(*): remove pos_num and num from stdlib 2017-05-25 18:24:16 -07:00
bitwise.lean fix(library/init/data/nat/bitwise): broken lemma 2017-05-31 15:08:03 -07:00
default.lean feat(init/data/nat): bitwise operations 2017-05-30 12:47:44 -07:00
div.lean refactor(library): avoid auxiliary definitions such as add/mul/le/etc 2017-05-01 08:52:19 -07:00
lemmas.lean fix(library/init/meta/interactive): use replace_target at simp_goal 2017-06-05 15:21:20 -07:00
pow.lean feat(library/data/list, library/data/array): theorems needed for new hash_map 2017-05-16 14:38:43 -07:00