Nuprl Lemma : bounded-lattice-structure-subtype
BoundedLatticeStructure ⊆r LatticeStructure
Proof
Definitions occuring in Statement :
bounded-lattice-structure: BoundedLatticeStructure,
lattice-structure: LatticeStructure,
subtype_rel: A ⊆r B
Definitions unfolded in proof :
subtype_rel: A ⊆r B,
member: t ∈ T,
bounded-lattice-structure: BoundedLatticeStructure,
lattice-structure: LatticeStructure,
record+: record+,
record-select: r.x,
eq_atom: x =a y,
ifthenelse: if b then t else f fi ,
btrue: tt,
uall: ∀[x:A]. B[x],
lattice-point: Point(l)
Lemmas referenced :
subtype_rel_self,
lattice-point_wf,
bounded-lattice-structure_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaEquality,
sqequalHypSubstitution,
dependentIntersectionElimination,
sqequalRule,
dependentIntersectionEqElimination,
thin,
cut,
hypothesis,
applyEquality,
tokenEquality,
lemma_by_obid,
isectElimination,
equalityTransitivity,
equalitySymmetry
Latex:
BoundedLatticeStructure \msubseteq{}r LatticeStructure
Date html generated:
2016_05_18-AM-11_20_06
Last ObjectModification:
2015_12_28-PM-02_03_27
Theory : lattices
Home
Index