Theorem: Nat.bitwise_shiftRight (Algdata/Data/Nat/Bits.lean)

State before:
f : Bool → Bool → Bool
f_stable : f false false = false
m n k : Nat
⊢ bitwise f m n >>> k = bitwise f (m >>> k) (n >>> k)
Tactic:
apply bitext
State after:
case a
f : Bool → Bool → Bool
f_stable : f false false = false
m n k : Nat
⊢ ∀ (i : Nat), getBit (bitwise f m n >>> k) i = getBit (bitwise f (m >>> k) (n >>> k)) i

State before:
case a
f : Bool → Bool → Bool
f_stable : f false false = false
m n k : Nat
⊢ ∀ (i : Nat), getBit (bitwise f m n >>> k) i = getBit (bitwise f (m >>> k) (n >>> k)) i
Tactic:
intro i
State after:
case a
f : Bool → Bool → Bool
f_stable : f false false = false
m n k i : Nat
⊢ getBit (bitwise f m n >>> k) i = getBit (bitwise f (m >>> k) (n >>> k)) i

State before:
case a
f : Bool → Bool → Bool
f_stable : f false false = false
m n k i : Nat
⊢ getBit (bitwise f m n >>> k) i = getBit (bitwise f (m >>> k) (n >>> k)) i
Tactic:
simp [bitwise_getBit f f_stable]
State after:
no goals