proposition: Lemma repr_if : ∀ {A b} (c₀ c₁ : raw_code A), repr (if b then c₀ else c₁) = if b then repr c₀ else repr c₁.
proof: Proof. intros A b c₀ c₁. destruct b. all: reflexivity. Qed.
imports: Coq(Utf8) Relational(OrderEnrichedCategory OrderEnrichedRelativeMonadExamples) mathcomp(ssrnat ssreflect ssrfun ssrbool ssrnum eqtype choice reals distr seq all_algebra fintype realsum) extructures(ord fset fmap) Mon(SPropBase) Crypt(Prelude Axioms ChoiceAsOrd SubDistr Couplings RulesStateProb UniformStateProb UniformDistrLemmas StateTransfThetaDens StateTransformingLaxMorph choice_type pkg_core_definition pkg_notation pkg_tactics pkg_composition pkg_heap) Equations.Prop.DepElim Equations(Equations) Crypt(FreeProbProg)