Nuprl Lemma : hdf-until_wf
∀[A,B,C:Type]. ∀[X:hdataflow(A;B)]. ∀[Y:hdataflow(A;C)]. (hdf-until(X;Y) ∈ hdataflow(A;B))
Proof
Definitions occuring in Statement :
hdf-until: hdf-until(X;Y),
hdataflow: hdataflow(A;B),
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
hdf-until: hdf-until(X;Y),
so_lambda: λ2x.t[x],
pi1: fst(t),
so_apply: x[s],
so_lambda: λ2x y.t[x; y],
all: ∀x:A. B[x],
implies: P ⇒ Q,
so_apply: x[s1;s2]
Latex:
\mforall{}[A,B,C:Type]. \mforall{}[X:hdataflow(A;B)]. \mforall{}[Y:hdataflow(A;C)]. (hdf-until(X;Y) \mmember{} hdataflow(A;B))
Date html generated:
2016_05_16-AM-10_41_02
Last ObjectModification:
2015_12_28-PM-07_43_22
Theory : halting!dataflow
Home
Index