Proof of `Model Checking for Σ₁ Reduces to Positive Σ₁`
groundedproofs/Lax496464Proofs/WHierarchy/Lemmas/NegElim/Final.lean · lax-496464
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.
Description
(Flum–Grohe, Lemma 6.11). The universe is first compressed to the entries of the tuples and further elements (a -formula of size at most cannot tell the difference); the structure is then expanded by the order and, per symbol , by its first tuple, its last tuple, its consecutive pairs and (the universe if is empty), and every negative literal is replaced by a positive existential formula over these ( by ). The new parameter is at most , and the map is computed by an IMP+ program in steps.