Theorems · Definition · combinatorics
Encodable.sortedUniv
(α : Type u_1) → [Fintype α] → [Encodable α] → List α
The elements of a Fintype as a sorted list.
- Defined in
- Mathlib.Logic.Equiv.Finset
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 61 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Fintypestatement and proof · cited by 7,736
- Finset.univproof · cited by 3,473
- Encodablestatement and proof · cited by 140
- Finset.sortproof · cited by 42
- Order.Preimageproof · cited by 42
- Encodable.encode'proof · cited by 5
Cited by7
Results whose statement or proof uses this declaration.
- MeasureTheory.Measure.pi'proof · cited by 3
- MeasureTheory.Measure.pi'_piproof · cited by 3
- Encodable.sortedUniv_nodupstatement · cited by 1
- Encodable.sortedUniv_toFinsetstatement · cited by 1
- Encodable.mem_sortedUnivstatement · cited by 1
- Encodable.length_sortedUnivstatement · cited by 0
- Encodable.fintypeEquivFinproof · cited by 0