proposition: Lemma add_dom_r A (r: relation A) (s s': A -> Prop) (IN: ⦗s'⦘ ⨾ r ⊆ r ⨾ ⦗s⦘) : ⦗s'⦘ ⨾ r ≡ ⦗s'⦘ ⨾ r ⨾ ⦗s⦘.
proof: Proof. split. all: autounfold with unfolderDb in *; ins; desf; eauto. edestruct IN; eauto. Qed.
imports: Program.Basics Arith micromega.Lia Permutation List Setoid HahnBase HahnList HahnRelationsBasic HahnSets