Mario Carneiro
9f2980a524
feat(init/data/int): int lemmas, more bitwise theorems
2017-06-27 18:55:52 -07:00
Mario Carneiro
9f4f93e931
feat(init/data/int): prove int bitwise ops
2017-06-27 18:55:52 -07:00
Mario Carneiro
a63bafcc5c
refactor(init/data/nat/bitwise): change definitions to avoid WF
...
The type-correctness of binary_rec_eq (the statement, not the proof) depends on unfolding the embedded well-founded definition of mod. This definition avoids it by using two simpler functions bodd and div2 that reduce well in the kernel.
2017-06-27 18:55:52 -07:00
Gabriel Ebner
30a9217a78
feat(library/type_context): unfold lemmas in major premise of acc.rec
2017-06-22 08:33:11 -07:00
Sebastian Ullrich
0a48809469
refactor(frontends/lean/tactic_notation): rename note/define tactics to have/let
2017-06-22 08:03:23 -07:00
Leonardo de Moura
293ab6a032
fix(library/init/data/nat/bitwise): broken lemma
2017-05-31 15:08:03 -07:00
Mario Carneiro
41b928a546
feat(init/data/nat/bitwise): properties of bitwise ops
2017-05-31 14:18:44 -07:00
Mario Carneiro
18b622d709
chore(init/data/nat): modify bitwise defs
2017-05-31 14:18:44 -07:00
Leonardo de Moura
cbca84a8ea
chore(library/init/data/nat/bitwise): fix copyright date
2017-05-30 13:05:37 -07:00
Mario Carneiro
860e2d904d
feat(init/data/nat): bitwise operations
2017-05-30 12:47:44 -07:00
