Nuprl Lemma : data_stream_nil_lemma
∀P:Top. (data-stream(P;[]) ~ [])
Proof
Definitions occuring in Statement :
data-stream: data-stream(P;L),
nil: [],
top: Top,
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
data-stream: data-stream(P;L),
firstn: firstn(n;as),
so_lambda: so_lambda(x,y,z.t[x; y; z]),
top: Top,
so_apply: x[s1;s2;s3],
select: L[n],
uall: ∀[x:A]. B[x],
uimplies: b supposing a,
nil: [],
it: ⋅,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
upto: upto(n),
from-upto: [n, m),
ifthenelse: if b then t else f fi ,
lt_int: i <z j,
bfalse: ff
Latex:
\mforall{}P:Top. (data-stream(P;[]) \msim{} [])
Date html generated:
2016_05_17-AM-10_21_00
Last ObjectModification:
2016_01_18-AM-00_20_29
Theory : process-model
Home
Index