Use the usual completed right-continuous Brownian filtration. The strict passage process is finite at every level on one probability-one event: finiteness at all integer levels from (a) suffices by monotonicity. Also almost surely by (b).
For each fixed , is a stopping time with . The Strong Markov property shows that the passage times above this level depend on a new independent standard Brownian motion. Thus for , is independent of the past at and has the same law as . Iteration gives independent increments and stationary increments in the level parameter. From (a) and fixed-level equality,
For , this also proves continuity in probability at zero, since
Finally, with , we have . This strict generalized inverse of a nondecreasing function is right-continuous: if , then for any we have , and eventually , which forces . Monotonicity gives the reverse bound. Monotonicity and local finiteness also give finite left limits. Hence is the Brownian first-passage subordinator, with càdlàg paths.
Now condition on this clock, which is independent of . For a deterministic partition , write and . Conditional on the clock these are independent centered Gaussian increments, with respective variances . Consequently
Factorization and dependence only on interval lengths prove independent increments and stationary increments for . For small , in probability, and independence and continuity of imply in probability. For example, bound its deviation probability by and then let and . Stationary increments give stochastic continuity at every deterministic level. Composition of the continuous path of with the nondecreasing càdlàg clock gives càdlàg paths for , and . Thus
This is subordination of a Lévy process. Using strict passage times ensures the required right-continuous path choice, despite their fixed-level equality with the non-strict times.