Throughout, for classes G and S and a set C, CβGSβ holds if and only if CβG and CβS, by Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (ii).
Proof of (i). Let AβX and let C be a set. Then Cβ(FXβ)Aβ if and only if CβF, CβX and CβA, while CβFAβ if and only if CβF and CβA. Since CβA and AβX give CβX (β is transitive, by Subclasses and Subsets (i)), the two conditions are equivalent. Hence (FXβ)Aβ=FAβ by Axiom of Extensionality for Classes.
Proof of (ii). Let BβA. By (i), applied with A in place of X and B in place of A,
(FAβ)Bβ=FBβ.
Moreover FBββFAβ: an element C of FBβ satisfies CβF and CβB, hence CβA (β is transitive, by Subclasses and Subsets (i)), so CβFAβ. Therefore, by Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (iv) with H=ΞΌ, S=FAβ and T=FBβ,
(ΞΌAβ)β£(FAβ)Bββ=(ΞΌβ£FAββ)β£FBββ=ΞΌβ£FBββ=ΞΌBβ.