Theorems · Definition · logic and foundations
Fintype.toEncodable
(α : Type u_2) → [Fintype α] → Encodable α
A noncomputable way to arbitrarily choose an ordering on a finite type.
It is not made into a global instance, since it involves an arbitrary choice.
This can be locally made into an instance with attribute [local instance] Fintype.toEncodable.
- Defined in
- Mathlib.Logic.Equiv.List
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 59 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Fintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Fintypestatement and proof · cited by 7,736
- Encodablestatement · cited by 140
- Trunc.outproof · cited by 6
- Fintype.truncEncodableproof · cited by 0
Cited by2
Results whose statement or proof uses this declaration.
- MeasureTheory.Measure.pi_piproof · cited by 31
- MeasureTheory.Measure.pi_pi_auxproof · cited by 1