Nuprl Lemma : eval_list_nil_lemma
eval_list([]) ~ []
Proof
Definitions occuring in Statement : 
eval_list: eval_list(t)
, 
nil: []
, 
sqequal: s ~ t
Definitions unfolded in proof : 
eval_list: eval_list(t)
, 
all: ∀x:A. B[x]
, 
so_lambda: so_lambda(x,y,z.t[x; y; z])
, 
member: t ∈ T
, 
top: Top
, 
so_apply: x[s1;s2;s3]
Lemmas referenced : 
list_ind_nil_lemma
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
sqequalRule, 
cut, 
lemma_by_obid, 
sqequalHypSubstitution, 
dependent_functionElimination, 
thin, 
isect_memberEquality, 
voidElimination, 
voidEquality, 
hypothesis
Latex:
eval\_list([])  \msim{}  []
Date html generated:
2016_05_14-AM-06_29_07
Last ObjectModification:
2015_12_26-PM-00_40_35
Theory : list_0
Home
Index