Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.IsBridge.anti

∀ {V : Type u} {G G' : SimpleGraph V} {e : Sym2 V}, G ≤ G' → G'.IsBridge e → G.IsBridge e
Defined in
Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
Cited by
1 results in Mathlib
Foundations
Depth 63 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.

SimpleGraph.IsBridge.anti_of_mem_edgeSet · cited by 0IsBridge.anti_of_mem_edge…SimpleGraph · cited by 3072SimpleGraphSym2 · cited by 737Sym2Sym2.Rel · cited by 43Sym2.RelSimpleGraph.IsBridge · cited by 30SimpleGraph.IsBridgeSimpleGraph.Reachable.mono · cited by 10Reachable.monoSimpleGraph.isBridge_iff · cited by 3SimpleGraph.isBridge_iffSimpleGraph.deleteEdges_mono · cited by 2SimpleGraph.deleteEdges_m…IsBridge.antiCITED BYCITES

Cites7

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

Cited by1

Results whose statement or proof uses this declaration.