Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.le_induce_union
∀ {V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} {s s' : Set V}, G'.induce s ⊔ G'.induce s' ≤ G'.induce (s ∪ s')- Cited by
- 3 results in Mathlib
- Foundations
- Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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
- SimpleGraph.Subgraphstatement and proof · cited by 326
- SimpleGraph.Subgraph.Adjproof · cited by 147
- SimpleGraph.Subgraph.inducestatement · cited by 33
- SimpleGraph.Subgraph.induce_adjproof · cited by 17
- SimpleGraph.Subgraph.induce_vertsproof · cited by 15
Cited by3
Results whose statement or proof uses this declaration.
- SimpleGraph.Subgraph.induce_union_connectedproof · cited by 1
- SimpleGraph.Subgraph.le_induce_union_rightproof · cited by 0
- SimpleGraph.Subgraph.le_induce_union_leftproof · cited by 0