Theorems · Theorem · combinatorics
Graph.map_inc
∀ {α : Type u_1} {α' : Type u_2} {β : Type u_4} {G : Graph α β} {e : β} {x : α'} (f : α → α'),
(Graph.map f G).Inc e x ↔ ∃ v, G.Inc e v ∧ x = f v- Defined in
- Mathlib.Combinatorics.Graph.Maps
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 19 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Graphstatement and proof · cited by 242
- Graph.IsLinkproof · cited by 124
- Graph.Incstatement · cited by 42
- Graph.mapstatement · cited by 16
- Graph.map_isLinkproof · cited by 4
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.