Fifteen years ago, Bramble, Pasciak and Xu developed a framework for analyzing the multigrid method (The analysis of multigrid algorithms with nonnested spaces or noninherited quadratic forms, Mathematics of Computation, 1991.) It was, known as BPX Framework, widely used in the analysis of mutligrid and domain decomposition methods. The framework was extended several times, covering less regularity or non-symmetric, and other cases. However an apparent limit of the framework is that it could not incorporate the number of smoothings in the V-cycle analysis. Therefore, the framework is limited in nonnested multigrid methods (as one-smoothing multigrid methods won\'t converge for almost all nonnested cases), and it produces variable V-cycle, relaxed coarse-level correction, or non-uniform convergence rate V-cycle methods, or other non-optimal results in analysis thus far. Therefore, most non-nested finite element problems were show to converge only for W-cycles based BPX framework, or an even earlier frame work of Bank and Dupont. This paper completes a long time effort in extending the BPX Framework so that the number of smoothings is included in the V-cycle analysis. We will apply the extended BPX Framework to the analysis of many V-cycle nonnested multigrid methods. Some of them were previously proven for two-level and W-cycle iterations only.