Proposition cha_max_le_max_r {H : complete_heyting_algebra} (x : H) {y₁ y₂ : H} (p : y₁ ≤ y₂) : (x ∨ y₁) ≤ (x ∨ y₂). Proof. use cha_max_le_case. - apply cha_max_le_l. - refine (cha_le_trans p _). apply cha_max_le_r. Qed.
Require Import UniMath.MoreFoundations.All. Require Import UniMath.Algebra.BinaryOperations. Require Import UniMath.OrderTheory.Lattice.Lattice. Require Import UniMath.OrderTheory.Lattice.Bounded. Require Import UniMath.OrderTheory.Lattice.Heyting. Require Import UniMath.OrderTheory.Lattice.CompleteHeyting.