Proof of `Gaifman's locality theorem with a rank bound`
groundedproofs/Lax185574Proofs/GaifmanLocality.lean · lax-185574
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
In the paper
- page 63 of this submission's paper
Description
The formula is translated into the syntax of the normal form of lax-512892, over a vocabulary with one symbol for each relation symbol and a nullary symbol for falsum. Its normal form has radii at most and at most witnesses in each basic local sentence. Every local formula in it has quantifier depth at most , a bound that depends on the arity of the vocabulary but not on its symbols. Back in mathlib's syntax, each ball-restricted quantifier gets a dist-formula guard of quantifier rank at most , which gives the rank bound .