I recently found this question: Proof of the Existence of All Phone Numbers in Pi
I understand why it can be seen as a duplicate of Does π contain all possible number combinations?, but the question is much more specific and there is a proof that doesn't need π to be a normal number: a proof by exhaustion.
As discussed in my comment, since the early 2000s, we know enough digits of π to prove that it contains all 10-digit number sequences with an exhaustive search. However, this proof wouldn't make sense as an answer to the question on all possible number combinations.
Related question: Should questions about special cases of a more general problem be marked (closed) as duplicate?