Prove the invariants for arbitrary trace length

Prove the invariants for arbitrary trace length

Prove by induction that the head, tail, and count stay within bounds and that dequeue order matches enqueue order for any trace length. Do not rely on the bounded check. Deliverable: A machine-checked proof file with no unproved goals, plus a note naming the claims the bounded check alone does not cover.