In a (finite horizon) sequential game of complete information, any subgame perfect Nash equilibrium (SPNE) necessarily must specify the equilibrium of the last stage game as a Nash equilibrium.
I am wondering if an analogous result holds for sequential games of incomplete information, that is, in a perfect Bayesian equilibrium (PBE) does the last stage game form a Bayesian Nash equilibrium (BNE)?
In PBE, the information sets are not subgames, and a subgame begins at a singleton information set, where the current state is common knowledge. For example, the standard signaling game with two types, two messages for the sender, and two actions for the receiver has only one subgame, the whole game. So the "last subgame" you mention in your question is not necessarily the same thing as the terminal decision nodes or terminal simultaneous move subgame in a complete information dynamic game.
But if you solve for a PBE and then wipe away the beliefs, the players are still mutually best-responding, so it constitutes a Bayesian Nash Eqm of the game. The problem is that, like with complete information, there might be many patterns of best responses which cannot make sense when compared across subgames. But when you solve for a PBE, usually you sketch out a set of mutual best responses and then check what the beliefs are that support those choices (or show there aren't any such beliefs). That's already a BNE for the game if there are no profitable deviations, it just might not survive the stronger criterion of Bayesian beliefs, because there is dynamically sub-optimal behavior somewhere, just as in the comparison with NE and SPNE.