Theorems · Definition · order theory
SetRel.IsRefl
{α : Type u_1} → SetRel α α → PropA relation R is reflexive if a ~[R] a.
- Defined in
- Mathlib.Data.Rel
- Cited by
- 26 results in Mathlib
- Foundations
- Depth 4 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SetRelstatement and proof · cited by 581
Cited by26
Results whose statement or proof uses this declaration.
- SetRel.rflstatement and proof · cited by 7
- SetRel.left_subset_compstatement and proof · cited by 6
- isRefl_of_mem_uniformitystatement · cited by 6
- comp3_mem_uniformityproof · cited by 4
- SetRel.id_subsetstatement and proof · cited by 3
- eventually_uniformity_iterate_comp_subsetproof · cited by 2
- Dynamics.coverEntropyInf_eq_iSup_netEntropyInfEntourageproof · cited by 2
- Dynamics.coverEntropy_eq_iSup_netEntropyEntourageproof · cited by 2
- lift'_comp_uniformityproof · cited by 2
- Dynamics.coverMincard_le_netMaxcardstatement and proof · cited by 2
- Dynamics.coverEntropyInfEntourage_le_netEntropyInfEntouragestatement and proof · cited by 1
- TotallyBounded.nhds_vietoris_le_nhds_hausdorffproof · cited by 1