Nuprl Lemma : sqequal-append-cbva-weak3
∀[a:Top List]. ∀[b,F:Top]. (let u ⟵ a in let v ⟵ b in let x ⟵ u @ v in F[x] ~ let x ⟵ a @ b 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
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_lambda: λ2x.t[x],
top: Top,
so_apply: x[s]
Latex:
\mforall{}[a:Top List]. \mforall{}[b,F:Top].
(let u \mleftarrow{}{} a
in let v \mleftarrow{}{} b
in let x \mleftarrow{}{} u @ v
in F[x] \msim{} let x \mleftarrow{}{} a @ b
in F[x])
Date html generated:
2016_05_16-AM-10_51_14
Last ObjectModification:
2015_12_28-PM-07_38_12
Theory : halting!dataflow
Home
Index