Nuprl Lemma : typed_wf
∀[T:Type]. ∀[x:T]. (x:T ∈ T)
Proof
Definitions occuring in Statement :
typed: x:T,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
typed: x:T
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
hypothesisEquality,
sqequalHypSubstitution,
hypothesis,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isect_memberEquality,
isectElimination,
thin,
because_Cache,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[x:T]. (x:T \mmember{} T)
Date html generated:
2016_05_15-PM-03_24_32
Last ObjectModification:
2015_12_27-PM-01_05_55
Theory : general
Home
Index