Is there a formal system that proves its consistency while proving the existence of a stronger formal system that can interpret general recursion too?

Question

So looking at theorems like incompleteness, it is clear that such properties cannot be found from within. But when we take a more vague approach like simply requiring existence, do these restrictions still exist? So to be clearer, beyond even defining stronger systems without construction, could they then prove consistency of such a stronger system?