Step * 1 1 1 2 2 of Lemma free-dl-basis


1. Type
2. eq EqDecider(T)
3. Point(free-dist-lattice(T; eq))
4. ∀s:fset(T). ({s} ∈ Point(free-dist-lattice(T; eq)))
5. x ∈ fset(fset(T))
6. deq-fset(deq-fset(eq)) ∈ EqDecider(Point(free-dist-lattice(T; eq)))
7. ∀[x@0:Point(free-dist-lattice(T; eq))]. x@0 ≤ \/(λs.{s}"(x)) supposing x@0 ∈ λs.{s}"(x)
8. ∀[u:Point(free-dist-lattice(T; eq))]
     ((∀x@0:Point(free-dist-lattice(T; eq)). (x@0 ∈ λs.{s}"(x)  x@0 ≤ u))  \/(λs.{s}"(x)) ≤ u)
9. \/(λs.{s}"(x)) ≤ x
10. x ≤ \/(λs.{s}"(x))
⊢ \/(λs.{s}"(x)) ∈ 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.  x  :  Point(free-dist-lattice(T;  eq))
4.  \mforall{}s:fset(T).  (\{s\}  \mmember{}  Point(free-dist-lattice(T;  eq)))
5.  x  \mmember{}  fset(fset(T))
6.  deq-fset(deq-fset(eq))  \mmember{}  EqDecider(Point(free-dist-lattice(T;  eq)))
7.  \mforall{}[x@0:Point(free-dist-lattice(T;  eq))].  x@0  \mleq{}  \mbackslash{}/(\mlambda{}s.\{s\}"(x))  supposing  x@0  \mmember{}  \mlambda{}s.\{s\}"(x)
8.  \mforall{}[u:Point(free-dist-lattice(T;  eq))]
          ((\mforall{}x@0:Point(free-dist-lattice(T;  eq)).  (x@0  \mmember{}  \mlambda{}s.\{s\}"(x)  {}\mRightarrow{}  x@0  \mleq{}  u))  {}\mRightarrow{}  \mbackslash{}/(\mlambda{}s.\{s\}"(x))  \mleq{}  u)
9.  \mbackslash{}/(\mlambda{}s.\{s\}"(x))  \mleq{}  x
10.  x  \mleq{}  \mbackslash{}/(\mlambda{}s.\{s\}"(x))
\mvdash{}  x  =  \mbackslash{}/(\mlambda{}s.\{s\}"(x))


By


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




Home Index