proposition: Lemma iscommringops_weq_bck {X Y : UU} (H : X ≃ Y) (op1 op2 : binop Y) : iscommringops op1 op2 → iscommringops (binop_weq_bck H op1) (binop_weq_bck H op2).
proof: Proof. intro is. split. - apply isringops_weq_bck, (pr1 is). - apply iscomm_weq_bck, (pr2 is). Defined.
imports: UniMath.Foundations.Sets UniMath.MoreFoundations.Propositions