Nuprl Lemma : cbv-intro-test
∀[T:Type]. ∀x:T. T supposing value-type(T)
Proof
Definitions occuring in Statement : 
value-type: value-type(T)
, 
uimplies: b supposing a
, 
uall: ∀[x:A]. B[x]
, 
all: ∀x:A. B[x]
, 
universe: Type
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
uimplies: b supposing a
, 
all: ∀x:A. B[x]
, 
member: t ∈ T
, 
so_lambda: λ2x.t[x]
, 
so_apply: x[s]
, 
sq_stable: SqStable(P)
, 
implies: P 
⇒ Q
, 
squash: ↓T
Lemmas referenced : 
set-value-type, 
equal_wf, 
value-type_wf, 
sq_stable__value-type
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
Error :isect_memberFormation_alt, 
Error :lambdaFormation_alt, 
cut, 
hypothesisEquality, 
cutEval, 
introduction, 
Error :dependent_set_memberEquality_alt, 
Error :equalityIsType1, 
Error :inhabitedIsType, 
extract_by_obid, 
sqequalHypSubstitution, 
isectElimination, 
thin, 
sqequalRule, 
Error :lambdaEquality_alt, 
hypothesis, 
independent_isectElimination, 
setElimination, 
rename, 
Error :universeIsType, 
universeEquality, 
independent_functionElimination, 
imageMemberEquality, 
baseClosed, 
imageElimination
Latex:
\mforall{}[T:Type].  \mforall{}x:T.  T  supposing  value-type(T)
Date html generated:
2019_06_20-PM-00_26_56
Last ObjectModification:
2018_09_29-PM-09_27_23
Theory : fun_1
Home
Index