Nuprl Lemma : data-stream_wf
∀[A,B:Type]. ∀[L:A List]. ∀[P:dataflow(A;B)]. (data-stream(P;L) ∈ B List)
Proof
Definitions occuring in Statement :
data-stream: data-stream(P;L),
dataflow: dataflow(A;B),
list: T List,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
nat: ℕ,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
not: ¬A,
top: Top,
and: P ∧ Q,
prop: ℙ,
subtype_rel: A ⊆r B,
or: P ∨ Q,
data-stream: data-stream(P;L),
map: map(f;as),
list_ind: list_ind,
upto: upto(n),
from-upto: [n, m),
ifthenelse: if b then t else f fi ,
lt_int: i <z j,
length: ||as||,
nil: [],
it: ⋅,
bfalse: ff,
cons: [a / b],
colength: colength(L),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
guard: {T},
decidable: Dec(P),
so_lambda: λ2x.t[x],
so_apply: x[s],
sq_type: SQType(T),
less_than: a < b,
squash: ↓T,
less_than': less_than'(a;b),
int_seg: {i..j-},
lelt: i ≤ j < k,
le: A ≤ B
Latex:
\mforall{}[A,B:Type]. \mforall{}[L:A List]. \mforall{}[P:dataflow(A;B)]. (data-stream(P;L) \mmember{} B List)
Date html generated:
2016_05_17-AM-10_20_56
Last ObjectModification:
2016_01_18-AM-00_20_38
Theory : process-model
Home
Index