Nuprl Lemma : append-strict-1
∀[a,b:Base].  (a)↓ supposing (a @ b)↓
Proof
Definitions occuring in Statement : 
append: as @ bs
, 
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
, 
append: as @ bs
, 
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{}[a,b:Base].    (a)\mdownarrow{}  supposing  (a  @  b)\mdownarrow{}
Date html generated:
2016_05_15-PM-02_07_45
Last ObjectModification:
2016_01_15-PM-10_23_59
Theory : untyped!computation
Home
Index