Files
agdaproofs/Orders/WellFounded/Definition.agda
2020-04-18 17:47:27 +01:00

13 lines
420 B
Agda

{-# OPTIONS --safe --warning=error --without-K #-}
open import Agda.Primitive using (Level; lzero; lsuc; _⊔_)
open import Functions.Definition
module Orders.WellFounded.Definition {a b : _} {A : Set a} (_<_ : Rel {a} {b} A) where
data Accessible (x : A) : Set (lsuc a b) where
access : ( y y < x Accessible y) Accessible x
WellFounded : Set (lsuc a b)
WellFounded = x Accessible x