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

Departure times on a proper graph

Lax330177.ProperPathTimes · concepts/Lax330177/ProperPathTimes.lean · lax-330177

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Lemma

    On a proper directed or undirected graph, every nonstrict temporal path already has strictly increasing departure times.

    Read the proof.

    Concept map
    4 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    In the paper

    • page 2 of this submission's paper

    Lean source view on GitHub

    1import Lax330177.Paths
    2
    3/-!
    4---
    5title: Departure times on a proper graph
    6type: lemma
    7---
    8On a proper directed or undirected graph, every nonstrict temporal path already has strictly increasing departure times.
    9
    10[Read the proof.](Lax330177Proofs.Basic.proper_path_times.html)
    11-/
    12namespace Lax330177.ProperPathTimes
    13open Lax330177.Representations
    14open Lax330177.Settings
    15open Lax330177.Paths
    16
    17axiom proper_path_times {n k} (G : Graph n) (d : Direction) (hg : IsProper d G) (w : TemporalPath G .nonstrict k) : StrictMono w.val.time
    18end Lax330177.ProperPathTimes
    19
    Show Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…