Nuprl Lemma : has-value-if-has-value-map
∀[t,f:Base]. (t)↓ supposing (map(f;t))↓
Proof
Definitions occuring in Statement :
map: map(f;as),
has-value: (a)↓,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
base: Base
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
map: map(f;as),
list_ind: list_ind,
has-value: (a)↓,
prop: ℙ
Lemmas referenced :
base_wf,
has-value_wf_base
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalHypSubstitution,
sqequalRule,
callbyvalueCallbyvalue,
hypothesis,
callbyvalueReduce,
axiomSqleEquality,
lemma_by_obid,
isectElimination,
thin,
baseApply,
closedConclusion,
baseClosed,
hypothesisEquality,
isect_memberEquality,
because_Cache,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}[t,f:Base]. (t)\mdownarrow{} supposing (map(f;t))\mdownarrow{}
Date html generated:
2016_05_15-PM-10_08_11
Last ObjectModification:
2016_01_16-PM-04_08_08
Theory : eval!all
Home
Index