Theorems · Definition · combinatorics
Cycle.Subsingleton
{α : Type u_1} → Cycle α → PropA s : Cycle α that is at most one element.
- Defined in
- Mathlib.Data.List.Cycle
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 62 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
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.lengthproof · cited by 9
Cited by9
Results whose statement or proof uses this declaration.
- Cycle.length_subsingleton_iffstatement · cited by 2
- Cycle.formPerm_subsingletonstatement and proof · cited by 1
- Cycle.Nodup.nontrivial_iffstatement · cited by 1
- Cycle.Subsingleton.nodupstatement and proof · cited by 1
- Cycle.subsingleton_nilstatement · cited by 0
- Cycle.subsingleton_reverse_iffstatement · cited by 0
- Equiv.Perm.IsCycle.existsUnique_cycle_nontrivial_subtypeproof · cited by 0
- Cycle.formPerm_eq_formPerm_iffstatement and proof · cited by 0
- Cycle.Subsingleton.congrstatement and proof · cited by 0