In this paper, we consider a bilevel multiobjective fractional programming problem $(\mathcal{BMFP})$ with an extremal value function. We provide necessary and sufficient optimality conditions characterizing (properly, weakly) efficient solutions of the considered problem. These optimality conditions are obtained in terms of sequences and based on sequential calculus rules for the Br\o ndsted-Rockafellar subdifferential of the sum and the multi-composition of convex functions, without constraint qualifications. Manuscript profile