Proof of `Digraph, DAG and graph isomorphism are GI-complete` (2nd statement)
groundedproofs/Lax604544Proofs/Bridge.lean · lax-604544
What this proof establishes
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
The library's theorem, transported to the concept's problems along the agreements.