Nuprl Lemma : free-DeMorgan-lattice_wf
∀[T:Type]. ∀[eq:EqDecider(T)]. (free-DeMorgan-lattice(T;eq) ∈ BoundedDistributiveLattice)
Proof
Definitions occuring in Statement :
free-DeMorgan-lattice: free-DeMorgan-lattice(T;eq),
bdd-distributive-lattice: BoundedDistributiveLattice,
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
free-DeMorgan-lattice: free-DeMorgan-lattice(T;eq)
Lemmas referenced :
free-dist-lattice_wf,
union-deq_wf,
deq_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
unionEquality,
hypothesisEquality,
hypothesis,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isect_memberEquality,
because_Cache,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[eq:EqDecider(T)]. (free-DeMorgan-lattice(T;eq) \mmember{} BoundedDistributiveLattice)
Date html generated:
2016_05_18-AM-11_43_34
Last ObjectModification:
2015_12_28-PM-01_56_45
Theory : lattices
Home
Index