Nuprl Lemma : subtype_top
∀[T:Type]. (T ⊆r Top)
Proof
Definitions occuring in Statement :
subtype_rel: A ⊆r B,
uall: ∀[x:A]. B[x],
top: Top,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
subtype_rel: A ⊆r B,
top: Top
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
lambdaEquality,
isect_memberEquality,
voidElimination,
voidEquality,
hypothesisEquality,
sqequalRule,
axiomEquality,
hypothesis,
universeEquality
Latex:
\mforall{}[T:Type]. (T \msubseteq{}r Top)
Date html generated:
2016_05_13-PM-03_19_35
Last ObjectModification:
2015_12_26-AM-09_07_39
Theory : subtype_0
Home
Index