Let $(T_i)_{i \in \mathbb{N}}$ be a family of i.i.d. random variables where every $T_i \sim\mathrm{Exp}(\lambda)$. Now let $$Y :=\sum\limits_{j=1}^N T_j$$ such that for all $1 \leq j \leq N-1$ we have $T_j < c$, and $T_N \geq c$. In other words, we perform some experiment until it hits a certain threshold an sum up all outcomes. $N$ counts the number of trials we perform.
Is there a simple way to prove that $N$ is independent of all $T_j$ and also all $T_j \mid T_j < c$?
The context is an introductory course for computer science undergrads; they don't really know about $\sigma$-algebras or any measure theory, just in case that becomes relevant here.