law insert_count.go

bend-lawful-stdlib@0.1.0.0 · src/sorted.bend:177

import Base
import bend-lawful-stdlib@0.1.0.0/src/class.bend as C

177law insert_count.go:
178  for ~A: Data
179  for ~eq: A -> A -> Bool
180  for -o: C.Ord<A>
181  for +y: A
182  for +x: A
183  for +h: A
184  for +t: List<&2, A>
185  for -rec: Unit -> List<&2, A>
186  for ih: {bump(eq(y, x), count(~A, ~eq, y, t)) == count(~A, ~eq, y, rec(Unit{})) : Nat}
187  for c: Or(C.Ord.R(A, o, x, h), C.Ord.R(A, o, h, x))
188  {bump(eq(y, x), count(~A, ~eq, y, h <> t)) == count(~A, ~eq, y, insert.go(A, o, x, h, t, rec, c)) : Nat}