Theorem: LO.FirstOrder.to_opt_eq_some_iff (Logic/FirstOrder/Computability/Calculus.lean)

State before:
μ : Type ?u.1167343
L : Language
inst✝⁶ : (k : ℕ) → DecidableEq (L.Func k)
inst✝⁵ : (k : ℕ) → DecidableEq (L.Rel k)
inst✝⁴ : (k : ℕ) → Primcodable (L.Func k)
inst✝³ : (k : ℕ) → Primcodable (L.Rel k)
inst✝² : UniformlyPrimcodable L.Func
inst✝¹ : UniformlyPrimcodable L.Rel
inst✝ : Primcodable μ
b : Bool
⊢ Bool.toOpt b = some () ↔ b = true
Tactic:
cases b <;> simp[Bool.toOpt]
State after:
no goals