Nuprl Lemma : evalall-cons
∀a,b:Top. (evalall([a / b]) ~ eval u = evalall(a) in eval v = evalall(b) in [u / v])
Proof
Definitions occuring in Statement :
cons: [a / b],
evalall: evalall(t),
callbyvalue: callbyvalue,
top: Top,
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
evalall: evalall(t),
cons: [a / b],
member: t ∈ T
Lemmas referenced :
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
sqequalRule,
hypothesis,
lemma_by_obid
Latex:
\mforall{}a,b:Top. (evalall([a / b]) \msim{} eval u = evalall(a) in eval v = evalall(b) in [u / v])
Date html generated:
2016_05_14-AM-06_26_09
Last ObjectModification:
2015_12_26-PM-00_42_02
Theory : list_0
Home
Index