Proof of `Few types far from a parameter set, with a fixed tuple of parameters`
groundedproofs/Lax185574Proofs/SeparatingTypesTuples.lean · lax-185574
What this proof establishes
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 64 of this submission's paper
Description
The bound follows from , since for a fixed tuple ū from
the type of ā ū over is determined by the type of ā over .
A formula about ā ū becomes a formula about ā of the same quantifier
rank when the variables for ū are replaced by the parameters ū.