Mathlib Map

Theorems · Theorem · combinatorics

Graph.Compatible.anti_left

∀ {α : Type u_1} {β : Type u_2} {G G₁ H : Graph α β}, G₁ ≤ G → G.Compatible H → G₁.Compatible H
Defined in
Mathlib.Combinatorics.Graph.Subgraph
Cited by
2 results in Mathlib
Foundations
Depth 62 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.

Graph.Compatible.anti_right · cited by 1Compatible.anti_rightGraph.Compatible.anti · cited by 0Compatible.antiGraph · cited by 242GraphGraph.edgeSet · cited by 79Graph.edgeSetGraph.Compatible · cited by 21Graph.CompatibleGraph.IsSubgraph.edgeSet_mono · cited by 8IsSubgraph.edgeSet_monoGraph.IsSubgraph.isLink_iff · cited by 6IsSubgraph.isLink_iffCompatible.anti_leftCITED BYCITES

Cites5

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

Cited by2

Results whose statement or proof uses this declaration.