Nuprl Lemma : strict4-concat
strict4(λx,y,z,s. concat(x))
Proof
Definitions occuring in Statement :
concat: concat(ll),
strict4: strict4(F),
lambda: λx.A[x]
Definitions unfolded in proof :
strict4: strict4(F),
and: P ∧ Q,
all: ∀x:A. B[x],
implies: P ⇒ Q,
concat: concat(ll),
reduce: reduce(f;k;as),
list_ind: list_ind,
has-value: (a)↓,
member: t ∈ T,
uall: ∀[x:A]. B[x],
prop: ℙ,
guard: {T},
or: P ∨ Q,
squash: ↓T
Lemmas referenced :
is-exception_wf,
base_wf,
has-value_wf_base
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
independent_pairFormation,
lambdaFormation,
sqequalRule,
sqequalHypSubstitution,
cut,
callbyvalueCallbyvalue,
hypothesis,
callbyvalueReduce,
lemma_by_obid,
isectElimination,
thin,
baseApply,
closedConclusion,
baseClosed,
hypothesisEquality,
introduction,
callbyvalueExceptionCases,
inrFormation,
imageMemberEquality,
imageElimination,
exceptionSqequal,
inlFormation
Latex:
strict4(\mlambda{}x,y,z,s. concat(x))
Date html generated:
2016_05_14-AM-07_38_38
Last ObjectModification:
2016_01_15-AM-08_43_19
Theory : list_1
Home
Index