Nuprl Lemma : evalall-pair
∀[x,y:Top].  (evalall(<x, y>) ~ eval x' = evalall(x) in eval y' = evalall(y) in   <x', y'>)
Proof
Definitions occuring in Statement : 
evalall: evalall(t)
, 
callbyvalue: callbyvalue, 
uall: ∀[x:A]. B[x]
, 
top: Top
, 
pair: <a, b>
, 
sqequal: s ~ t
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
evalall: evalall(t)
Lemmas referenced : 
top_wf
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
isect_memberFormation, 
introduction, 
cut, 
sqequalRule, 
hypothesis, 
sqequalAxiom, 
lemma_by_obid, 
sqequalHypSubstitution, 
isect_memberEquality, 
isectElimination, 
thin, 
hypothesisEquality, 
because_Cache
Latex:
\mforall{}[x,y:Top].    (evalall(<x,  y>)  \msim{}  eval  x'  =  evalall(x)  in  eval  y'  =  evalall(y)  in      <x',  y'>)
Date html generated:
2016_05_13-PM-03_21_44
Last ObjectModification:
2015_12_26-AM-09_32_02
Theory : call!by!value_1
Home
Index