Càdlàg versions are indistinguishable (source code)

= Càdlàg versions are indistinguishable

If two <versions of a stochastic process> both have <càdlàg> paths on an event of probability one, equality at every rational time holds simultaneously outside one null event. Approaching an arbitrary time by rationals from the right then gives equality at every time on the same event. Thus the <stochastic processes> are <indistinguishable>. <Right continuity> suffices; left limits are unnecessary for this conclusion.