Nuprl Lemma : stateless_dataflow_ap_lemma
∀a,f:Top. (stateless-dataflow(a.f[a])(a) ~ <stateless-dataflow(a.f[a]), f[a]>)
Proof
Definitions occuring in Statement :
dataflow-ap: df(a),
stateless-dataflow: stateless-dataflow(m.f[m]),
top: Top,
so_apply: x[s],
all: ∀x:A. B[x],
pair: <a, b>,
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
stateless-dataflow: stateless-dataflow(m.f[m]),
dataflow-ap: df(a)
Latex:
\mforall{}a,f:Top. (stateless-dataflow(a.f[a])(a) \msim{} <stateless-dataflow(a.f[a]), f[a]>)
Date html generated:
2016_05_17-AM-10_20_17
Last ObjectModification:
2015_12_29-PM-05_29_52
Theory : process-model
Home
Index