Lax Lean Archive

Proof of `Type trees are distance types`

groundedproofs/Lax185574Proofs/TreeEquivalence.lean · lax-185574

What this proof establishes

cor✓Lax185574.TreeEquivalence

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

In the paper

  • page 43 of this submission's paper

Description

The rightwards implication follows from the evaluation lemma: the evaluation program receives equal inputs for the two tuples, so it gives equal answers. The vertex type is renamed to FinnFin n for this. The converse is nodeeqofsatiffnode_eq_of_sat_iff, by induction on qq.