Theorems · Definition · order theory
RelSeries.drop
{α : Type u_1} → {r : SetRel α α} → (p : RelSeries r) → Fin (p.length + 1) → RelSeries rGiven the series a₀ -r→ … -r→ aᵢ -r→ … -r→ aₙ, the series aᵢ₊₁ -r→ … -r→ aₙ.
- Defined in
- Mathlib.Order.RelSeries
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 54 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.
- SetRelstatement and proof · cited by 581
- RelSeries.lengthstatement and proof · cited by 195
- RelSeriesstatement and proof · cited by 129
- RelSeries.toFunproof · cited by 114
Cited by6
Results whose statement or proof uses this declaration.
- Order.exists_series_of_le_heightproof · cited by 4
- RelSeries.drop_lengthstatement and proof · cited by 3
- RelSeries.last_dropstatement and proof · cited by 3
- Order.height_eq_index_of_length_eq_height_lastproof · cited by 2
- Order.height_le_of_krullDim_preimage_leproof · cited by 2
- RelSeries.head_dropstatement · cited by 2