-- Mathlib/.lake/packages/lean4/src/lean/Std/Sat/AIG/RefVecOperator/Zip.lean
theorem denote_go {aig : AIG α} (curr : Nat) (hcurr : curr ≤ len) (s : RefVec aig curr)
    (lhs rhs : RefVec aig len) (f : (aig : AIG α) → BinaryInput aig → Entrypoint α)
    [LawfulOperator α BinaryInput f] [chainable : LawfulZipOperator α f] :
    ∀ (idx : Nat) (hidx1 : idx < len),
      curr ≤ idx
        →
      ⟦
        (go aig curr s hcurr lhs rhs f).aig,
        (go aig curr s hcurr lhs rhs f).vec.get idx hidx1,
        assign
      ⟧
        =
      ⟦f aig ⟨lhs.get idx hidx1, rhs.get idx hidx1⟩, assign⟧

Proof state:
case isTrue.inr
α : Type
inst✝² : Hashable α
inst✝¹ : DecidableEq α
len : Nat
assign : α → Bool
aig : AIG α
curr : Nat
hcurr : curr ≤ len
s : aig.RefVec curr
lhs rhs : aig.RefVec len
f : (aig : AIG α) → aig.BinaryInput → Entrypoint α
inst✝ : LawfulOperator α BinaryInput f
chainable : LawfulZipOperator α f
idx : Nat
hidx1 : idx < len
hidx2 : curr ≤ idx
res : RefVecEntry α len
h✝ : curr < len
hgo :
  go (f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).aig (curr + 1)
      ((s.cast ⋯).push (f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).ref) ⋯ (lhs.cast ⋯) (rhs.cast ⋯) f =
    res
hlt : curr < idx
⊢ ⟦assign,
      {
        aig :=
          (go (f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).aig (curr + 1)
              ((s.cast ⋯).push (f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).ref) ⋯ (lhs.cast ⋯)
              (rhs.cast ⋯) f).aig,
        ref :=
          (go (f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).aig (curr + 1)
                  ((s.cast ⋯).push (f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).ref) ⋯ (lhs.cast ⋯)
                  (rhs.cast ⋯) f).vec.get
            idx hidx1 }⟧ =
    ⟦assign, f aig { lhs := lhs.get idx hidx1, rhs := rhs.get idx hidx1 }⟧

Tactic:
rw [denote_go]

Result:
case isTrue.inr
α : Type
inst✝² : Hashable α
inst✝¹ : DecidableEq α
len : Nat
assign : α → Bool
aig : AIG α
curr : Nat
hcurr : curr ≤ len
s : aig.RefVec curr
lhs rhs : aig.RefVec len
f : (aig : AIG α) → aig.BinaryInput → Entrypoint α
inst✝ : LawfulOperator α BinaryInput f
chainable : LawfulZipOperator α f
idx : Nat
hidx1 : idx < len
hidx2 : curr ≤ idx
res : RefVecEntry α len
h✝ : curr < len
hgo :
  go (f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).aig (curr + 1)
      ((s.cast ⋯).push (f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).ref) ⋯ (lhs.cast ⋯) (rhs.cast ⋯) f =
    res
hlt : curr < idx
⊢ ⟦assign,
      f (f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).aig
        { lhs := (lhs.cast ⋯).get idx hidx1, rhs := (rhs.cast ⋯).get idx hidx1 }⟧ =
    ⟦assign, f aig { lhs := lhs.get idx hidx1, rhs := rhs.get idx hidx1 }⟧

case isTrue.inr.a
α : Type
inst✝² : Hashable α
inst✝¹ : DecidableEq α
len : Nat
assign : α → Bool
aig : AIG α
curr : Nat
hcurr : curr ≤ len
s : aig.RefVec curr
lhs rhs : aig.RefVec len
f : (aig : AIG α) → aig.BinaryInput → Entrypoint α
inst✝ : LawfulOperator α BinaryInput f
chainable : LawfulZipOperator α f
idx : Nat
hidx1 : idx < len
hidx2 : curr ≤ idx
res : RefVecEntry α len
h✝ : curr < len
hgo :
  go (f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).aig (curr + 1)
      ((s.cast ⋯).push (f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).ref) ⋯ (lhs.cast ⋯) (rhs.cast ⋯) f =
    res
hlt : curr < idx
⊢ curr + 1 ≤ idx

Proof state:
case isTrue.inr
α : Type
inst✝² : Hashable α
inst✝¹ : DecidableEq α
len : Nat
assign : α → Bool
aig : AIG α
curr : Nat
hcurr : curr ≤ len
s : aig.RefVec curr
lhs rhs : aig.RefVec len
f : (aig : AIG α) → aig.BinaryInput → Entrypoint α
inst✝ : LawfulOperator α BinaryInput f
chainable : LawfulZipOperator α f
idx : Nat
hidx1 : idx < len
hidx2 : curr ≤ idx
res : RefVecEntry α len
h✝ : curr < len
hgo :
  go (f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).aig (curr + 1)
      ((s.cast ⋯).push (f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).ref) ⋯ (lhs.cast ⋯) (rhs.cast ⋯) f =
    res
hlt : curr < idx
⊢ ⟦assign,
      f (f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).aig
        { lhs := (lhs.cast ⋯).get idx hidx1, rhs := (rhs.cast ⋯).get idx hidx1 }⟧ =
    ⟦assign, f aig { lhs := lhs.get idx hidx1, rhs := rhs.get idx hidx1 }⟧

Tactic:
simp [-Ref.cast_eq]

Result:
no goals

Proof state:
α : Type
inst✝² : Hashable α
inst✝¹ : DecidableEq α
len : Nat
assign : α → Bool
aig : AIG α
curr : Nat
hcurr : curr ≤ len
s : aig.RefVec curr
lhs rhs : aig.RefVec len
f : (aig : AIG α) → aig.BinaryInput → Entrypoint α
inst✝ : LawfulOperator α BinaryInput f
chainable : LawfulZipOperator α f
⊢ ∀ (idx : Nat) (hidx1 : idx < len),
    curr ≤ idx →
      ⟦assign,
          { aig := (go aig curr s hcurr lhs rhs f).aig, ref := (go aig curr s hcurr lhs rhs f).vec.get idx hidx1 }⟧ =
        ⟦assign, f aig { lhs := lhs.get idx hidx1, rhs := rhs.get idx hidx1 }⟧

Tactic:
intro idx hidx1 hidx2

Result:
α : Type
inst✝² : Hashable α
inst✝¹ : DecidableEq α
len : Nat
assign : α → Bool
aig : AIG α
curr : Nat
hcurr : curr ≤ len
s : aig.RefVec curr
lhs rhs : aig.RefVec len
f : (aig : AIG α) → aig.BinaryInput → Entrypoint α
inst✝ : LawfulOperator α BinaryInput f
chainable : LawfulZipOperator α f
idx : Nat
hidx1 : idx < len
hidx2 : curr ≤ idx
⊢ ⟦assign, { aig := (go aig curr s hcurr lhs rhs f).aig, ref := (go aig curr s hcurr lhs rhs f).vec.get idx hidx1 }⟧ =
    ⟦assign, f aig { lhs := lhs.get idx hidx1, rhs := rhs.get idx hidx1 }⟧

Proof state:
case isTrue.inl
α : Type
inst✝² : Hashable α
inst✝¹ : DecidableEq α
len : Nat
assign : α → Bool
aig : AIG α
curr : Nat
hcurr : curr ≤ len
s : aig.RefVec curr
lhs rhs : aig.RefVec len
f : (aig : AIG α) → aig.BinaryInput → Entrypoint α
inst✝ : LawfulOperator α BinaryInput f
chainable : LawfulZipOperator α f
idx : Nat
hidx1 : idx < len
hidx2 : curr ≤ idx
res : RefVecEntry α len
h✝ : curr < len
hgo :
  go (f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).aig (curr + 1)
      ((s.cast ⋯).push (f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).ref) ⋯ (lhs.cast ⋯) (rhs.cast ⋯) f =
    res
heq : curr = idx
⊢ ⟦assign,
      { aig := (f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).aig,
        ref :=
          { gate := ((f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).ref.cast ⋯).gate,
            hgate := ?isTrue.inl.hstart } }⟧ =
    ⟦assign, f aig { lhs := lhs.get curr ⋯, rhs := rhs.get curr ⋯ }⟧

Tactic:
simp

Result:
no goals

Proof state:
case isTrue.inl.hstart
α : Type
inst✝² : Hashable α
inst✝¹ : DecidableEq α
len : Nat
assign : α → Bool
aig : AIG α
curr : Nat
hcurr : curr ≤ len
s : aig.RefVec curr
lhs rhs : aig.RefVec len
f : (aig : AIG α) → aig.BinaryInput → Entrypoint α
inst✝ : LawfulOperator α BinaryInput f
chainable : LawfulZipOperator α f
idx : Nat
hidx1 : idx < len
hidx2 : curr ≤ idx
res : RefVecEntry α len
h✝ : curr < len
hgo :
  go (f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).aig (curr + 1)
      ((s.cast ⋯).push (f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).ref) ⋯ (lhs.cast ⋯) (rhs.cast ⋯) f =
    res
heq : curr = idx
⊢ ((f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).ref.cast ⋯).gate <
    (f aig { lhs := lhs.get curr h✝, rhs := rhs.get curr h✝ }).aig.decls.size

Tactic:
simp [Ref.hgate]

Result:
no goals