Proof of `Full paired witness lists and scalar recipe equations` (2nd statement)
groundedproofs/Lax342547Proofs/PairedWitnesses.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
Each endpoint has exactly two lists, each of length at most seven. The dependent sum of their position types therefore has at most fourteen elements.