Theorem: LO.FirstOrder.Arith.Model.under_zero (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 : M), i ∈ under 0 ↔ i ∈ ∅
Tactic:
simp [mem_under_iff]
State after:
no goals