Nuprl Lemma : istype_wf
∀[T:Type]. (istype(T) ∈ Type)
Proof
Definitions occuring in Statement :
istype: istype(T),
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
istype: istype(T)
Lemmas referenced :
subtype_rel_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
universeEquality
Latex:
\mforall{}[T:Type]. (istype(T) \mmember{} Type)
Date html generated:
2019_06_20-AM-11_13_54
Last ObjectModification:
2018_09_25-AM-11_37_08
Theory : core_2
Home
Index