Theorems · Definition · combinatorics
Cycle.reverse
{α : Type u_1} → Cycle α → Cycle αReverse a s : Cycle α by reversing the underlying List.
- Defined in
- Mathlib.Data.List.Cycle
- Cited by
- 14 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- Cyclestatement and proof · cited by 79
- Quot.mapproof · cited by 5
- List.IsRotated.reverseproof · cited by 2
Cited by14
Results whose statement or proof uses this declaration.
- Cycle.nodup_reverse_iffstatement · cited by 6
- Cycle.mem_reverse_iffstatement · cited by 5
- Cycle.reverse_reversestatement · cited by 2
- Cycle.next_reverse_eq_prevstatement and proof · cited by 1
- Cycle.prev_memproof · cited by 1
- Cycle.length_reversestatement · cited by 1
- Cycle.prev_reverse_eq_nextstatement · cited by 1
- Cycle.reverse_coestatement · cited by 0
- Cycle.reverse_nilstatement · cited by 0
- Cycle.subsingleton_reverse_iffstatement · cited by 0
- Cycle.formPerm_reversestatement · cited by 0
- Cycle.next_reverse_eq_prev'statement and proof · cited by 0