import public Language.Implicits.IfUnsolveddata Emptiness : TypeAlternative (GenAlternatives False em)Antisymmetric Emptiness NoWeakerApplicative (Gen em)Applicative (GenAlternatives ne em)Cast (LazyLst ne a) (GenAlternatives ne em a)Connex Emptiness NoWeakerEq EmptinessFunctor (Gen em)Functor (GenAlternatives ne em)LinearOrder Emptiness NoWeakerMonad (Gen em)Monad (GenAlternatives True em)Not (a `NoWeaker` b) -> b `NoWeaker` aNonEmpty `NoWeaker` emem `NoWeaker` emOrd EmptinessPartialOrder Emptiness NoWeakerPreorder Emptiness NoWeakerReflexive Emptiness NoWeakerStronglyConnex Emptiness NoWeakerTransitive Emptiness NoWeakerdata NoWeaker : Emptiness -> Emptiness -> TypeAntisymmetric Emptiness NoWeakerConnex Emptiness NoWeakerLinearOrder Emptiness NoWeakerNot (a `NoWeaker` b) -> b `NoWeaker` aNonEmpty `NoWeaker` emem `NoWeaker` emPartialOrder Emptiness NoWeakerPreorder Emptiness NoWeakerReflexive Emptiness NoWeakerStronglyConnex Emptiness NoWeakerTransitive Emptiness NoWeakerUninhabited (MaybeEmpty `NoWeaker` NonEmpty)transitive' : x `NoWeaker` y -> y `NoWeaker` z -> x `NoWeaker` zrev : Not (a `NoWeaker` b) -> b `NoWeaker` anonEmptyIsStrongest : NonEmpty `NoWeaker` emmaybeEmptyIsMinimal : (0 _ : MaybeEmpty `NoWeaker` em) -> em = MaybeEmptynonEmptyIsMaximal : (0 _ : em `NoWeaker` NonEmpty) -> em = NonEmptyminMaybeEmptyLeft : (0 em : Emptiness) -> min MaybeEmpty em = MaybeEmptyminMaybeEmptyRight : (0 em : Emptiness) -> min em MaybeEmpty = MaybeEmptyminNonEmptyLeft : (0 em : Emptiness) -> min NonEmpty em = emminNonEmptyRight : (0 em : Emptiness) -> min em NonEmpty = emminSame : (0 em : Emptiness) -> min em em = emminNoWeaker : a1 `NoWeaker` a2 -> b1 `NoWeaker` b2 -> min a1 b1 `NoWeaker` min a2 b2minNoWeakerLeft : a `NoWeaker` b -> min a c `NoWeaker` min b cminNoWeakerRight : a `NoWeaker` b -> min c a `NoWeaker` min c bleftNoWeakerMin : a `NoWeaker` min a brightNoWeakerMin : b `NoWeaker` min a bnoWeakerReflexive : em `NoWeaker` em