Theorems · Theorem · combinatorics
Graph.Inc.mono
∀ {α : Type u_1} {β : Type u_2} {x : α} {e : β} {G H : Graph α β}, H ≤ G → H.Inc e x → G.Inc e x- Defined in
- Mathlib.Combinatorics.Graph.Subgraph
- Cited by
- 2 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.Incstatement and proof · cited by 42
- Graph.IsLink.monoproof · cited by 11
- Graph.IsLink.inc_leftproof · cited by 8
Cited by2
Results whose statement or proof uses this declaration.
- Graph.IsClosedSubgraph.inc_congrproof · cited by 2
- Graph.IsClosedSubgraph.anti_rightproof · cited by 0