Nuprl Lemma : sqequal-append-cbva-weak2
∀[a:Top List]. ∀[b,F:Top]. (let x ←─ a @ b in F[x] ~ let u ←─ a in let v ←─ b in let x ←─ u @ v in F[x])
Proof
Definitions occuring in Statement :
append: as @ bs,
list: T List,
callbyvalueall: callbyvalueall,
uall: ∀[x:A]. B[x],
top: Top,
so_apply: x[s],
sqequal: s ~ t
Lemmas :
list_ind_nil_lemma,
cbv_sqequal,
has-valueall_wf_base,
top_wf,
evalall-sqequal,
list_ind_cons_lemma,
lifting-strict-callbyvalue,
has-value_wf_base,
base_wf,
base_sq,
evalall-cons
\mforall{}[a:Top List]. \mforall{}[b,F:Top].
(let x \mleftarrow{}{} a @ b
in F[x] \msim{} let u \mleftarrow{}{} a
in let v \mleftarrow{}{} b
in let x \mleftarrow{}{} u @ v
in F[x])
Date html generated:
2015_07_17-AM-08_17_06
Last ObjectModification:
2015_05_01-PM-07_08_48
Home
Index