Commit 2024-07-15 11:16 32fc2e7d
View on Github →chore: remove bit0/bit1 and associated lemmas (#14745)
This PR replaces bit0 x
resp. bit1 x
with:
2 * x
resp.2 * x + 1
if possible, or2 • x
resp.2 • x + 1
if possible, orx + x
resp.x + x + 1
as fallback. The versionsNum.bit0
andNum.bit1
(as well as thePosNum
andZNum
versions) are left alone. All lemmas that mentionbit0
/bit1
have been adapted. A follow-up PR can remove these lemmas. Deletions:- bit0
- bit1