fact: Definition putStP : S -> stT_Frp unit_choiceType := fun new_s old_s => retrFree_filled (F_choice_prod ⟨ unit_choiceType, S ⟩) (tt, new_s).
imports: Coq(Relation_Definitions) Relational(OrderEnrichedCategory OrderEnrichedRelativeMonadExamples) Mon(SPropBase) mathcomp(all_ssreflect ) Crypt(Axioms OrderEnrichedRelativeAdjunctions LaxFunctorsAndTransf LaxMorphismOfRelAdjunctions TransformingLaxMorph OrderEnrichedRelativeAdjunctionsExamples ThetaDex SubDistr Theta_exCP ChoiceAsOrd FreeProbProg UniversalFreeMap RelativeMonadMorph_prod LaxComp choice_type)