Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.deleteVerts_inter_verts_set_right_eq
∀ {V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} {s : Set V}, G'.deleteVerts (s ∩ G'.verts) = G'.deleteVerts s- Cited by
- 0 results in Mathlib
- Foundations
- Depth 58 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
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
- Set.extproof · cited by 2,266
- SimpleGraph.Subgraphstatement and proof · cited by 326
- SimpleGraph.Subgraph.vertsstatement and proof · cited by 210
- SimpleGraph.Subgraph.Adjproof · cited by 147
- SimpleGraph.Subgraph.extproof · cited by 33
- SimpleGraph.Subgraph.induce_adjproof · cited by 17
- Set.sdiff_inter_self_eq_sdiffproof · cited by 16
- SimpleGraph.Subgraph.induce_vertsproof · cited by 15
- SimpleGraph.Subgraph.deleteVertsstatement · cited by 15
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.