Theorems · Theorem · combinatorics
Graph.IsClosedSubgraph.rfl
∀ {α : Type u_1} {β : Type u_2} {G : Graph α β}, G.IsClosedSubgraph G- Defined in
- Mathlib.Combinatorics.Graph.Subgraph
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 67 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Graphstatement and proof · cited by 242
- reflproof · cited by 80
- Graph.IsClosedSubgraphstatement · cited by 17
Cited by1
Results whose statement or proof uses this declaration.
- Graph.isClosedSubgraph_bot_iffproof · cited by 0