---

Step * 2 2 of Lemma lattice-fset-meet-free-dl-inc


1. T : Type
2. eq : EqDecider(T)
3. s : fset(T)
4. deq-fset(deq-fset(eq)) ∈ EqDecider(Point(free-dist-lattice(T; eq)))
5. {s} ∈ Point(free-dist-lattice(T; eq))
6. ∀[s:fset(Point(free-dist-lattice(T; eq)))]. ∀[x:Point(free-dist-lattice(T; eq))].  /\(s) ≤ x supposing x ∈ s
7. ∀[s:fset(Point(free-dist-lattice(T; eq)))]. ∀[v:Point(free-dist-lattice(T; eq))].
     ((∀x:Point(free-dist-lattice(T; eq)). (x ∈ s ⇒ v ≤ x)) ⇒ v ≤ /\(s))
8. {s} ≤ /\(λx.free-dl-inc(x)"(s))
9. /\(λx.free-dl-inc(x)"(s)) ≤ {s}
⊢ /\(λx.free-dl-inc(x)"(s)) = {s} ∈ Point(free-dist-lattice(T; eq))
BY
{ (InstLemma `lattice-le-order` [⌜free-dist-lattice(T; eq)⌝]⋅ THEN Auto) }

---

Latex:

---

Latex:

1.  T  :  Type
2.  eq  :  EqDecider(T)
3.  s  :  fset(T)
4.  deq-fset(deq-fset(eq))  \mmember{}  EqDecider(Point(free-dist-lattice(T;  eq)))
5.  \{s\}  \mmember{}  Point(free-dist-lattice(T;  eq))
6.  \mforall{}[s:fset(Point(free-dist-lattice(T;  eq)))].  \mforall{}[x:Point(free-dist-lattice(T;  eq))].
          /\mbackslash{}(s)  \mleq{}  x  supposing  x  \mmember{}  s
7.  \mforall{}[s:fset(Point(free-dist-lattice(T;  eq)))].  \mforall{}[v:Point(free-dist-lattice(T;  eq))].
          ((\mforall{}x:Point(free-dist-lattice(T;  eq)).  (x  \mmember{}  s  {}\mRightarrow{}  v  \mleq{}  x))  {}\mRightarrow{}  v  \mleq{}  /\mbackslash{}(s))
8.  \{s\}  \mleq{}  /\mbackslash{}(\mlambda{}x.free-dl-inc(x)"(s))
9.  /\mbackslash{}(\mlambda{}x.free-dl-inc(x)"(s))  \mleq{}  \{s\}
\mvdash{}  /\mbackslash{}(\mlambda{}x.free-dl-inc(x)"(s))  =  \{s\}


By

---

Latex:
(InstLemma  `lattice-le-order`  [\mkleeneopen{}free-dist-lattice(T;  eq)\mkleeneclose{}]\mcdot{}  THEN  Auto)

---

Home Index