def fin_refl

bend-collections-laws-math@1.0.0.0 · proofs/lib/u32.bend:283

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

283def fin_refl(+c: Cmp, +b: Bool, +h: {Cmp.is_eq(c) == True{} : Bool}) -> {Cmp.is_eq(Word.cmp.fin(b, b, c)) == True{} : Bool}:
284  match c b:
285    case LT{} _:
286      Empty.absurd({Cmp.is_eq(Word.cmp.fin(b, b, LT{})) == True{} : Bool}, L.false_true(h))
287    case EQ{} True{}:
288      {==}
289    case EQ{} False{}:
290      {==}
291    case GT{} _:
292      Empty.absurd({Cmp.is_eq(Word.cmp.fin(b, b, GT{})) == True{} : Bool}, L.false_true(h))