proposition: Lemma ra_normalise d b `{L: laws} f' (f: positive -> Pack X f') n m (x y: expr _ _ n m) (Hl: e_level x + e_level y ≪ l): (let x' := norm d x in let y' := norm d y in packed_eval f x' <=[b]= packed_eval f y') -> packed_eval f x <=[b]= packed_eval f y.
proof: Proof. unfold packed_eval. intro H. eapply leq_or_weq_weq; [symmetry.. | eassumption]; (eapply norm_weq; [ | eassumption]); solve_lower'. Qed.
imports: kleene syntax powerfix