Lax Lean Archive

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

Proof of `Digraph, DAG and graph isomorphism are GI-complete` (3rd statement)

groundedproofs/Lax604544Proofs/Bridge.lean · lax-604544

What this proof establishes

thm✓Lax604544.GraphIsomorphismDegree (3rd statement)

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 library's theorem, the two degrees being those of the concept's problems, which have the same instances.