Claim 1. Fix c and ω. Off Ω0U the path is identically 0, a counting path. On Ω0U the path is u↦∑j=1Jc∑i=1Kc,j(ω)1{Uic,j(ω)≤u}, a finite sum of indicators of half-lines [Uic,j(ω),∞) with pairwise distinct left endpoints in (0,R]: it vanishes at 0, takes values in N0, is nondecreasing and right-continuous (each indicator is), and has unit jumps because the endpoints are distinct; so it is a counting path (Counting Path and Its Jump Times). For u≥R every indicator equals 1, so the path is constant on [R,∞).
Claim 2.P♯,c is a stochastic process by the measurability just noted, and property 1 of Poisson Clock with a Horizon is claim 1. For the remaining properties, let 0≤u0<u1<⋯<ur be real numbers and write Δq=Puq♯,c−Puq−1♯,c (1≤q≤r). By claim 1, Δq=0 identically if uq−1≥R, and Δq=PR♯,c−Puq−1♯,c if uq−1<R≤uq; in all cases Δq=Puq∧R♯,c−Puq−1∧R♯,c. Let q∗ be the number of indices q with uq−1<R. The increments Δ1,…,Δq∗ are the increments of P♯,c over the partition u0<u1<⋯<uq∗−1<uq∗∧R of a subinterval of [0,R] (the group being empty when q∗=0), hence are independent, Δq having the Poisson distribution with parameter (uq∧R)−(uq−1∧R), by claim 2 of The Copy Clocks Have Independent Poisson Increments on the Clock Interval: Law Identity with the Uniform Poisson Path and Applicability of the Window Discrepancy Bound; and Δq∗+1,…,Δr are identically 0, which has the Poisson distribution with parameter 0=(uq∧R)−(uq−1∧R) (the unit mass at 0, Poisson Distribution). A random variable that is identically 0 is independent of every family of random variables: for a Borel set B′ the event {Δq∈B′} is Ω or ∅, so every joint probability factorizes (Independence of Events and of Random Variables). Hence Δ1,…,Δr are independent: this is property 2 of Poisson Clock with a Horizon, and the increment laws are property 3.
Claim 3. For each label c let Dc be the σ-algebra generated by the c-th block of driving variables, Kc, Vic (i∈N) and Uic,j (1≤j≤Jc, i∈N). Since the whole family of driving variables is independent and the blocks are disjoint, the family (Dc)c is independent by the grouping lemma (applied after enumerating the countable index set of the driving variables, independence being unaffected by reindexing). Put P~uc=∑j=1Jc∑i=1Kc,j1{Uic,j≤u} (u≥0); as Kc,j=∑i=1Kc1{Vic∈Ic,j} is the cell count of Uniform Representation of the Rate-One Poisson Counting Path on a Bounded Interval: Distinct Points, Poisson Increments, Conditional Law Given the Cell Counts, and Point Insertion for the c-th block, hence measurable with respect to the σ-algebra generated by Kc and the Vic and a fortiori Dc-measurable, each P~uc is Dc-measurable (Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions: the sum equals ∑j∑i∈N1{i≤Kc,j}1{Uic,j≤u}, a pointwise limit of finite sums of products of Dc-measurable indicators), and Pu♯,c=P~uc on Ω0U. Let Ec be the class of events A∈σ(Pu♯,c:u≥0) for which there is an event A~∈Dc with A∩Ω0U=A~∩Ω0U. This class is a σ-algebra (it contains Ω, and complements and countable unions of the A~'s serve for complements and countable unions of the A's), and it contains the generators {Pu♯,c∈B′} (u≥0, B′ a Borel set), with A~={P~uc∈B′}; hence every A∈σ(Pu♯,c:u≥0) admits such an A~, and P(A)=P(A~) since P(Ω0U)=1. Now let Ac∈σ(Pu♯,c:u≥0) be given for the labels c in a finite set of labels, with A~c∈Dc as above. Then ⋂cAc and ⋂cA~c agree on Ω0U, so
Claim 4. Fix r∈R. For y∈N0L, on the event {K=y} one has Pu♯,c(ω)=Pu(y),c(ω) for all c and u≥0, by the definition Pu♯,c(ω)=Pu(K(ω)),c(ω); hence the data (P♯(ω),ar,x0) and (P(y)(ω),ar,x0) coincide, and (r,ω)∈G♯ if and only if (r,ω)∈G(y). Therefore