proposition: Lemma catch_ka_weq {X l} {L: monoid.laws l X} {Hl: BKA ≪ l} n m (x y: X n m): (let L:=@bka_to_kat.laws l X L Hl in @weq (@kar (bka_to_kat.ops X) n m) x y) -> x ≡ y.
proof: Proof. trivial. Qed.
imports: boolean ugregex_dec kat_reification kat_untyping kat_completeness