Theorems · Definition · order theory
Partition.rep
{α : Type u_1} → {u t : Set α} → (P : Partition u) → t ∈ P → αNoncomputably choose a representative from an equivalence class.
- Defined in
- Mathlib.Order.Partition.Basic
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 61 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- Setstatement and proof · cited by 53,352
- Partitionstatement and proof · cited by 91
- Set.Nonempty.someproof · cited by 53
- Partition.nonempty_of_memproof · cited by 3
Cited by7
Results whose statement or proof uses this declaration.
- Partition.rep_memstatement · cited by 3
- Partition.partOf_repstatement · cited by 1
- Partition.rep_mem_suppstatement and proof · cited by 1
- Partition.rep_relstatement · cited by 1
- Partition.IsRepFun.exists_extend_partialproof · cited by 1
- Partition.mem_iff_exists_partOfproof · cited by 0
- Partition.rep.congr_simpstatement and proof · cited by 0