proposition: Lemma is_finite_graph_pair : is_finite_graph pair_graph.
proof: Proof. split. - exact(isfinitestn 2). - use two_rec_dep; use two_rec_dep; try exact isfiniteempty. apply isfinitecoprod; apply isfiniteunit. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Limits.Graphs.Colimits UniMath.Combinatorics.StandardFiniteSets UniMath.Combinatorics.FiniteSets