Order (N) rate solution for rigid multibody systems whose equations of motion (eom) are derived from Hamilton's equations has been presented in the recent past. Order (N) means that the computational effort of that solution is proportional to N, number of bodies in the system. The method of this solution is a recursive algorithm similar to that by Brandl (1988) in solving accelerations from the Newton-Euler equations based eom. An alternate closed form order(N) rate solution for the same problem has also been published, where the derivation method is similar to that of Rodriguez et.al (1992) in using their the Spatial Operator Algebra (SOA) for the same problem Brandl addressed. While the two rate solutions are equivalent intuitively, the proof of that equivalence has not been demonstrated. This paper has that proof in mind. In particular, it will show the derivation of the closed form order (N) rate solution from implicit rate equations of the recursive algorithm.