Nuprl Lemma : stateless-dataflow_wf
∀[A,B:Type]. ∀[f:A ⟶ B]. (stateless-dataflow(m.f[m]) ∈ dataflow(A;B))
Proof
Definitions occuring in Statement :
stateless-dataflow: stateless-dataflow(m.f[m]),
dataflow: dataflow(A;B),
uall: ∀[x:A]. B[x],
so_apply: x[s],
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
stateless-dataflow: stateless-dataflow(m.f[m]),
so_apply: x[s]
Latex:
\mforall{}[A,B:Type]. \mforall{}[f:A {}\mrightarrow{} B]. (stateless-dataflow(m.f[m]) \mmember{} dataflow(A;B))
Date html generated:
2016_05_17-AM-10_19_42
Last ObjectModification:
2015_12_29-PM-05_30_17
Theory : process-model
Home
Index