Skip to content

Commit b33c9d7

Browse files
committed
comment out Int.shiftLeft_add'
1 parent 148ee21 commit b33c9d7

File tree

1 file changed

+5
-0
lines changed

1 file changed

+5
-0
lines changed

Mathlib/Data/Int/Bitwise.lean

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -363,6 +363,10 @@ theorem shiftRight_add' : ∀ (m : ℤ) (n k : ℕ), m >>> (n + k : ℤ) = (m >>
363363

364364
/-! ### bitwise ops -/
365365

366+
-- Commented out: please either fix,
367+
-- or remove after https://github.com/leanprover-community/mathlib4/pull/28884 is merged
368+
-- (that PR proposed deprecating these theorems).
369+
/-
366370
theorem shiftLeft_add' : ∀ (m : ℤ) (n : ℕ) (k : ℤ), m <<< ((n : ℤ) + k) = (m <<< (n : ℤ)) <<< k
367371
| (m : ℕ), n, (k : ℕ) =>
368372
congr_arg ofNat (by simp [Nat.shiftLeft_eq, Nat.pow_add, mul_assoc])
@@ -388,6 +392,7 @@ theorem shiftLeft_add' : ∀ (m : ℤ) (n : ℕ) (k : ℤ), m <<< ((n : ℤ) + k
388392
389393
theorem shiftLeft_sub (m : ℤ) (n : ℕ) (k : ℤ) : m <<< ((n : ℤ) - k) = (m <<< (n : ℤ)) >>> k :=
390394
shiftLeft_add' _ _ _
395+
-/
391396

392397
theorem shiftLeft_eq_mul_pow : ∀ (m : ℤ) (n : ℕ), m <<< (n : ℤ) = m * (2 ^ n : ℕ)
393398
| (m : ℕ), _ => congr_arg ((↑) : ℕ → ℤ) (by simp [Nat.shiftLeft_eq])

0 commit comments

Comments
 (0)