Theorem: LO.FirstOrder.Arith.Model.singleton_eq_insert (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} = insert i ∅
Tactic:
simp [singleton_def, insert, bitInsert, emptyset_def]
State after:
no goals