Mathlib Map

Theorems · Definition · combinatorics

List.getEquivOfForallCountEqOne

{α : Type u_1} → [inst : DecidableEq α] → (l : List α) → (∀ (x : α), List.count x l = 1) → Fin l.length ≃ α

Alternative phrasing of List.Nodup.getEquivOfForallMemList using List.count.

Defined in
Mathlib.Data.List.NodupEquivFin
Cited by
2 results in Mathlib
Foundations
Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
DecidableEq
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

SimpleGraph.Walk.IsHamiltonian.supportGetEquiv · cited by 3IsHamiltonian.supportGetE…List.getEquivOfForallCountEqOne_apply · cited by 0List.getEquivOfForallCoun…List.getEquivOfForallCountEqOne_symm_apply_val · cited by 0List.getEquivOfForallCoun…Equiv · cited by 8337EquivList.Nodup.getEquivOfForallMemList · cited by 2Nodup.getEquivOfForallMem…List.getEquivOfForallCountEqO…CITED BYCITES

Cites2

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by3

Results whose statement or proof uses this declaration.