Theorems · Theorem · order theory
List.cons_le_cons
∀ {α : Type u} [inst : LinearOrder α] (a : α) {l l' : List α}, l' ≤ l → a :: l' ≤ a :: l- Defined in
- Mathlib.Data.List.Lex
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 20 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- LinearOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- LinearOrderstatement and proof · cited by 8,572
- le_iff_lt_or_eqproof · cited by 26
Cited by1
Results whose statement or proof uses this declaration.
- Profinite.NobelingProof.GoodProducts.finsuppSum_mem_span_evalproof · cited by 1