Proposition cha_min_le_min_r {H : complete_heyting_algebra} (x : H) {y₁ y₂ : H} (p : y₁ ≤ y₂) : (x ∧ y₁) ≤ (x ∧ y₂). Proof. use cha_min_le_case. - apply cha_min_le_l. - refine (cha_le_trans _ p). apply cha_min_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.