Theorems · Theorem · combinatorics
SimpleGraph.fromEdgeSet_mono
∀ {V : Type u} {s t : Set (Sym2 V)}, s ⊆ t → SimpleGraph.fromEdgeSet s ≤ SimpleGraph.fromEdgeSet t- Defined in
- Mathlib.Combinatorics.SimpleGraph.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 65 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- SimpleGraphstatement · cited by 3,072
- le_reflproof · cited by 2,061
- Sym2statement and proof · cited by 737
- le_imp_le_of_le_of_leproof · cited by 576
- SimpleGraph.fromEdgeSetstatement and proof · cited by 43
- Sym2.diagSetproof · cited by 41
- sdiff_leproof · cited by 36
- SimpleGraph.edgeSet_fromEdgeSetproof · cited by 17
- sdiff_le_sdiffproof · cited by 16
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.deleteEdges_antiproof · cited by 0