Nuprl Lemma : hdf-sequence_wf
∀[A,B,C:Type]. ∀[X:hdataflow(A;B)]. ∀[Y:hdataflow(A;C)]. ∀[Z:hdataflow(A;B)].
hdf-sequence(X;Y;Z) ∈ hdataflow(A;B) supposing valueall-type(B)
Proof
Definitions occuring in Statement :
hdf-sequence: hdf-sequence(X;Y;Z),
hdataflow: hdataflow(A;B),
valueall-type: valueall-type(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
hdf-sequence: hdf-sequence(X;Y;Z),
member: t ∈ T,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
uimplies: b supposing a,
so_lambda: λ2x.t[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:hdataflow(A;C)]. \mforall{}[Z:hdataflow(A;B)].
hdf-sequence(X;Y;Z) \mmember{} hdataflow(A;B) supposing valueall-type(B)
Date html generated:
2016_05_16-AM-10_42_33
Last ObjectModification:
2015_12_28-PM-07_43_03
Theory : halting!dataflow
Home
Index