-- Mathlib/.lake/packages/lean4/src/lean/Std/Sat/AIG/RefVecOperator/Fold.lean
theorem denote_go_and {aig : AIG α} (acc : AIG.Ref aig) (curr : Nat) (hcurr : curr ≤ len)
    (input : RefVec aig len) :
    ⟦
      (go aig acc curr len input mkAndCached).aig,
      (go aig acc curr len input mkAndCached).ref,
      assign
    ⟧
      =
    (
      ⟦aig, acc, assign⟧
        ∧
      (∀ (idx : Nat) (hidx1 : idx < len), curr ≤ idx → ⟦aig, input.get idx hidx1, assign⟧)
    )

Proof state:
case isTrue.mp.intro.intro.right
α : Type
inst✝¹ : Hashable α
inst✝ : DecidableEq α
len : Nat
assign : α → Bool
aig : AIG α
acc : aig.Ref
curr : Nat
hcurr : curr ≤ len
input : aig.RefVec len
res : Entrypoint α
h✝ : curr < len
hgo :
  go (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).aig
      (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).ref (curr + 1) len (input.cast ⋯) mkAndCached =
    res
h3 :
  ∀ (idx : Nat) (hidx1 : idx < len),
    curr + 1 ≤ idx →
      ⟦assign,
          { aig := (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).aig,
            ref := (input.get idx hidx1).cast ⋯ }⟧ =
        true
h1 : ⟦assign, { aig := aig, ref := acc }⟧ = true
h2 : ⟦assign, { aig := aig, ref := input.get curr h✝ }⟧ = true
⊢ ∀ (idx : Nat) (hidx1 : idx < len), curr ≤ idx → ⟦assign, { aig := aig, ref := input.get idx hidx1 }⟧ = true

Tactic:
intro idx hidx1 hidx2

Result:
case isTrue.mp.intro.intro.right
α : Type
inst✝¹ : Hashable α
inst✝ : DecidableEq α
len : Nat
assign : α → Bool
aig : AIG α
acc : aig.Ref
curr : Nat
hcurr : curr ≤ len
input : aig.RefVec len
res : Entrypoint α
h✝ : curr < len
hgo :
  go (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).aig
      (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).ref (curr + 1) len (input.cast ⋯) mkAndCached =
    res
h3 :
  ∀ (idx : Nat) (hidx1 : idx < len),
    curr + 1 ≤ idx →
      ⟦assign,
          { aig := (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).aig,
            ref := (input.get idx hidx1).cast ⋯ }⟧ =
        true
h1 : ⟦assign, { aig := aig, ref := acc }⟧ = true
h2 : ⟦assign, { aig := aig, ref := input.get curr h✝ }⟧ = true
idx : Nat
hidx1 : idx < len
hidx2 : curr ≤ idx
⊢ ⟦assign, { aig := aig, ref := input.get idx hidx1 }⟧ = true

Proof state:
case isTrue
α : Type
inst✝¹ : Hashable α
inst✝ : DecidableEq α
len : Nat
assign : α → Bool
aig : AIG α
acc : aig.Ref
curr : Nat
hcurr : curr ≤ len
input : aig.RefVec len
res : Entrypoint α
h✝ : curr < len
hgo :
  go (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).aig
      (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).ref (curr + 1) len (input.cast ⋯) mkAndCached =
    res
⊢ (⟦assign,
        {
          aig :=
            (go (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).aig
                (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).ref (curr + 1) len (input.cast ⋯)
                mkAndCached).aig,
          ref :=
            (go (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).aig
                (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).ref (curr + 1) len (input.cast ⋯)
                mkAndCached).ref }⟧ =
      true) =
    (⟦assign, { aig := aig, ref := acc }⟧ = true ∧
      ∀ (idx : Nat) (hidx1 : idx < len), curr ≤ idx → ⟦assign, { aig := aig, ref := input.get idx hidx1 }⟧ = true)

Tactic:
rw [denote_go_and]

Result:
case isTrue
α : Type
inst✝¹ : Hashable α
inst✝ : DecidableEq α
len : Nat
assign : α → Bool
aig : AIG α
acc : aig.Ref
curr : Nat
hcurr : curr ≤ len
input : aig.RefVec len
res : Entrypoint α
h✝ : curr < len
hgo :
  go (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).aig
      (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).ref (curr + 1) len (input.cast ⋯) mkAndCached =
    res
⊢ (⟦assign,
          { aig := (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).aig,
            ref := (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).ref }⟧ =
        true ∧
      ∀ (idx : Nat) (hidx1 : idx < len),
        curr + 1 ≤ idx →
          ⟦assign,
              { aig := (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).aig,
                ref := (input.cast ⋯).get idx hidx1 }⟧ =
            true) =
    (⟦assign, { aig := aig, ref := acc }⟧ = true ∧
      ∀ (idx : Nat) (hidx1 : idx < len), curr ≤ idx → ⟦assign, { aig := aig, ref := input.get idx hidx1 }⟧ = true)

case isTrue.hcurr
α : Type
inst✝¹ : Hashable α
inst✝ : DecidableEq α
len : Nat
assign : α → Bool
aig : AIG α
acc : aig.Ref
curr : Nat
hcurr : curr ≤ len
input : aig.RefVec len
res : Entrypoint α
h✝ : curr < len
hgo :
  go (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).aig
      (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).ref (curr + 1) len (input.cast ⋯) mkAndCached =
    res
⊢ curr + 1 ≤ len

Proof state:
case isTrue.mp.intro.intro.right.inr
α : Type
inst✝¹ : Hashable α
inst✝ : DecidableEq α
len : Nat
assign : α → Bool
aig : AIG α
acc : aig.Ref
curr : Nat
hcurr : curr ≤ len
input : aig.RefVec len
res : Entrypoint α
h✝ : curr < len
hgo :
  go (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).aig
      (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).ref (curr + 1) len (input.cast ⋯) mkAndCached =
    res
h1 : ⟦assign, { aig := aig, ref := acc }⟧ = true
h2 : ⟦assign, { aig := aig, ref := input.get curr h✝ }⟧ = true
idx : Nat
hidx1 : idx < len
hidx2 : curr ≤ idx
hlt : curr < idx
h3 :
  ⟦assign,
      { aig := (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).aig, ref := (input.get idx hidx1).cast ⋯ }⟧ =
    true
⊢ ⟦assign, { aig := aig, ref := input.get idx hidx1 }⟧ =
    ⟦assign,
      { aig := aig, ref := { gate := ((input.get idx hidx1).cast ⋯).gate, hgate := ?isTrue.mp.intro.intro.right.inr } }⟧

Tactic:
simp

Result:
no goals