the proof of greens theorem is all there is to proving stokes theorem.
i.e. the proof of stokes is just a parametrized version of the proof of greens in a rectangle.
it is indeed simply the FTC plus the trick of repeated integration.
i.e. ftc is stokes in one dimension, and repeated integration gives the higher diml case by induction.
parametrizing any manifold locally by maps from rectangles gives it on any manifold with boundary.
rigorous patching of these parameter maps is usually done nowadays by a trick called partitions of unity. this is the deep idea that if you take a function that equals 1 on the interval [1,2], and goes down linearly to 0, at 0 and 3, and if you add it to a similar function that equals 1 on the interval [3,4], and goes down to 0, at 2 and 5, you get a similar function that equals 1 all the way from 1 to 4.
If you keep this up, thus you have "partitioned" the unity function (the function 1) into several pieces.
this is all in spivak's calculus on manifolds, together with the language of "chains" for parametrized rectangles, but I think lang makes it look easier, in his Analysis I, appendix.