Nuprl Lemma : hdf-bind-gen_wf
∀[A,B,C:Type]. ∀[X:hdataflow(A;B)]. ∀[Y:B ⟶ hdataflow(A;C)]. ∀[hdfs:bag(hdataflow(A;C))].
X (hdfs) >>= Y ∈ hdataflow(A;C) supposing valueall-type(C)
Proof
Definitions occuring in Statement :
hdf-bind-gen: X (hdfs) >>= Y,
hdataflow: hdataflow(A;B),
valueall-type: valueall-type(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type,
bag: bag(T)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
hdf-bind-gen: X (hdfs) >>= Y,
so_lambda: λ2x.t[x],
all: ∀x:A. B[x],
so_apply: x[s],
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2]
Latex:
\mforall{}[A,B,C:Type]. \mforall{}[X:hdataflow(A;B)]. \mforall{}[Y:B {}\mrightarrow{} hdataflow(A;C)]. \mforall{}[hdfs:bag(hdataflow(A;C))].
X (hdfs) >>= Y \mmember{} hdataflow(A;C) supposing valueall-type(C)
Date html generated:
2016_05_16-AM-10_42_56
Last ObjectModification:
2015_12_28-PM-07_42_55
Theory : halting!dataflow
Home
Index