Theorems · Theorem · order theory
le_add_of_le_right
∀ {α : Type u} [inst : Add α] [inst_1 : Preorder α] [CanonicallyOrderedAdd α] {a b c : α}, a ≤ c → a ≤ b + c- Cited by
- 3 results in Mathlib
- Foundations
- Depth 6 from the axioms · uses no axioms
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.
- Preorderstatement and proof · cited by 7,952
- CanonicallyOrderedAddstatement and proof · cited by 229
- LE.le.trans'proof · cited by 140
- le_add_selfproof · cited by 51
Cited by3
Results whose statement or proof uses this declaration.
- le_add_leftproof · cited by 17
- Set.Finite.ecard_lt_ecardproof · cited by 2
- FormalMultilinearSeries.changeOrigin_eval_of_finiteproof · cited by 1