proposition: Lemma issurjective_reindex_carrier_union {X I J : UU} (index : I → hsubtype X) (g : J → I) (gsurjective : issurjective g) : issurjective (reindex_carrier_union index g).
proof: Proof. intros [x in_union]. use(hinhfun _ in_union). intros [i index_ix]. use make_hfiber. - exists x. use(hinhfun _ (gsurjective i)). intros [j jpath]. exists j. refine(transportb _ (eqtohomot _ x) index_ix). exact(maponpaths index jpath). - now apply subtypePath_prop. Qed.
imports: UniMath.Foundations.Propositions UniMath.MoreFoundations.PartA UniMath.MoreFoundations.Notations UniMath.Combinatorics.FiniteSets UniMath.Combinatorics.StandardFiniteSets UniMath.MoreFoundations.Subtypes UniMath.Combinatorics.KFiniteTypes