induction scope with
| nil => simp
| cons head tail =>
  simp
  byCases H: head.fst = v
  assumption
α σ : Type
ε : σ → Type
α✝ σ✝ : Type
ε✝ : σ✝ → Type
δ : Dialect α✝ σ✝ ε✝
scope : SSAScope δ
v : SSAVal
τ : MLIRType δ
val : MLIRType.eval τ
⊢ getT v (set v τ val scope) = some { fst := τ, snd := val }
no goals