Theorems · Theorem · order theory
RelSeries.toList_getElem
∀ {α : Type u_1} {r : SetRel α α} (p : RelSeries r) {i : ℕ} (hi : i < p.toList.length), p.toList[i] = p.toFun ⟨i, ⋯⟩- Defined in
- Mathlib.Order.RelSeries
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 30 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SetRelstatement and proof · cited by 581
- RelSeries.lengthstatement · cited by 195
- RelSeriesstatement and proof · cited by 129
- RelSeries.toFunstatement and proof · cited by 114
- RelSeries.toListstatement and proof · cited by 25
Cited by5
Results whose statement or proof uses this declaration.
- RelSeries.toList_tailproof · cited by 2
- CompositionSeries.toList_sortedproof · cited by 2
- RelSeries.toList_appendproof · cited by 2
- RelSeries.toList_eraseLastproof · cited by 1
- RelSeries.toList_getElem_zero_eq_headproof · cited by 1