Theorem: denoteOp_equiv
Proof state before:
α₁ σ₁ : Type
ε₁ : σ₁ → Type
δ₁ : Dialect α₁ σ₁ ε₁
α₂ σ₂ : Type
ε₂ : σ₂ → Type
δ₂ : Dialect α₂ σ₂ ε₂
α σ : Type
ε : σ → Type
Δ : Dialect α σ ε
S : Semantics Δ
op_name : String
args : List (TypedSSAVal Δ)
regions : List (Region Δ)
attrs : AttrDict Δ
env : SSAEnv Δ
r : TypedArgs Δ
env' env₂ : SSAEnv Δ
Henv₂ : SSAEnv.equiv env env₂
x✝¹ : Except (String × SSAEnv Δ) (List (TypedArg Δ) × SSAEnv Δ)
argsRes : List (TypedArg Δ) × SSAEnv Δ
argRes : List (TypedArg Δ)
HargsRes : denoteOpArgs Δ args env = Except.ok (argRes, env)
x✝ : Except (String × SSAEnv Δ) (List (TypedArg Δ) × SSAEnv Δ)
regR✝ : List (TypedArg Δ) × SSAEnv Δ
regR : List (TypedArg Δ)
regEnv : SSAEnv Δ
HRegInd :
  denoteRegionsEquivInvariant (TopM.mapDenoteRegion Δ regions) →
    ∀ ⦃opM : OpM Δ (TypedArgs Δ)⦄ ⦃env : SSAEnv Δ⦄ ⦃res : TypedArgs Δ⦄ ⦃env' : SSAEnv Δ⦄,
      OpM.toTopM (TopM.mapDenoteRegion Δ regions) opM env = Except.ok (res, env') →
        ∀ ⦃env₂ : SSAEnv Δ⦄,
          SSAEnv.equiv env env₂ →
            ∃ env₂',
              SSAEnv.equiv env' env₂' ∧ OpM.toTopM (TopM.mapDenoteRegion Δ regions) opM env₂ = Except.ok (res, env₂')
regEnv₂ : SSAEnv Δ
HregEnv₂ : SSAEnv.equiv regEnv regEnv₂
headRes : TypedSSAVal Δ
HregR :
  OpM.toTopM (TopM.mapDenoteRegion Δ regions)
      (Semantics.semantics_op
        (IOp.mk op_name (List.map Prod.snd [headRes]) (argRes, env).fst (OpM.denoteRegions regions 0) attrs))
      (argRes, env).snd =
    Except.ok (regR, regEnv)
H :
  (match [headRes] with
      | [] => fun s => Except.ok ((regR, regEnv).fst, s)
      | [res] =>
        match (regR, regEnv).fst with
        | [{ fst := τ, snd := v }] => fun s =>
          match TopM.set τ res.fst v s with
          | Except.error err => Except.error err
          | Except.ok v => Except.ok ((regR, regEnv).fst, v.snd)
        | x => fun s =>
          match
            TopM.raiseUB
              (toString "denoteOp: expected 1 return value, got '" ++ toString (regR, regEnv).fst ++ toString "'")
              s with
          | Except.error err => Except.error err
          | Except.ok v => Except.ok ((regR, regEnv).fst, v.snd)
      | x => fun s =>
        match
          TopM.raiseUB (toString "denoteOp: expected 0 or 1 results, got '" ++ toString [headRes] ++ toString "'")
            s with
        | Except.error err => Except.error err
        | Except.ok v => Except.ok ((regR, regEnv).fst, v.snd))
      (regR, regEnv).snd =
    Except.ok (r, env')
HregR₂ :
  OpM.toTopM (TopM.mapDenoteRegion Δ regions)
      (Semantics.semantics_op
        (IOp.mk op_name (List.map Prod.snd [headRes]) (argRes, env).fst (OpM.denoteRegions regions 0) attrs))
      env₂ =
    Except.ok (regR, regEnv₂)
⊢ ∃ env₂',
    SSAEnv.equiv env' env₂' ∧
      (match
          OpM.toTopM (TopM.mapDenoteRegion Δ regions)
            (Semantics.semantics_op
              (IOp.mk op_name (List.map Prod.snd [headRes]) argRes (OpM.denoteRegions regions 0) attrs))
            env₂ with
        | Except.error err => Except.error err
        | Except.ok v =>
          (match [headRes] with
            | [] => fun s => Except.ok (v.fst, s)
            | [res] =>
              match v.fst with
              | [{ fst := τ, snd := v_1 }] => fun s =>
                match TopM.set τ res.fst v_1 s with
                | Except.error err => Except.error err
                | Except.ok v_2 => Except.ok (v.fst, v_2.snd)
              | x => fun s =>
                match
                  TopM.raiseUB (toString "denoteOp: expected 1 return value, got '" ++ toString v.fst ++ toString "'")
                    s with
                | Except.error err => Except.error err
                | Except.ok v_1 => Except.ok (v.fst, v_1.snd)
            | x => fun s =>
              match
                TopM.raiseUB (toString "denoteOp: expected 0 or 1 results, got '" ++ toString [headRes] ++ toString "'")
                  s with
              | Except.error err => Except.error err
              | Except.ok v_1 => Except.ok (v.fst, v_1.snd))
            v.snd) =
        Except.ok (r, env₂')
Tactic:
case nil =>
  simp
  cases regR
  case nil => simp at *; cases H
  case cons opRHead opRTail =>
    cases opRTail
    case cons _ _ =>  simp at *; cases H
    case nil =>
        simp at *
        split at H <;> try contradiction
        case h_2 setRes HSetRes =>
        sorry
Proof state after:
no goals