Mathlib Map

Theorems · Theorem · combinatorics

Graph.IsLoopAt.not_isNonloopAt

∀ {α : Type u_1} {β : Type u_2} {x : α} {e : β} {G : Graph α β}, G.IsLoopAt e x → ∀ (y : α), ¬G.IsNonloopAt e y
Defined in
Mathlib.Combinatorics.Graph.Basic
Cited by
1 results in Mathlib
Foundations
Depth 12 from the axioms · uses Classical.choice
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Graph.IsNonloopAt.not_isLoopAt · cited by 1IsNonloopAt.not_isLoopAtGraph · cited by 242GraphGraph.IsLink · cited by 124Graph.IsLinkGraph.IsLoopAt · cited by 29Graph.IsLoopAtGraph.IsNonloopAt · cited by 16Graph.IsNonloopAtGraph.IsLink.inc_left · cited by 8IsLink.inc_leftGraph.IsLink.inc_right · cited by 3IsLink.inc_rightGraph.IsLoopAt.eq_of_inc · cited by 1IsLoopAt.eq_of_incIsLoopAt.not_isNonloopAtCITED BYCITES

Cites7

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.