Nuprl Lemma : rec_dataflow_ap_lemma
∀a,next,s0:Top. (rec-dataflow(s0;s,a.next[s;a])(a) ~ let s',b = next[s0;a] in <rec-dataflow(s';s,a.next[s;a]), b>)
Proof
Definitions occuring in Statement :
dataflow-ap: df(a),
rec-dataflow: rec-dataflow(s0;s,m.next[s; m]),
top: Top,
so_apply: x[s1;s2],
all: ∀x:A. B[x],
spread: spread def,
pair: <a, b>,
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
rec-dataflow: rec-dataflow(s0;s,m.next[s; m]),
dataflow-ap: df(a)
Latex:
\mforall{}a,next,s0:Top.
(rec-dataflow(s0;s,a.next[s;a])(a) \msim{} let s',b = next[s0;a]
in <rec-dataflow(s';s,a.next[s;a]), b>)
Date html generated:
2016_05_17-AM-10_20_13
Last ObjectModification:
2015_12_29-PM-05_29_56
Theory : process-model
Home
Index