Theory Word_Lib.Least_significant_bit
section ‹Abbreviation syntax for the least significant bit›
theory Least_significant_bit
imports
"HOL-Library.Word"
begin
context semiring_bit_operations
begin
abbreviation lsb :: ‹'a ⇒ bool›
where ‹lsb a ≡ bit a 0›
lemma lsb_odd:
‹lsb = odd›
by (simp add: bit_0)
end
lemma bin_last_conv_lsb:
‹odd = (lsb :: int ⇒ bool)›
by (simp add: bit_0)
lemma int_lsb_numeral [simp]:
"lsb (0 :: int) = False"
"lsb (1 :: int) = True"
"lsb (Numeral1 :: int) = True"
"lsb (- 1 :: int) = True"
"lsb (- Numeral1 :: int) = True"
"lsb (numeral (num.Bit0 w) :: int) = False"
"lsb (numeral (num.Bit1 w) :: int) = True"
"lsb (- numeral (num.Bit0 w) :: int) = False"
"lsb (- numeral (num.Bit1 w) :: int) = True"
by simp_all
lemma word_lsb_def:
‹lsb a ⟷ odd (uint a)› for a :: ‹'a::len word›
by (simp flip: bit_0 add: bit_simps)
lemma lsb_word_eq:
‹lsb = (odd :: 'a word ⇒ bool)› for w :: ‹'a::len word›
by (fact lsb_odd)
lemma word_lsb_alt: "lsb w = bit w 0"
for w :: "'a::len word"
by (simp add: lsb_word_eq bit_0)
lemma word_lsb_1_0 [simp]: "lsb (1::'a::len word) ∧ ¬ lsb (0::'b::len word)"
unfolding word_lsb_def by simp
lemma word_lsb_int: "lsb w ⟷ uint w mod 2 = 1"
by (simp flip: odd_iff_mod_2_eq_one bit_0 add: bit_simps)
lemma word_ops_lsb:
‹(bit (or x y) 0 ⟷ bit x 0 ∨ bit y 0)
∧ (bit (and x y) 0 ⟷ bit x 0 ∧ bit y 0)
∧ (bit (xor x y) 0 ⟷ bit x 0 ≠ bit y 0)
∧ (bit (not x) 0 ⟷ ¬ bit x 0)›
by (simp add: bit_simps)
lemma word_lsb_numeral [simp]:
"lsb (numeral bin :: 'a::len word) ⟷ odd (numeral bin :: int)"
by (simp only: flip: bit_0) simp
lemma word_lsb_neg_numeral [simp]:
"lsb (- numeral bin :: 'a::len word) ⟷ odd (- numeral bin :: int)"
by (simp only: flip: bit_0) simp
lemma word_lsb_nat: "lsb w = (unat w mod 2 = 1)"
by (simp only: flip: odd_iff_mod_2_eq_one bit_0) (simp add: bit_simps)
end