Theorems · Definition · combinatorics
List.Nodup.getEquivOfForallMemList
{α : Type u_1} → [DecidableEq α] → (l : List α) → l.Nodup → (∀ (x : α), x ∈ l) → Fin l.length ≃ αIf l lists all the elements of α without duplicates, then List.get defines
an equivalence between Fin l.length and α.
See List.Nodup.getBijectionOfForallMemList for a version without decidable equality.
- Defined in
- Mathlib.Data.List.NodupEquivFin
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 56 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Equivstatement · cited by 8,337
Cited by5
Results whose statement or proof uses this declaration.
- List.getEquivOfForallCountEqOneproof · cited by 2
- Fintype.truncEquivFinproof · cited by 1
- List.Nodup.getEquivOfForallMemList_applystatement and proof · cited by 0
- List.Nodup.getEquivOfForallMemList_symm_apply_valstatement and proof · cited by 0
- Encodable.fintypeEquivFinproof · cited by 0