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