law take_succ_sym

bend-mathlib@0.8.1.0 · list.bend:3153

import Base

3153# Taking n + 1 elements of a cons keeps its head and takes n from its tail, reversed to rewrite toward the simple side.
3154law take_succ_sym:
3155  for -a: Quant
3156  for -A: Kind(a)
3157  for -x: A
3158  for -xs: List<a, A>
3159  for -n: Nat
3160  {x <> List.take(a, A, xs, n) == List.take(a, A, x <> xs, 1n+n) : List<a, A>}