	By mathematical induction on n<ω, we can use ZF in V to prove that for any ordinal α, there is an ordinal β>α such that for any sentence P(z...,z) with z...,z in L and containing fewer than n symbols (counting a constant symbol for an element of L as one symbol) we get that P(z...,z) holds in L if and only if it holds in L.