-- Mathlib/.lake/packages/lean4/src/lean/Std/Tactic/BVDecide/Bitblast/BVExpr/Circuit/Impl/Operations/Udiv.lean
theorem go_le_size (aig : AIG α) (curr : Nat) (falseRef trueRef : AIG.Ref aig)
    (n d : AIG.RefVec aig w) (wn wr : Nat) (q r : AIG.RefVec aig w) :
    aig.decls.size ≤ (go aig curr falseRef trueRef n d wn wr q r).aig.decls.size

Proof state:
α : Type
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
falseRef trueRef : aig.Ref
n d : aig.RefVec w
wn wr : Nat
q r : aig.RefVec w
⊢ aig.decls.size ≤
    (match curr with
          | 0 => { aig := aig, q := q, r := r, hle := ⋯ }
          | curr.succ =>
            let res := blastDivSubtractShift aig falseRef trueRef n d wn wr q r;
            let aig_1 := res.aig;
            let wn_1 := res.wn;
            let wr_1 := res.wr;
            let q_1 := res.q;
            let r_1 := res.r;
            let_fun this := ⋯;
            let falseRef_1 := falseRef.cast this;
            let trueRef_1 := trueRef.cast this;
            let n_1 := n.cast this;
            let d_1 := d.cast this;
            let res := go aig_1 curr falseRef_1 trueRef_1 n_1 d_1 wn_1 wr_1 q_1 r_1;
            let aig_2 := res.aig;
            let q_2 := res.q;
            let r_2 := res.r;
            let_fun this := ⋯;
            { aig := aig_2, q := q_2, r := r_2, hle := this }).aig.decls.size

Tactic:
dsimp only

Result:
α : Type
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
falseRef trueRef : aig.Ref
n d : aig.RefVec w
wn wr : Nat
q r : aig.RefVec w
⊢ aig.decls.size ≤
    (match curr with
          | 0 => { aig := aig, q := q, r := r, hle := ⋯ }
          | curr.succ =>
            {
              aig :=
                (go (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).aig curr (falseRef.cast ⋯)
                    (trueRef.cast ⋯) (n.cast ⋯) (d.cast ⋯) (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).wn
                    (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).wr
                    (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).q
                    (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).r).aig,
              q :=
                (go (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).aig curr (falseRef.cast ⋯)
                    (trueRef.cast ⋯) (n.cast ⋯) (d.cast ⋯) (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).wn
                    (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).wr
                    (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).q
                    (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).r).q,
              r :=
                (go (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).aig curr (falseRef.cast ⋯)
                    (trueRef.cast ⋯) (n.cast ⋯) (d.cast ⋯) (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).wn
                    (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).wr
                    (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).q
                    (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).r).r,
              hle := ⋯ }).aig.decls.size

Proof state:
α : Type
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
falseRef trueRef : aig.Ref
n d : aig.RefVec w
wn wr : Nat
q r : aig.RefVec w
curr✝¹ curr✝ : Nat
⊢ ?m.34746 ≤
    {
            aig :=
              (go (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).aig curr✝ (falseRef.cast ⋯)
                  (trueRef.cast ⋯) (n.cast ⋯) (d.cast ⋯) (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).wn
                  (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).wr
                  (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).q
                  (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).r).aig,
            q :=
              (go (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).aig curr✝ (falseRef.cast ⋯)
                  (trueRef.cast ⋯) (n.cast ⋯) (d.cast ⋯) (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).wn
                  (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).wr
                  (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).q
                  (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).r).q,
            r :=
              (go (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).aig curr✝ (falseRef.cast ⋯)
                  (trueRef.cast ⋯) (n.cast ⋯) (d.cast ⋯) (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).wn
                  (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).wr
                  (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).q
                  (blastDivSubtractShift aig falseRef trueRef n d wn wr q r).r).r,
            hle := ⋯ }.aig.decls.size

Tactic:
apply go_le_size

Result:
no goals

Proof state:
case h_1
α : Type
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
falseRef trueRef : aig.Ref
n d : aig.RefVec w
wn wr : Nat
q r : aig.RefVec w
curr✝ : Nat
⊢ aig.decls.size ≤ { aig := aig, q := q, r := r, hle := ⋯ }.aig.decls.size

Tactic:
simp

Result:
no goals

Proof state:
α : Type
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
falseRef trueRef : aig.Ref
n d : aig.RefVec w
wn wr : Nat
q r : aig.RefVec w
⊢ aig.decls.size ≤ (go aig curr falseRef trueRef n d wn wr q r).aig.decls.size

Tactic:
unfold go

Result:
α : Type
inst✝¹ : Hashable α
inst✝ : DecidableEq α
w : Nat
aig : AIG α
curr : Nat
falseRef trueRef : aig.Ref
n d : aig.RefVec w
wn wr : Nat
q r : aig.RefVec w
⊢ aig.decls.size ≤
    (match curr with
          | 0 => { aig := aig, q := q, r := r, hle := ⋯ }
          | curr.succ =>
            let res := blastDivSubtractShift aig falseRef trueRef n d wn wr q r;
            let aig_1 := res.aig;
            let wn_1 := res.wn;
            let wr_1 := res.wr;
            let q_1 := res.q;
            let r_1 := res.r;
            let_fun this := ⋯;
            let falseRef_1 := falseRef.cast this;
            let trueRef_1 := trueRef.cast this;
            let n_1 := n.cast this;
            let d_1 := d.cast this;
            let res := go aig_1 curr falseRef_1 trueRef_1 n_1 d_1 wn_1 wr_1 q_1 r_1;
            let aig_2 := res.aig;
            let q_2 := res.q;
            let r_2 := res.r;
            let_fun this := ⋯;
            { aig := aig_2, q := q_2, r := r_2, hle := this }).aig.decls.size