Theorems · Theorem · order theory
le_rfl
∀ {α : Type u_1} [inst : Preorder α] {a : α}, a ≤ aA version of le_refl where the argument is implicit
- Defined in
- Mathlib.Order.Defs.PartialOrder
- Cited by
- 1,558 results in Mathlib
- Foundations
- Depth 4 from the axioms, rests on 4 definitions · uses no axioms
- Assumes
- Preorder
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.
Cited by1,566
Results whose statement or proof uses this declaration.
- lt_irreflproof · cited by 190
- tsub_selfproof · cited by 154
- Finset.le_supproof · cited by 112
- eq_of_forall_ge_iffproof · cited by 96
- max_eq_leftproof · cited by 96
- abs_zeroproof · cited by 88
- subset_rflproof · cited by 77
- min_eq_leftproof · cited by 67
- eq_of_forall_le_iffproof · cited by 65
- Disjoint.mono_rightproof · cited by 64
- iSup_posproof · cited by 61
- MeasureTheory.IntegrableOn.mono_setproof · cited by 60
Showing the 200 most cited of 1,566.