Nuprl Lemma : rec-dataflow-state_wf
∀[S,A,B:Type]. ∀[s0:S]. ∀[next:S ⟶ A ⟶ (S × B)]. ∀[L:A List]. (rec-dataflow-state(s0;s,m.next[s;m];L) ∈ S)
Proof
Definitions occuring in Statement :
rec-dataflow-state: rec-dataflow-state(s0;s,m.next[s; m];L),
list: T List,
uall: ∀[x:A]. B[x],
so_apply: x[s1;s2],
member: t ∈ T,
function: x:A ⟶ B[x],
product: x:A × B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
rec-dataflow-state: rec-dataflow-state(s0;s,m.next[s; m];L),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
all: ∀x:A. B[x],
top: Top
Latex:
\mforall{}[S,A,B:Type]. \mforall{}[s0:S]. \mforall{}[next:S {}\mrightarrow{} A {}\mrightarrow{} (S \mtimes{} B)]. \mforall{}[L:A List].
(rec-dataflow-state(s0;s,m.next[s;m];L) \mmember{} S)
Date html generated:
2016_05_17-AM-10_20_04
Last ObjectModification:
2015_12_29-PM-05_30_05
Theory : process-model
Home
Index