Theorems · Theorem · order theory
RelSeries.cons_length
∀ {α : Type u_1} {r : SetRel α α} (p : RelSeries r) (newHead : α) (rel : (newHead, p.head) ∈ r),
(p.cons newHead rel).length = p.length + 1- Defined in
- Mathlib.Order.RelSeries
- Cited by
- 7 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.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- zero_addproof · cited by 2,366
- SetRelstatement and proof · cited by 581
- RelSeries.lengthstatement and proof · cited by 195
- RelSeriesstatement and proof · cited by 129
- RelSeries.headstatement and proof · cited by 89
- RelSeries.consstatement · cited by 18
Cited by7
Results whose statement or proof uses this declaration.
- Order.coheight_eq_of_strictMonoproof · cited by 3
- ringKrullDim_quotient_succ_le_of_nonZeroDivisorproof · cited by 3
- Ideal.exists_ltSeries_of_hasGoingDownproof · cited by 1
- Module.supportDim_quotSMulTop_succ_le_of_notMem_minimalPrimesproof · cited by 1
- Order.height_coe_withBotproof · cited by 1
- LTSeries.exists_relSeries_covBy_and_head_eq_bot_and_last_eq_botproof · cited by 1
- Ideal.exists_ltSeries_of_hasGoingUpproof · cited by 0