Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.IsIndContained.lineGraph

∀ {V : Type u_1} {V' : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph V'},
  G.IsIndContained G' → G.lineGraph.IsIndContained G'.lineGraph
Defined in
Mathlib.Combinatorics.SimpleGraph.LineGraph
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.Elem · cited by 7166Set.ElemSimpleGraph · cited by 3072SimpleGraphSym2 · cited by 737Sym2Nonempty.some · cited by 340Nonempty.someSimpleGraph.edgeSet · cited by 199SimpleGraph.edgeSetSimpleGraph.IsIndContained · cited by 22SimpleGraph.IsIndContainedSimpleGraph.lineGraph · cited by 7SimpleGraph.lineGraphSimpleGraph.Embedding.toCopy · cited by 7Embedding.toCopySimpleGraph.Copy.toLineGraphEmbedding · cited by 2Copy.toLineGraphEmbeddingIsIndContained.lineGraphCITED BYCITES

Cites9

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.