@[reducible, inline]
Represents a binary relation with two arguments of the same type α.
Equations
- Iris.Std.Relation α = (α → α → Prop)
Instances For
Require that a relation R on a is reflexive.
- refl {x : α} : R x x
Instances
Require that a relation R on α is transitive.
- trans {x y z : α} : R x y → R y z → R x z
Instances
class
Iris.Std.Preorder
{α : Type u_1}
(R : Relation α)
extends Iris.Std.Reflexive R, Iris.Std.Transitive R :
Require that a relation R on α is a preorder, i.e. that it is reflexive and transitive.
Instances
Require that a binary function f on α is idempotent in a relation R on α.
- idem {x : α} : R (f x x) x
Instances
Require that an element i of α is the left unit of a binary function f on α in a
relation R on α.
- left_id {x : α} : R (f i x) x
Instances
Require that an element i of α is the right unit of a binary function f on α in a
relation R on α.
- right_id {x : α} : R (f x i) x
Instances
Require that a binary function f on α is associative in a relation R on α.
- assoc {x y z : α} : R (f (f x y) z) (f x (f y z))