Nuprl Lemma : hdf-prior_wf
∀[A,B:Type]. ∀[X:hdataflow(A;B)]. ∀[b:bag(B)]. hdf-prior(X;b) ∈ hdataflow(A;B) supposing (↓B) ∧ valueall-type(B)
Proof
Definitions occuring in Statement :
hdf-prior: hdf-prior(X;b),
hdataflow: hdataflow(A;B),
valueall-type: valueall-type(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
squash: ↓T,
and: P ∧ Q,
member: t ∈ T,
universe: Type,
bag: bag(T)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
hdf-prior: hdf-prior(X;b),
and: P ∧ Q,
all: ∀x:A. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s],
squash: ↓T,
exists: ∃x:A. B[x],
prop: ℙ
Latex:
\mforall{}[A,B:Type]. \mforall{}[X:hdataflow(A;B)]. \mforall{}[b:bag(B)].
hdf-prior(X;b) \mmember{} hdataflow(A;B) supposing (\mdownarrow{}B) \mwedge{} valueall-type(B)
Date html generated:
2016_05_16-AM-10_41_27
Last ObjectModification:
2016_01_17-AM-11_11_43
Theory : halting!dataflow
Home
Index