Step * of Lemma free-dma-hom-is-lattice-hom

No Annotations
∀[T:Type]. ∀[eq:EqDecider(T)]. ∀[dm:BoundedDistributiveLattice].
  (Hom(free-DeMorgan-lattice(T;eq);dm) = Hom(free-DeMorgan-algebra(T;eq);dm) ∈ Type)
BY
{ (Auto THEN EqCD THEN Auto) }

1
.....subterm..... T:t
1:n
1. T : Type
2. eq : EqDecider(T)
3. dm : BoundedDistributiveLattice
⊢ free-DeMorgan-lattice(T;eq) = free-DeMorgan-algebra(T;eq) ∈ BoundedLatticeStructure


Latex:


Latex:
No  Annotations
\mforall{}[T:Type].  \mforall{}[eq:EqDecider(T)].  \mforall{}[dm:BoundedDistributiveLattice].
    (Hom(free-DeMorgan-lattice(T;eq);dm)  =  Hom(free-DeMorgan-algebra(T;eq);dm))


By


Latex:
(Auto  THEN  EqCD  THEN  Auto)




Home Index