Proof of `Hypergraph representation of simple graphs`
groundedproofs/Lax683916Proofs/HypergraphRepresentation.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 set-system representation of a simple graph becomes a hypergraph by declaring the full ground type to be its vertex set.
Proof strategy
Compose the proved graph–set-system equivalence with the structural equivalence that adds or forgets the fixed spanning vertex set.
Attribution
Direct elementary correspondence, factored through 2-uniform set systems.