proposition: Lemma pbcq_to_hoare `{L: laws} {n m} (b: tst n) (c: tst m) p q: p⋅[b] ≦ [c]⋅q -> [!c]⋅p⋅[b] ≦ 0.
proof: Proof. rewrite <-dotA. dual @bpqc_to_hoare. Qed.
imports: boolean ugregex_dec kat_reification kat_untyping kat_completeness