Nuprl Lemma : callbyvalueall-single-bag-combine4
∀[F,a:Top]. (let x ⟵ [a] in F[x] ~ let x ⟵ a in F[[x]])
Proof
Definitions occuring in Statement :
cons: [a / b],
nil: [],
callbyvalueall: callbyvalueall,
uall: ∀[x:A]. B[x],
top: Top,
so_apply: x[s],
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
nil: [],
it: ⋅,
cons: [a / b],
so_apply: x[s],
so_lambda: λ2x.t[x],
callbyvalueall: callbyvalueall,
evalall: evalall(t)
Lemmas referenced :
lifting-callbyvalueall-pair,
istype-top
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation_alt,
introduction,
cut,
sqequalRule,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
Error :memTop,
hypothesis,
axiomSqEquality,
inhabitedIsType,
isect_memberEquality_alt,
isectIsTypeImplies
Latex:
\mforall{}[F,a:Top]. (let x \mleftarrow{}{} [a] in F[x] \msim{} let x \mleftarrow{}{} a in F[[x]])
Date html generated:
2020_05_20-AM-08_03_52
Last ObjectModification:
2020_01_17-AM-09_08_43
Theory : bags
Home
Index