-- 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.mpr.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
hacc : ⟦assign, { aig := aig, ref := acc }⟧ = true
hrest : ∀ (idx : Nat) (hidx1 : idx < len), curr ≤ idx → ⟦assign, { aig := aig, ref := input.get idx hidx1 }⟧ = true
⊢ ∀ (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

Tactic:
intro idx hidx1 hidx2

Result:
case isTrue.mpr.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
hacc : ⟦assign, { aig := aig, ref := acc }⟧ = true
hrest : ∀ (idx : Nat) (hidx1 : idx < len), curr ≤ idx → ⟦assign, { aig := aig, ref := input.get idx hidx1 }⟧ = true
idx : Nat
hidx1 : idx < len
hidx2 : curr + 1 ≤ idx
⊢ ⟦assign,
      { aig := (aig.mkAndCached { lhs := acc, rhs := input.get curr h✝ }).aig, ref := (input.get idx hidx1).cast ⋯ }⟧ =
    true

Proof state:
α : 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 α
hgo : go aig acc curr len input mkAndCached = res
⊢ (⟦assign, { aig := res.aig, ref := res.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:
unfold go at hgo

Result:
α : 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 α
hgo :
  (if hidx : curr < len then
      let res := aig.mkAndCached { lhs := acc, rhs := input.get curr hidx };
      let aig_1 := res.aig;
      let newAcc := res.ref;
      let input := input.cast ⋯;
      go aig_1 newAcc (curr + 1) len input mkAndCached
    else { aig := aig, ref := acc }) =
    res
⊢ (⟦assign, { aig := res.aig, ref := res.ref }⟧ = true) =
    (⟦assign, { aig := aig, ref := acc }⟧ = true ∧
      ∀ (idx : Nat) (hidx1 : idx < len), curr ≤ idx → ⟦assign, { aig := aig, ref := input.get idx hidx1 }⟧ = true)

Proof state:
case isTrue.mp.intro.intro.left
α : 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
⊢ ⟦assign, { aig := aig, ref := acc }⟧ = true

Tactic:
assumption

Result:
no goals

Proof state:
case isFalse
α : 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 : { aig := aig, ref := acc } = res
⊢ (⟦assign, { aig := res.aig, ref := res.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 [← hgo]

Result:
case isFalse
α : 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 : { aig := aig, ref := acc } = res
⊢ (⟦assign, { aig := { aig := aig, ref := acc }.aig, ref := { aig := aig, ref := acc }.ref }⟧ = true) =
    (⟦assign, { aig := aig, ref := acc }⟧ = true ∧
      ∀ (idx : Nat) (hidx1 : idx < len), curr ≤ idx → ⟦assign, { aig := aig, ref := input.get idx hidx1 }⟧ = true)

Proof state:
case isTrue.mp
α : 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
h :
  (⟦assign, { aig := aig, ref := acc }⟧ = true ∧ ⟦assign, { aig := aig, ref := input.get curr h✝ }⟧ = true) ∧
    ∀ (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
⊢ ⟦assign, { aig := aig, ref := acc }⟧ = true ∧
    ∀ (idx : Nat) (hidx1 : idx < len), curr ≤ idx → ⟦assign, { aig := aig, ref := input.get idx hidx1 }⟧ = true

Tactic:
rcases h with ⟨⟨h1, h2⟩, h3⟩

Result:
case isTrue.mp.intro.intro
α : 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
⊢ ⟦assign, { aig := aig, ref := acc }⟧ = true ∧
    ∀ (idx : Nat) (hidx1 : idx < len), curr ≤ idx → ⟦assign, { aig := aig, ref := input.get idx hidx1 }⟧ = true