Proposition is_deterministic_inverse {x y : C} (f : z_iso x y) (df : is_deterministic f) : is_deterministic (inv_from_z_iso f). Proof. unfold is_deterministic in *. use z_iso_inv_on_right. rewrite assoc. rewrite df. rewrite assoc'. rewrite <- tensor_comp_mor. rewrite z_iso_inv_after_z_iso. rewrite tensor_id_id. rewrite id_right. reflexivity. Qed.
Require Import UniMath.Foundations.All. Require Import UniMath.MoreFoundations.All. Require Import UniMath.CategoryTheory.Core.Prelude. Require Import UniMath.CategoryTheory.Limits.Terminal. Require Import UniMath.CategoryTheory.Monoidal.Categories. Require Import UniMath.CategoryTheory.Monoidal.Structure.Cartesian. Require Import UniMath.CategoryTheory.Monoidal.Structure.Symmetric. Require Import UniMath.CategoryTheory.Monoidal.Structure.SymmetricDiagonal. Require Import UniMath.CategoryTheory.MarkovCategories.MarkovCategory. Require Import UniMath.CategoryTheory.Monoidal.WhiskeredBifunctors. Import MonoidalNotations. Import BifunctorNotations.