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