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

Strict paths give nonstrict reachability

Lax330177.StrictInclusion · concepts/Lax330177/StrictInclusion.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

    If u can reach v by a strict temporal path, then u can also reach v by a nonstrict temporal path in the same graph.

    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.

    Lean source view on GitHub

    1import Lax330177.Paths
    2
    3/-!
    4---
    5title: Strict paths give nonstrict reachability
    6type: lemma
    7---
    8If u can reach v by a strict temporal path, then u can also reach v by a nonstrict temporal path in the same graph.
    9
    10[Read the proof.](Lax330177Proofs.Basic.strict_inclusion.html)
    11-/
    12namespace Lax330177.StrictInclusion
    13open Lax330177.Representations
    14open Lax330177.Settings
    15open Lax330177.Paths
    16
    17axiom strict_inclusion {n} {G : Graph n} {u v} : Reaches G .strict u v → Reaches G .nonstrict u v
    18end Lax330177.StrictInclusion
    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…