This question was prompted by a discussion from another MO question about the consistency of ZFC. There are some mathematicians who are comfortable with ZFC but uneasy with large cardinals. For them, it may be unsettling that Mizar assumes infinitely many inaccessibles, and that Lean's dependent type theory makes a similar tacit assumption. Basically, this is because they appeal to Grothendieck universes.
Now, there is an alternative: Feferman's universes achieve most of what a "practicing mathematician" wants from Grothendieck's universes, but has the advantage of being conservative over ZFC. So here's my question:
Suppose we wanted a proof assistant to avoid going beyond the consistency strength of ZFC, while retaining essentially all the functionality of something like Mizar or Lean. Could this be done using the Feferman-universe idea? How difficult would this be to implement and what would be the tradeoffs?
(Maybe this question belongs on the proof assistants StackExchange, but that site seems to be more of a help desk for existing proof assistants than a forum for broader mathematical questions like this one.)