Theorems · Theorem · combinatorics
Cycle.Chain.imp
∀ {α : Type u_1} {s : Cycle α} {r₁ r₂ : α → α → Prop},
(∀ (a b : α), r₁ a b → r₂ a b) → Cycle.Chain r₁ s → Cycle.Chain r₂ s- Defined in
- Mathlib.Data.List.Cycle
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 65 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.
- Cyclestatement and proof · cited by 79
- Cycle.ofListproof · cited by 38
- Cycle.nilproof · cited by 26
- Cycle.Chainstatement and proof · cited by 15
- Cycle.chain_coe_consproof · cited by 6
- Cycle.induction_onproof · cited by 4
Cited by2
Results whose statement or proof uses this declaration.
- Cycle.Chain.eq_nil_of_well_foundedproof · cited by 0
- Cycle.chain_monoproof · cited by 0