Nuprl Lemma : strict4-concat-map

strict4(λx,y,z,w. concat(map(λb.y[b];x)))


Proof




Definitions occuring in Statement :  concat: concat(ll) map: map(f;as) strict4: strict4(F) so_apply: x[s] lambda: λx.A[x]
Definitions unfolded in proof :  strict4: strict4(F) and: P ∧ Q all: x:A. B[x] implies:  Q concat: concat(ll) reduce: reduce(f;k;as) list_ind: list_ind has-value: (a)↓ map: map(f;as) member: t ∈ T uall: [x:A]. B[x] so_apply: x[s] prop: guard: {T} or: P ∨ Q squash: T is-exception: is-exception(t) not: ¬A false: False
Lemmas referenced :  exception-not-bottom bottom_diverge 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 sqleRule divergentSqle independent_functionElimination voidElimination because_Cache inlFormation

Latex:
strict4(\mlambda{}x,y,z,w.  concat(map(\mlambda{}b.y[b];x)))



Date html generated: 2016_05_14-AM-07_38_43
Last ObjectModification: 2016_01_15-AM-08_43_40

Theory : list_1


Home Index