Ladders are grids
Lax68.LadderGrid · concepts/Lax68/LadderGrid.lean · lax-68
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Every ladder graph is a two-row grid.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
-
no assumptions
thm✓Lax68.LadderGrid
Lean source view on GitHub
| 1 | import Lax68.Ladders |
| 2 | import Lax68.GridsAndWalls |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Ladders are grids |
| 7 | type: theorem |
| 8 | --- |
| 9 | Every ladder graph is a two-row grid. |
| 10 | -/ |
| 11 | |
| 12 | set_option autoImplicit false |
| 13 | |
| 14 | namespace Lax68.LadderGrid |
| 15 | |
| 16 | /-- Every ladder graph is a two-row grid. -/ |
| 17 | axiom ladder_grid {V : Type*} {G : SimpleGraph V} : |
| 18 | Lax68.Ladders.IsLadder G → |
| 19 | Lax68.GridsAndWalls.IsGrid G |
| 20 | |
| 21 | end Lax68.LadderGrid |
| 22 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments