[shulda]

Genuinely new finite cardinal bridge for the remaining p3 q=m−1 side age: in any word of length N≥7 with at least N−2 distinct labels, ≤2 of the first six adjacent edges are equal. Proof removes repeated-edge successors; the image is unchanged because each label's minimal occurrence cannot be a repeated successor. This yields actual opposite-parity globally singleton block labels through the already green six-edge selector when the word is monotone. Two axioms audit exports. Still need to show cardinality of concrete sorted packet's attained block labels is ≥N−2 from its q=m−1 occupancy assumption. Draft until full root CI; main/work branch untouched.