Theorem: LO.FirstOrder.Arith.Model.bitRemove_lt_of_mem (Arithmetization/ISigmaOne/Bit.lean)

State before:
M : Type u_1
inst✝⁵ : Zero M
inst✝⁴ : One M
inst✝³ : Add M
inst✝² : Mul M
inst✝¹ : LT M
inst✝ : M ⊧ₘ* 𝐈𝚺₁
i a : M
h : i ∈ a
⊢ bitRemove i a < a
Tactic:
simp [h, bitRemove, tsub_lt_iff_left (exp_le_of_mem h)]
State after:
no goals