The Löwenheim-Hilbert-Bernays theorem states that, for an arithmetical first-order language L, if S is a satisfiable schema, then substitution of open sentences of L for the predicate letters of S...