---

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

.....truecase..... 
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. x : {ac:fset(fset(T))| ↑fset-antichain(eq;ac)} @i
9. x1 : T
10. x1 ∈ s
11. x = {{x1}} ∈ {ac:fset(fset(T))| ↑fset-antichain(eq;ac)} 
12. {x1} ⊆ s
⊢ ¬↑fset-null({{x1}})
BY
{ (RepUR ``fset-null fset-singleton`` 0 THEN Auto) }

---

Latex:

---

Latex:
.....truecase..... 
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.  x  :  \{ac:fset(fset(T))|  \muparrow{}fset-antichain(eq;ac)\}  @i
9.  x1  :  T
10.  x1  \mmember{}  s
11.  x  =  \{\{x1\}\}
12.  \{x1\}  \msubseteq{}  s
\mvdash{}  \mneg{}\muparrow{}fset-null(\{\{x1\}\})


By

---

Latex:
(RepUR  ``fset-null  fset-singleton``  0  THEN  Auto)

---

Home Index