Nuprl Lemma : strict4-apply
strict4(λx,y,z,w. (x y))
Proof
Definitions occuring in Statement : 
strict4: strict4(F)
, 
apply: f a
, 
lambda: λx.A[x]
Definitions unfolded in proof : 
strict4: strict4(F)
, 
and: P ∧ Q
, 
all: ∀x:A. B[x]
, 
implies: P 
⇒ Q
, 
has-value: (a)↓
, 
member: t ∈ T
, 
uall: ∀[x:A]. B[x]
, 
prop: ℙ
, 
or: P ∨ Q
, 
squash: ↓T
Lemmas referenced : 
has-value_wf_base, 
istype-base, 
is-exception_wf
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
independent_pairFormation, 
Error :lambdaFormation_alt, 
sqequalRule, 
cut, 
callbyvalueApply, 
sqequalHypSubstitution, 
hypothesis, 
Error :universeIsType, 
introduction, 
extract_by_obid, 
isectElimination, 
thin, 
baseApply, 
closedConclusion, 
baseClosed, 
hypothesisEquality, 
applyExceptionCases, 
Error :inrFormation_alt, 
imageMemberEquality, 
imageElimination, 
Error :inlFormation_alt
Latex:
strict4(\mlambda{}x,y,z,w.  (x  y))
Date html generated:
2019_06_20-AM-11_21_41
Last ObjectModification:
2018_10_18-PM-03_54_40
Theory : call!by!value_1
Home
Index