snocNonEmpty : Not (xs ++ [x] = [])
A list constructued using snoc cannot be empty.
Totality: total
Visibility: exportSnocNonEmpty : (xs : List a) -> (x : a) -> NonEmpty (snoc xs x)
Proof that snoc'ed list is not empty in terms of `NonEmpty`.
Totality: total
Visibility: exportconsCong2 : x = y -> xs = ys -> x :: xs = y :: ys
Two lists are equal, if their heads are equal and their tails are equal.
Totality: total
Visibility: exportsnocInjective : snoc xs x = snoc ys y -> (xs = ys, x = y)
Equal non-empty lists should result in equal components after destructuring 'snoc'.
Totality: total
Visibility: exportappendCong2 : x1 = y1 -> x2 = y2 -> x1 ++ x2 = y1 ++ y2
Appending pairwise equal lists gives equal lists
Totality: total
Visibility: exportmapDistributesOverAppend : (f : (a -> b)) -> (xs : List a) -> (ys : List a) -> map f (xs ++ ys) = map f xs ++ map f ys
List.map is distributive over appending.
Totality: total
Visibility: exportlengthDistributesOverAppend : (xs : List a) -> (ys : List a) -> length (xs ++ ys) = length xs + length ys
List.length is distributive over appending.
Totality: total
Visibility: exportlengthSnoc : (x : a) -> (xs : List a) -> length (snoc xs x) = S (length xs)
Length of a snoc'd list is the same as Succ of length list.
Totality: total
Visibility: exportappendSameLeftInjective : (xs : List a) -> (ys : List a) -> (zs : List a) -> zs ++ xs = zs ++ ys -> xs = ys
Appending the same list at left is injective.
Totality: total
Visibility: exportappendSameRightInjective : (xs : List a) -> (ys : List a) -> (zs : List a) -> xs ++ zs = ys ++ zs -> xs = ys
Appending the same list at right is injective.
Totality: total
Visibility: exportappendNonEmptyLeftNotEq : (zs : List a) -> (xs : List a) -> NonEmpty xs => Not (zs = xs ++ zs)
List cannot be equal to itself prepended with some non-empty list.
Totality: total
Visibility: exportappendNonEmptyRightNotEq : (zs : List a) -> (xs : List a) -> NonEmpty xs => Not (zs = zs ++ xs)
List cannot be equal to itself appended with some non-empty list.
Totality: total
Visibility: exportbindConcatPrf : (xs : List a) -> (x : a) -> (f : (a -> List b)) -> (x :: xs) >>= f = f x ++ (xs >>= f)
Proof of correspondence between list bind and concatenation.
Totality: total
Visibility: export