Proof of `Reversing precedence constraints` (1st statement)
groundedproofs/Lax434175Proofs/PrecedenceReversal.lean · lax-434175
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.
Description
Each defining condition is symmetric under reversal, up to exchanging predecessors and successors.