def trep_perfect

bend-collections-laws-crypto@1.0.0.0 · proofs/lib/array.bend:117

import Base
import bend-collections-laws-crypto@1.0.0.0/proofs/lib/logic.bend as L

117def trep_perfect(-T: Data, +d: Nat, +v: T) -> {perfect(T, d, trep(T, d, v)) == True{} : Bool}:
118  match d:
119    case 0n:
120      {==}
121    case 1n+p:
122      L.and_intro(perfect(T, p, trep(T, p, v)), perfect(T, p, trep(T, p, v)), trep_perfect(T, p, v), trep_perfect(T, p, v))