proposition: Lemma inverse_swap_relation_iff {X Y : hSet} {r : bin_hrel X Y} (i : is_z_isomorphism (C := REL) r) : ∏ (x : X) (y : Y), r x y <-> pr1 i y x.
proof: Proof. intros x y. split. - exact (inverse_swap_relation i x y). - exact (inverse_swap_relation (pr2 (z_iso_inv ((r,,i) : z_iso (C := REL) _ _))) y x). Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.Categories.HSET.All