Mathlib Map

Theorems · Definition · combinatorics

Graph.Loopless.casesOn

{α : Type u_1} →
  {β : Type u_2} →
    {G : Graph α β} →
      {motive : G.Loopless → Sort u} →
        (t : G.Loopless) → ((not_isLoopAt : ∀ (e : β) (x : α), ¬G.IsLoopAt e x) → motive ⋯) → motive t
Defined in
Mathlib.Combinatorics.Graph.Simple
Cited by
1 results in Mathlib
Foundations
Depth 5 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Graph.loopless_iff · cited by 0Graph.loopless_iffGraph · cited by 242GraphGraph.IsLoopAt · cited by 29Graph.IsLoopAtGraph.Loopless · cited by 12Graph.LooplessLoopless.casesOnCITED BYCITES

Cites3

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.