Theorem: LO.FirstOrder.Arith.Model.isempty_iff (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 ⊧ₘ* 𝐈𝚺₁
s : M
⊢ s = ∅ ↔ ∀ (x : M), x ∉ s
Tactic:
simpa using not_iff_not.mpr (nonempty_iff (s := s))
State after:
no goals