Theorem: LO.FirstOrder.Arith.Model.fbit_eq_zero_iff (Arithmetization/ISigmaZero/Exponential/Log.lean)

State before:
M : Type u_1
inst✝⁵ : Zero M
inst✝⁴ : One M
inst✝³ : Add M
inst✝² : Mul M
inst✝¹ : LT M
inst✝ : M ⊧ₘ* 𝐈𝚫₀
a i : M
⊢ fbit a i = 0 ↔ ¬LenBit (bexp a i) a
Tactic:
simp [fbit, LenBit.iff_rem]
State after:
no goals