internlm/Lean-Github huggingface dataset:
Theorem: AIG.denote_mkIfCached
Proof state before:
case e_x
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
assign : α → Bool
aig : AIG α
input : aig.TernaryInput
⊢ ⟦{
        aig :=
          ((aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).aig.mkNotCached
              { gate := input.discr.gate, hgate := ⋯ }).aig,
        ref := { gate := (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).ref.gate, hgate := ?e_x } },
      assign⟧ =
    (⟦{ aig := aig, ref := input.discr }, assign⟧ && ⟦{ aig := aig, ref := input.lhs }, assign⟧)

case e_x
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
assign : α → Bool
aig : AIG α
input : aig.TernaryInput
⊢ (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).ref.gate <
    ((aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).aig.mkNotCached
            { gate := input.discr.gate, hgate := ⋯ }).aig.decls.size
Tactic:
rw [LawfulOperator.denote_mem_prefix]
Proof state after:
case e_x
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
assign : α → Bool
aig : AIG α
input : aig.TernaryInput
⊢ ⟦{ aig := (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).aig,
        ref := { gate := (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).ref.gate, hgate := ?e_x } },
      assign⟧ =
    (⟦{ aig := aig, ref := input.discr }, assign⟧ && ⟦{ aig := aig, ref := input.lhs }, assign⟧)

case e_x
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
assign : α → Bool
aig : AIG α
input : aig.TernaryInput
⊢ (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).ref.gate <
    (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).aig.decls.size
Theorem: AIG.denote_mkIfCached
Proof state before:
case e_x
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
assign : α → Bool
aig : AIG α
input : aig.TernaryInput
⊢ ⟦{ aig := (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).aig,
        ref := { gate := (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).ref.gate, hgate := ?e_x } },
      assign⟧ =
    (⟦{ aig := aig, ref := input.discr }, assign⟧ && ⟦{ aig := aig, ref := input.lhs }, assign⟧)

case e_x
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
assign : α → Bool
aig : AIG α
input : aig.TernaryInput
⊢ (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).ref.gate <
    (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).aig.decls.size
Tactic:
. simp
Proof state after:
case e_x
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
assign : α → Bool
aig : AIG α
input : aig.TernaryInput
⊢ (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).ref.gate <
    (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).aig.decls.size
Theorem: AIG.denote_mkIfCached
Proof state before:
case e_x
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
assign : α → Bool
aig : AIG α
input : aig.TernaryInput
⊢ (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).ref.gate <
    (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).aig.decls.size
Tactic:
. simp [Ref.hgate]
Proof state after:
no goals
Theorem: AIG.denote_mkIfCached
Proof state before:
case e_x
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
assign : α → Bool
aig : AIG α
input : aig.TernaryInput
⊢ ⟦{ aig := (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).aig,
        ref := { gate := (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).ref.gate, hgate := ?e_x } },
      assign⟧ =
    (⟦{ aig := aig, ref := input.discr }, assign⟧ && ⟦{ aig := aig, ref := input.lhs }, assign⟧)
Tactic:
simp
Proof state after:
no goals
Theorem: AIG.denote_mkIfCached
Proof state before:
case e_x
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
assign : α → Bool
aig : AIG α
input : aig.TernaryInput
⊢ (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).ref.gate <
    (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).aig.decls.size
Tactic:
simp [Ref.hgate]
Proof state after:
no goals
Theorem: AIG.denote_mkIfCached
Proof state before:
case e_y.e_x
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
assign : α → Bool
aig : AIG α
input : aig.TernaryInput
⊢ (!⟦{ aig := (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).aig,
          ref := { gate := input.discr.gate, hgate := ⋯ } },
        assign⟧) =
    !⟦{ aig := aig, ref := input.discr }, assign⟧
Tactic:
rw [LawfulOperator.denote_mem_prefix]
Proof state after:
no goals
Theorem: AIG.denote_mkIfCached
Proof state before:
case e_y.e_y
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
assign : α → Bool
aig : AIG α
input : aig.TernaryInput
⊢ ⟦{
        aig :=
          ((aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).aig.mkNotCached
              { gate := input.discr.gate, hgate := ⋯ }).aig,
        ref := { gate := input.rhs.gate, hgate := ⋯ } },
      assign⟧ =
    ⟦{ aig := aig, ref := input.rhs }, assign⟧
Tactic:
rw [LawfulOperator.denote_mem_prefix]
Proof state after:
case e_y.e_y
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
assign : α → Bool
aig : AIG α
input : aig.TernaryInput
⊢ ⟦{ aig := (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).aig,
        ref := { gate := input.rhs.gate, hgate := ?e_y.e_y } },
      assign⟧ =
    ⟦{ aig := aig, ref := input.rhs }, assign⟧

case e_y.e_y
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
assign : α → Bool
aig : AIG α
input : aig.TernaryInput
⊢ input.rhs.gate < (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).aig.decls.size
Theorem: AIG.denote_mkIfCached
Proof state before:
case e_y.e_y
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
assign : α → Bool
aig : AIG α
input : aig.TernaryInput
⊢ ⟦{ aig := (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).aig,
        ref := { gate := input.rhs.gate, hgate := ?e_y.e_y } },
      assign⟧ =
    ⟦{ aig := aig, ref := input.rhs }, assign⟧

case e_y.e_y
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
assign : α → Bool
aig : AIG α
input : aig.TernaryInput
⊢ input.rhs.gate < (aig.mkAndCached { lhs := input.discr, rhs := input.lhs }).aig.decls.size
Tactic:
rw [LawfulOperator.denote_mem_prefix]
Proof state after:
no goals
Theorem: AIG.RefStream.ite.go_le_size
Proof state before:
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
⊢ aig.decls.size ≤ (go aig curr hcurr discr lhs rhs s).aig.decls.size
Tactic:
unfold go
Proof state after:
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
⊢ aig.decls.size ≤
    (if hcurr : curr < w then
            let input := { discr := discr, lhs := lhs.getRef curr hcurr, rhs := rhs.getRef curr hcurr };
            let res := aig.mkIfCached input;
            let aig_1 := res.aig;
            let ref := res.ref;
            let_fun this := ⋯;
            let discr_1 := discr.cast this;
            let lhs_1 := lhs.cast this;
            let rhs_1 := rhs.cast this;
            let s := s.cast this;
            let s := s.pushRef ref;
            go aig_1 (curr + 1) ⋯ discr_1 lhs_1 rhs_1 s
          else
            let_fun this := ⋯;
            { aig := aig, stream := this ▸ s }).aig.decls.size
Theorem: AIG.RefStream.ite.go_le_size
Proof state before:
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
⊢ aig.decls.size ≤
    (if hcurr : curr < w then
            let input := { discr := discr, lhs := lhs.getRef curr hcurr, rhs := rhs.getRef curr hcurr };
            let res := aig.mkIfCached input;
            let aig_1 := res.aig;
            let ref := res.ref;
            let_fun this := ⋯;
            let discr_1 := discr.cast this;
            let lhs_1 := lhs.cast this;
            let rhs_1 := rhs.cast this;
            let s := s.cast this;
            let s := s.pushRef ref;
            go aig_1 (curr + 1) ⋯ discr_1 lhs_1 rhs_1 s
          else
            let_fun this := ⋯;
            { aig := aig, stream := this ▸ s }).aig.decls.size
Tactic:
split
Proof state after:
case isTrue
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
h✝ : curr < w
⊢ aig.decls.size ≤
    (let input := { discr := discr, lhs := lhs.getRef curr h✝, rhs := rhs.getRef curr h✝ };
          let res := aig.mkIfCached input;
          let aig_1 := res.aig;
          let ref := res.ref;
          let_fun this := ⋯;
          let discr_1 := discr.cast this;
          let lhs_1 := lhs.cast this;
          let rhs_1 := rhs.cast this;
          let s := s.cast this;
          let s := s.pushRef ref;
          go aig_1 (curr + 1) ⋯ discr_1 lhs_1 rhs_1 s).aig.decls.size

case isFalse
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
h✝ : ¬curr < w
⊢ aig.decls.size ≤
    (let_fun this := ⋯;
          { aig := aig, stream := this ▸ s }).aig.decls.size
Theorem: AIG.RefStream.ite.go_le_size
Proof state before:
case isTrue
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
h✝ : curr < w
⊢ aig.decls.size ≤
    (let input := { discr := discr, lhs := lhs.getRef curr h✝, rhs := rhs.getRef curr h✝ };
          let res := aig.mkIfCached input;
          let aig_1 := res.aig;
          let ref := res.ref;
          let_fun this := ⋯;
          let discr_1 := discr.cast this;
          let lhs_1 := lhs.cast this;
          let rhs_1 := rhs.cast this;
          let s := s.cast this;
          let s := s.pushRef ref;
          go aig_1 (curr + 1) ⋯ discr_1 lhs_1 rhs_1 s).aig.decls.size

case isFalse
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
h✝ : ¬curr < w
⊢ aig.decls.size ≤
    (let_fun this := ⋯;
          { aig := aig, stream := this ▸ s }).aig.decls.size
Tactic:
. dsimp
  refine Nat.le_trans ?_ (by apply go_le_size)
  apply LawfulOperator.le_size (f := mkIfCached)
Proof state after:
case isFalse
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
h✝ : ¬curr < w
⊢ aig.decls.size ≤
    (let_fun this := ⋯;
          { aig := aig, stream := this ▸ s }).aig.decls.size
Theorem: AIG.RefStream.ite.go_le_size
Proof state before:
case isFalse
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
h✝ : ¬curr < w
⊢ aig.decls.size ≤
    (let_fun this := ⋯;
          { aig := aig, stream := this ▸ s }).aig.decls.size
Tactic:
. simp
Proof state after:
no goals
Theorem: AIG.RefStream.ite.go_le_size
Proof state before:
case isTrue
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
h✝ : curr < w
⊢ aig.decls.size ≤
    (let input := { discr := discr, lhs := lhs.getRef curr h✝, rhs := rhs.getRef curr h✝ };
          let res := aig.mkIfCached input;
          let aig_1 := res.aig;
          let ref := res.ref;
          let_fun this := ⋯;
          let discr_1 := discr.cast this;
          let lhs_1 := lhs.cast this;
          let rhs_1 := rhs.cast this;
          let s := s.cast this;
          let s := s.pushRef ref;
          go aig_1 (curr + 1) ⋯ discr_1 lhs_1 rhs_1 s).aig.decls.size
Tactic:
dsimp
Proof state after:
case isTrue
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
h✝ : curr < w
⊢ aig.decls.size ≤
    (go (aig.mkIfCached { discr := discr, lhs := lhs.getRef curr h✝, rhs := rhs.getRef curr h✝ }).aig (curr + 1) ⋯
            { gate := discr.gate, hgate := ⋯ } (lhs.cast ⋯) (rhs.cast ⋯)
            ((s.cast ⋯).pushRef
              (aig.mkIfCached
                  { discr := discr, lhs := lhs.getRef curr h✝, rhs := rhs.getRef curr h✝ }).ref)).aig.decls.size
Theorem: AIG.RefStream.ite.go_le_size
Proof state before:
case isTrue
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
h✝ : curr < w
⊢ aig.decls.size ≤
    (go (aig.mkIfCached { discr := discr, lhs := lhs.getRef curr h✝, rhs := rhs.getRef curr h✝ }).aig (curr + 1) ⋯
            { gate := discr.gate, hgate := ⋯ } (lhs.cast ⋯) (rhs.cast ⋯)
            ((s.cast ⋯).pushRef
              (aig.mkIfCached
                  { discr := discr, lhs := lhs.getRef curr h✝, rhs := rhs.getRef curr h✝ }).ref)).aig.decls.size
Tactic:
refine Nat.le_trans ?_ (by apply go_le_size)
Proof state after:
case isTrue
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
h✝ : curr < w
⊢ aig.decls.size ≤
    (aig.mkIfCached { discr := discr, lhs := lhs.getRef curr h✝, rhs := rhs.getRef curr h✝ }).aig.decls.size
Theorem: AIG.RefStream.ite.go_le_size
Proof state before:
case isTrue
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
h✝ : curr < w
⊢ aig.decls.size ≤
    (aig.mkIfCached { discr := discr, lhs := lhs.getRef curr h✝, rhs := rhs.getRef curr h✝ }).aig.decls.size
Tactic:
apply LawfulOperator.le_size (f := mkIfCached)
Proof state after:
no goals
Theorem: AIG.RefStream.ite.go_le_size
Proof state before:
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
h✝ : curr < w
⊢ ?m.98826 ≤
    (go (aig.mkIfCached { discr := discr, lhs := lhs.getRef curr h✝, rhs := rhs.getRef curr h✝ }).aig (curr + 1) ⋯
            { gate := discr.gate, hgate := ⋯ } (lhs.cast ⋯) (rhs.cast ⋯)
            ((s.cast ⋯).pushRef
              (aig.mkIfCached
                  { discr := discr, lhs := lhs.getRef curr h✝, rhs := rhs.getRef curr h✝ }).ref)).aig.decls.size
Tactic:
apply go_le_size
Proof state after:
no goals
Theorem: AIG.RefStream.ite.go_le_size
Proof state before:
case isFalse
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
h✝ : ¬curr < w
⊢ aig.decls.size ≤
    (let_fun this := ⋯;
          { aig := aig, stream := this ▸ s }).aig.decls.size
Tactic:
simp
Proof state after:
no goals
Theorem: AIG.RefStream.ite.go_decl_eq
Proof state before:
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
⊢ ∀ (idx : Nat) (h1 : idx < aig.decls.size) (h2 : idx < (go aig curr hcurr discr lhs rhs s).aig.decls.size),
    (go aig curr hcurr discr lhs rhs s).aig.decls[idx] = aig.decls[idx]
Tactic:
generalize hgo : go aig curr hcurr discr lhs rhs s = res
Proof state after:
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
res : RefStreamEntry α w
hgo : go aig curr hcurr discr lhs rhs s = res
⊢ ∀ (idx : Nat) (h1 : idx < aig.decls.size) (h2 : idx < res.aig.decls.size), res.aig.decls[idx] = aig.decls[idx]
Theorem: AIG.RefStream.ite.go_decl_eq
Proof state before:
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
res : RefStreamEntry α w
hgo : go aig curr hcurr discr lhs rhs s = res
⊢ ∀ (idx : Nat) (h1 : idx < aig.decls.size) (h2 : idx < res.aig.decls.size), res.aig.decls[idx] = aig.decls[idx]
Tactic:
unfold go at hgo
Proof state after:
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
res : RefStreamEntry α w
hgo :
  (if hcurr : curr < w then
      let input := { discr := discr, lhs := lhs.getRef curr hcurr, rhs := rhs.getRef curr hcurr };
      let res := aig.mkIfCached input;
      let aig_1 := res.aig;
      let ref := res.ref;
      let_fun this := ⋯;
      let discr_1 := discr.cast this;
      let lhs_1 := lhs.cast this;
      let rhs_1 := rhs.cast this;
      let s := s.cast this;
      let s := s.pushRef ref;
      go aig_1 (curr + 1) ⋯ discr_1 lhs_1 rhs_1 s
    else
      let_fun this := ⋯;
      { aig := aig, stream := this ▸ s }) =
    res
⊢ ∀ (idx : Nat) (h1 : idx < aig.decls.size) (h2 : idx < res.aig.decls.size), res.aig.decls[idx] = aig.decls[idx]
Theorem: AIG.RefStream.ite.go_decl_eq
Proof state before:
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
res : RefStreamEntry α w
hgo :
  (if hcurr : curr < w then
      let input := { discr := discr, lhs := lhs.getRef curr hcurr, rhs := rhs.getRef curr hcurr };
      let res := aig.mkIfCached input;
      let aig_1 := res.aig;
      let ref := res.ref;
      let_fun this := ⋯;
      let discr_1 := discr.cast this;
      let lhs_1 := lhs.cast this;
      let rhs_1 := rhs.cast this;
      let s := s.cast this;
      let s := s.pushRef ref;
      go aig_1 (curr + 1) ⋯ discr_1 lhs_1 rhs_1 s
    else
      let_fun this := ⋯;
      { aig := aig, stream := this ▸ s }) =
    res
⊢ ∀ (idx : Nat) (h1 : idx < aig.decls.size) (h2 : idx < res.aig.decls.size), res.aig.decls[idx] = aig.decls[idx]
Tactic:
split at hgo
Proof state after:
case isTrue
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
res : RefStreamEntry α w
h✝ : curr < w
hgo :
  (let input := { discr := discr, lhs := lhs.getRef curr h✝, rhs := rhs.getRef curr h✝ };
    let res := aig.mkIfCached input;
    let aig_1 := res.aig;
    let ref := res.ref;
    let_fun this := ⋯;
    let discr_1 := discr.cast this;
    let lhs_1 := lhs.cast this;
    let rhs_1 := rhs.cast this;
    let s := s.cast this;
    let s := s.pushRef ref;
    go aig_1 (curr + 1) ⋯ discr_1 lhs_1 rhs_1 s) =
    res
⊢ ∀ (idx : Nat) (h1 : idx < aig.decls.size) (h2 : idx < res.aig.decls.size), res.aig.decls[idx] = aig.decls[idx]

case isFalse
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
res : RefStreamEntry α w
h✝ : ¬curr < w
hgo :
  (let_fun this := ⋯;
    { aig := aig, stream := this ▸ s }) =
    res
⊢ ∀ (idx : Nat) (h1 : idx < aig.decls.size) (h2 : idx < res.aig.decls.size), res.aig.decls[idx] = aig.decls[idx]
Theorem: AIG.RefStream.ite.go_decl_eq
Proof state before:
case isTrue
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
res : RefStreamEntry α w
h✝ : curr < w
hgo :
  (let input := { discr := discr, lhs := lhs.getRef curr h✝, rhs := rhs.getRef curr h✝ };
    let res := aig.mkIfCached input;
    let aig_1 := res.aig;
    let ref := res.ref;
    let_fun this := ⋯;
    let discr_1 := discr.cast this;
    let lhs_1 := lhs.cast this;
    let rhs_1 := rhs.cast this;
    let s := s.cast this;
    let s := s.pushRef ref;
    go aig_1 (curr + 1) ⋯ discr_1 lhs_1 rhs_1 s) =
    res
⊢ ∀ (idx : Nat) (h1 : idx < aig.decls.size) (h2 : idx < res.aig.decls.size), res.aig.decls[idx] = aig.decls[idx]

case isFalse
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
res : RefStreamEntry α w
h✝ : ¬curr < w
hgo :
  (let_fun this := ⋯;
    { aig := aig, stream := this ▸ s }) =
    res
⊢ ∀ (idx : Nat) (h1 : idx < aig.decls.size) (h2 : idx < res.aig.decls.size), res.aig.decls[idx] = aig.decls[idx]
Tactic:
. dsimp at hgo
  rw [← hgo]
  intro idx h1 h2
  rw [go_decl_eq]
  rw [AIG.LawfulOperator.decl_eq (f := AIG.mkIfCached)]
  apply AIG.LawfulOperator.lt_size_of_lt_aig_size (f := AIG.mkIfCached)
  assumption
Proof state after:
case isFalse
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
res : RefStreamEntry α w
h✝ : ¬curr < w
hgo :
  (let_fun this := ⋯;
    { aig := aig, stream := this ▸ s }) =
    res
⊢ ∀ (idx : Nat) (h1 : idx < aig.decls.size) (h2 : idx < res.aig.decls.size), res.aig.decls[idx] = aig.decls[idx]
Theorem: AIG.RefStream.ite.go_decl_eq
Proof state before:
case isFalse
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
res : RefStreamEntry α w
h✝ : ¬curr < w
hgo :
  (let_fun this := ⋯;
    { aig := aig, stream := this ▸ s }) =
    res
⊢ ∀ (idx : Nat) (h1 : idx < aig.decls.size) (h2 : idx < res.aig.decls.size), res.aig.decls[idx] = aig.decls[idx]
Tactic:
. simp [← hgo]
Proof state after:
no goals
Theorem: AIG.RefStream.ite.go_decl_eq
Proof state before:
case isTrue
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
res : RefStreamEntry α w
h✝ : curr < w
hgo :
  (let input := { discr := discr, lhs := lhs.getRef curr h✝, rhs := rhs.getRef curr h✝ };
    let res := aig.mkIfCached input;
    let aig_1 := res.aig;
    let ref := res.ref;
    let_fun this := ⋯;
    let discr_1 := discr.cast this;
    let lhs_1 := lhs.cast this;
    let rhs_1 := rhs.cast this;
    let s := s.cast this;
    let s := s.pushRef ref;
    go aig_1 (curr + 1) ⋯ discr_1 lhs_1 rhs_1 s) =
    res
⊢ ∀ (idx : Nat) (h1 : idx < aig.decls.size) (h2 : idx < res.aig.decls.size), res.aig.decls[idx] = aig.decls[idx]
Tactic:
dsimp at hgo
Proof state after:
case isTrue
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
hcurr : curr ≤ w
discr : aig.Ref
lhs rhs : aig.RefStream w
s : aig.RefStream curr
res : RefStreamEntry α w
h✝ : curr < w
hgo :
  go (aig.mkIfCached { discr := discr, lhs := lhs.getRef curr h✝, rhs := rhs.getRef curr h✝ }).aig (curr + 1) ⋯
      { gate := discr.gate, hgate := ⋯ } (lhs.cast ⋯) (rhs.cast ⋯)
      ((s.cast ⋯).pushRef
        (aig.mkIfCached { discr := discr, lhs := lhs.getRef curr h✝, rhs := rhs.getRef curr h✝ }).ref) =
    res
⊢ ∀ (idx : Nat) (h1 : idx < aig.decls.size) (h2 : idx < res.aig.decls.size), res.aig.decls[idx] = aig.decls[idx]