induction scope with
| nil => simp [Hne]
| cons head tail =>
  simp
  byCases H: head.fst = v'
  . simp [Hne]
  . byCases H2: head.fst = v
    assumption
α σ : Type
ε : σ → Type
α✝ σ✝ : Type
ε✝ : σ✝ → Type
δ : Dialect α✝ σ✝ ε✝
v v' : SSAVal
Hne : v' ≠ v
scope : SSAScope δ
τ : MLIRType δ
val : MLIRType.eval τ
⊢ getT v (set v' τ val scope) = getT v scope
no goals