Proof of `Integer power bounds on class decomposition bags`
groundedproofs/Lax263307Proofs/PowerBagBounds.lean · lax-263307
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
Use the integer root's defining power inequalities to bound every bag, prove monotonicity in edge count, obtain the lower bound one, and preserve the original power inequality.