proposition: Lemma set_map_compose (f : A -> B) (g : B -> C) (d : C -> Prop) : (g ∘ f) ↓₁ d ≡₁ f ↓₁ (g ↓₁ d) .
proof: Proof. autounfold with unfolderDb. ins; splits; ins; splits; desf; eauto. Qed.
imports: HahnBase Program.Basics List Arith micromega.Lia Relations Setoid Morphisms