Proof of `Uniform mixing forms chosen simultaneously before any unit law` (1st statement)
groundedproofs/Lax342547Proofs/UniformMixers.lean · lax-342547
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
Instantiate the simultaneous theorem with the paper's mixer parameters. For every sufficiently large n it supplies all unary row-space and polar-rank conclusions and every ordered binary parity bound, before any unit law is quantified over.