Nuprl Lemma : strict4-callbyvalueall
∀[C:Base]. strict4(λx,y,z,w. let x ⟵ x in C[x])
Proof
Definitions occuring in Statement :
strict4: strict4(F),
callbyvalueall: callbyvalueall,
uall: ∀[x:A]. B[x],
so_apply: x[s],
lambda: λx.A[x],
base: Base
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
strict4: strict4(F),
and: P ∧ Q,
all: ∀x:A. B[x],
implies: P ⇒ Q,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
prop: ℙ,
callbyvalueall: callbyvalueall,
evalall: evalall(t),
guard: {T},
or: P ∨ Q,
has-value: (a)↓,
squash: ↓T
Lemmas referenced :
is-exception-evalall,
is-exception_wf,
base_wf,
has-value_wf_base,
has-valueall-has-value,
has-valueall-if-has-value-callbyvalueall
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
independent_pairFormation,
lambdaFormation,
sqequalRule,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
baseApply,
closedConclusion,
baseClosed,
independent_isectElimination,
hypothesis,
callbyvalueExceptionCases,
inrFormation,
callbyvalueCallbyvalue,
callbyvalueReduce,
imageMemberEquality,
imageElimination,
independent_functionElimination,
productElimination,
independent_pairEquality,
lambdaEquality,
dependent_functionElimination,
axiomSqleEquality,
sqequalAxiom
Latex:
\mforall{}[C:Base]. strict4(\mlambda{}x,y,z,w. let x \mleftarrow{}{} x in C[x])
Date html generated:
2016_05_13-PM-03_41_55
Last ObjectModification:
2016_01_14-PM-07_08_56
Theory : computation
Home
Index