Theorems · Theorem · combinatorics
Graph.Simple.anti
∀ {α : Type u_1} {β : Type u_2} {G H : Graph α β} [G.Simple], H ≤ G → H.Simple- Defined in
- Mathlib.Combinatorics.Graph.Simple
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Graph.Simple
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
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.IsLink.monoproof · cited by 11
- Graph.Simplestatement and proof · cited by 4
- Graph.IsLink.eqproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.