This module contains the verification of the bitblaster for `BitVec.rotateLeft` from `Impl.Operations.RotateLeft`.

source
@[irreducible]
theorem Std.Tactic.BVDecide.BVExpr.bitblast.blastRotateLeft.go_get_aux {α : Type} [Hashable α] [DecidableEq α] {w : Nat} (aig : Sat.AIG α) (distance : Nat) (input : aig.RefVec w) (curr : Nat) (hcurr : curr ≤ w) (s : aig.RefVec curr) (idx : Nat) (hidx : idx < curr) :
(go input distance curr hcurr s).get idx ⋯ = s.get idx hidx
source
@[irreducible]
theorem Std.Tactic.BVDecide.BVExpr.bitblast.blastRotateLeft.go_get {α : Type} [Hashable α] [DecidableEq α] {w : Nat} (aig : Sat.AIG α) (distance : Nat) (input : aig.RefVec w) (curr : Nat) (hcurr : curr ≤ w) (s : aig.RefVec curr) (idx : Nat) (hidx1 : idx < w) :
curr ≤ idx → (go input distance curr hcurr s).get idx hidx1 = if hidx3 : idx < distance % w then input.get (w - distance % w + idx) ⋯ else input.get (idx - distance % w) ⋯
source
@[simp]
theorem Std.Tactic.BVDecide.BVExpr.bitblast.denote_blastRotateLeft {α : Type} [Hashable α] [DecidableEq α] {w : Nat} (aig : Sat.AIG α) (target : aig.ShiftTarget w) (assign : α → Bool) (idx : Nat) (hidx : idx < w) :
⟦assign, { aig := (blastRotateLeft aig target).aig, ref := (blastRotateLeft aig target).vec.get idx hidx }⟧ = if hidx2 : idx < target.distance % w then ⟦assign, { aig := aig, ref := target.vec.get (w - target.distance % w + idx) ⋯ }⟧ else ⟦assign, { aig := aig, ref := target.vec.get (idx - target.distance % w) ⋯ }⟧