Heyting implication of lower sets #
[UPSTREAM] Lower sets of a preorder form a completely distributive lattice, hence a Heyting
algebra. This file characterizes membership in the Heyting implication: a lies in P ⇨ Q when
every element below a that lies in P lies in Q.
Main results #
LowerSet.mem_himp: membership inP ⇨ Q.
theorem
LowerSet.mem_himp
{α : Type u_1}
[Preorder α]
{P Q : LowerSet α}
{a : α}
:
a ∈ P ⇨ Q ↔ ∀ b ≤ a, b ∈ P → b ∈ Q