law nil_append_sym

bend-mathlib@0.8.1.0 · list.bend:2138

import Base

2138# The empty list is a left identity for append: [] ++ xs = xs, reversed to rewrite toward the simple side.
2139law nil_append_sym:
2140  for -a: Quant
2141  for -A: Kind(a)
2142  for -xs: List<a, A>
2143  {xs == List.append(a, A, Nil{}, xs) : List<a, A>}