law append_nil_sym

bend-mathlib@0.8.1.0 · list.bend:2128

import Base

2128# The empty list is a right identity for append: xs ++ [] = xs, reversed to rewrite toward the simple side.
2129law append_nil_sym:
2130  for -a: Quant
2131  for -A: Kind(a)
2132  for xs: List<a, A>
2133  {xs == List.append(a, A, xs, Nil{}) : List<a, A>}