Theorems · Theorem · combinatorics
SimpleGraph.Walk.cons.congr_simp
∀ {V : Type u} {G : SimpleGraph V} {u v w : V} (h : G.Adj u v) (p p_1 : G.Walk v w),
p = p_1 → SimpleGraph.Walk.cons h p = SimpleGraph.Walk.cons h p_1- Cited by
- 15 results in Mathlib
- Foundations
- Depth 3 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
- SimpleGraph.Walkstatement and proof · cited by 915
Cited by15
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.take_specproof · cited by 18
- SimpleGraph.Walk.append_nilproof · cited by 10
- SimpleGraph.Walk.cons_tail_eqproof · cited by 5
- SimpleGraph.Walk.append_assocproof · cited by 3
- SimpleGraph.Walk.map_appendproof · cited by 2
- SimpleGraph.Walk.concat_dropLastproof · cited by 2
- SimpleGraph.Walk.transfer_eq_map_ofLEproof · cited by 1
- SimpleGraph.Walk.transfer_selfproof · cited by 1
- SimpleGraph.Walk.transfer_transferproof · cited by 1
- SimpleGraph.Walk.transfer_appendproof · cited by 1
- SimpleGraph.Walk.take_of_length_leproof · cited by 0
- SimpleGraph.Walk.dropLast_concatproof · cited by 0