Theorems · Theorem · combinatorics
SimpleGraph.deleteEdges_anti
∀ {V : Type u_1} {G : SimpleGraph V} {s₁ s₂ : Set (Sym2 V)}, s₁ ⊆ s₂ → G.deleteEdges s₂ ≤ G.deleteEdges s₁- Cited by
- 0 results in Mathlib
- Foundations
- Depth 66 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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 and proof · cited by 3,072
- Sym2statement and proof · cited by 737
- SimpleGraph.deleteEdgesstatement · cited by 64
- sdiff_le_sdiff_leftproof · cited by 6
- SimpleGraph.fromEdgeSet_monoproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.