Theorems · Theorem · combinatorics
SimpleGraph.leftInverse_comap_map
∀ {V : Type u_1} {W : Type u_2} (f : V ↪ W), Function.LeftInverse (SimpleGraph.comap ⇑f) (SimpleGraph.map ⇑f)- Defined in
- Mathlib.Combinatorics.SimpleGraph.Maps
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 21 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- SimpleGraphstatement · cited by 3,072
- Function.Embeddingstatement and proof · cited by 988
- SimpleGraph.mapstatement · cited by 49
- SimpleGraph.comapstatement · cited by 29
- SimpleGraph.comap_map_eqproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.comap_surjectiveproof · cited by 0
- SimpleGraph.map_injectiveproof · cited by 0