Theorems · Theorem · combinatorics
Graph.IsNonloopAt.mono
∀ {α : Type u_1} {β : Type u_2} {x : α} {e : β} {G H : Graph α β}, H ≤ G → H.IsNonloopAt e x → G.IsNonloopAt e x- Defined in
- Mathlib.Combinatorics.Graph.Subgraph
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Graphstatement and proof · cited by 242
- Graph.IsLinkproof · cited by 124
- Graph.IsNonloopAtstatement and proof · cited by 16
- Graph.IsLink.monoproof · cited by 11
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.