Proof of `Digraph representation of simple graphs`
groundedproofs/Lax683916Proofs/DigraphRepresentation.lean · lax-683916
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
The two structures are identified by retaining the same adjacency relation.
Proof strategy
Construct each direction by repackaging the adjacency relation together with its symmetry and irreflexivity proofs. Both composites reduce to the original structure.
Attribution
Directly from the definitions of and .