This note records a transport layer between the adversarial extendibility language EA(t,r) and the frozen family/interface specification of F*AGI. Its purpose is narrower than a transfer theorem. It does not claim that F*AGI satisfies EA(t,r), does not restate the family note, and does not re-derive the lower-bound program or the transcript-to-notebook pipeline. Instead, it asks how the EA proof objects—centers, critical supports, switches, exposed centers, and defect sets—should be re-expressed inside the protocol-fixed vocabulary of anchors, authorized local windows, boundaries, ports, template identifiers, and canonical local types. The note separates what is already fixed by family design from what still requires family-specific proof, and it lists the minimal open obligations required for an honest transport of the EA layer to F*AGI. It is therefore a transport note, not a family theorem and not a lower-bound theorem for F*AGI.