def internal_reverse_go_replicate
bend-mathlib@0.8.1.0 · list.bend:1371
import bend-mathlib@0.8.1.0/list.bend as List
import Base
1371def internal_reverse_go_replicate(-A: Data, n: Nat, -x: A, -acc: List<&2, A>) -> {List.reverse.go(&2, A, List.replicate(A, n, x), acc) == List.append(&2, A, List.replicate(A, n, x), acc) : List<&2, A>}:
1372 match n:
1373 case 0n:
1374 {==}
1375 case 1n+p:
1376 +p = p
1377 Equal.trans(List<&2, A>, List.reverse.go(&2, A, List.replicate(A, p, x), x <> acc), List.append(&2, A, List.replicate(A, p, x), x <> acc), x <> List.append(&2, A, List.replicate(A, p, x), acc), internal_reverse_go_replicate(A, p, x, x <> acc), internal_replicate_append_cons(A, p, x, acc))