proposition: Lemma valid_get_op_default : ∀ L I E p o x, ValidPackage L I E p → o \in E → ValidCode L I (get_op_default p o x).
proof: Proof. intros L I E p o x hp ho. unfold get_op_default. destruct lookup_op eqn:e. - eapply lookup_op_spec in e as h. eapply from_valid_package in hp. specialize (hp _ ho). destruct o as [id [S T]]. destruct hp as [f [ef hf]]. cbn in h. rewrite ef in h. noconf h. auto. - constructor. 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 pkg_semantics) Equations.Prop.DepElim Equations(Equations) Crypt(FreeProbProg)