Theorems · Theorem · order theory
strictAnti_nat_of_succ_lt
∀ {α : Type u} [inst : Preorder α] {f : ℕ → α}, (∀ (n : ℕ), f (n + 1) < f n) → StrictAnti f- Defined in
- Mathlib.Order.Monotone.Basic
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 24 from the axioms · uses no axioms
- Assumes
- Preorder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Preorderstatement and proof · cited by 7,952
- StrictAntistatement · cited by 204
- strictMono_nat_of_lt_succproof · cited by 21
Cited by5
Results whose statement or proof uses this declaration.
- pow_right_strictAnti₀proof · cited by 5
- Real.strictAnti_eulerMascheroniSeq'proof · cited by 2
- Ideal.pow_right_strictAntiproof · cited by 2
- SSet.Subcomplex.Pairing.WeakRankFunction.wf_ancestralRelproof · cited by 1
- SSet.Subcomplex.Pairing.RankFunction.wf_ancestralRelproof · cited by 1