proposition: Lemma order_preserving_join_sl_mor: IsJoinPreserving f.
proof: Proof. intros x y. case (total (≤) x y); intros E. - change (f (join x y) = join (f x) (f y)). rewrite (join_r _ _ E),join_r;trivial. apply (order_preserving _). trivial. - change (f (join x y) = join (f x) (f y)). rewrite 2!join_l; trivial. apply (order_preserving _). trivial. Qed.
imports: HoTT.Classes.interfaces.abstract_algebra HoTT.Classes.interfaces.orders HoTT.Classes.orders.semirings HoTT.Classes.theory.lattices