Lax Lean Archive

While this submission is a draft, it cannot be used by other submissions.

Proof of `Reduction to nonempty summands`

groundedproofs/Lax149335Proofs/Results/SimpleCompleteness.lean · lax-149335

What this proof establishes

lem✓Lax149335.NonemptyReduction

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

The input type is split into the summands on which both terms produce the empty list and the remaining ones; the former are removed with Claim 6.6.