Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Subgraph.le_induce_union_right

∀ {V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} {s s' : Set V}, G'.induce s' ≤ G'.induce (s ∪ s')
Defined in
Mathlib.Combinatorics.SimpleGraph.Subgraph
Cited by
0 results in Mathlib
Foundations
Depth 65 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Set · cited by 53352SetSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Subgraph · cited by 326SimpleGraph.Subgraphsup_le_iff · cited by 58sup_le_iffSimpleGraph.Subgraph.induce · cited by 33Subgraph.induceSimpleGraph.Subgraph.le_induce_union · cited by 3Subgraph.le_induce_unionSubgraph.le_induce_union_rightCITED BYCITES

Cites6

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.