theorem
Hex.GraphIso.Nauty.Sparse.CountScan.fresh
{n stamp j : Nat}
{before marks touched starts hits cleared : Array Nat}
{seen : List Nat}
(h : CountScan n stamp before marks touched starts hits seen)
(hj : j < n)
(hk : starts[j]! < n)
(hm : marks[starts[j]!]! ≠ stamp + 1)
(hs : cleared.size = n)
(hz : ∀ (v : Nat), v < n → cleared[v]! = if starts[v]! = starts[j]! then 0 else hits[v]!)
: