We derive exact restrictions inside the full minimal threecover branch of the current structure theory for a smallest empty-set-free height-five counterexample to Frankl's union-closed sets conjecture. If q0 is the size of the fibre with empty private support and q2 counts the excess members in the three two-private-coordinate fibres, then q0 + q2 ≥ 9. The proof combines deletion-block injections, exact source-capacity saturation, cross-fibre complement intersection, and height-three generation. Its last case uses a new near-extremal lemma: an intersectionclosed height-three family generated by five nonempty sets and having at least fifteen members is the empty set, five pairwise-disjoint generators, and nine or ten pairwise unions. The lemma is proved by a ground-independent reduction to B5. Twenty fail-closed exact checks, implemented twice at every proof-essential finite reduction, audit the boundary-eight case split and the Boolean classification. The result is strictly conditional: it does not eliminate the full three-cover branch, the four-cover branches, or the general height-five case. At the first residual size r = 10, for t = 27, the two independent bounds collapse the fibre parameters to the unique triple (q0, u, q2) = (4, 0, 6).