{ 
[A:Type]. [dfp:DataflowProgram(A)]. [s:fst(snd(dfp))].
(df-program-in-state(dfp;s) 
DataflowProgram(A)) }
{ Proof }
Definitions occuring in Statement :
df-program-in-state: df-program-in-state(dfp;s),
dataflow-program: DataflowProgram(A),
uall: [x:A]. B[x],
pi1: fst(t),
pi2: snd(t),
member: t T,
universe: Type
Definitions :
pair: <a, b>,
void: Void,
lambda: 
x.A[x],
subtype: S 
T,
top: Top,
fpf: a:A fp-> B[a],
spread: spread def,
strong-subtype: strong-subtype(A;B),
le: A 
B,
ge: i 
j ,
not: 
A,
less_than: a < b,
uimplies: b supposing a,
and: P 
Q,
uiff: uiff(P;Q),
subtype_rel: A r B,
all: x:A. B[x],
axiom: Ax,
df-program-in-state: df-program-in-state(dfp;s),
dataflow-program: DataflowProgram(A),
equal: s = t,
union: left + right,
unit: Unit,
valueall-type: valueall-type(T),
uall: [x:A]. B[x],
isect: 
x:A. B[x],
member: t T,
pi1: fst(t),
pi2: snd(t),
so_lambda: 
x.t[x],
function: x:A 
B[x],
product: x:A 
B[x],
bag: bag(T),
set: {x:A| B[x]} ,
universe: Type,
Auto: Error :Auto,
RepUR: Error :RepUR,
CollapseTHEN: Error :CollapseTHEN,
D: Error :D,
RepeatFor: Error :RepeatFor,
Unfold: Error :Unfold,
tactic: Error :tactic
Lemmas :
unit_wf,
bag_wf,
member_wf,
top_wf,
valueall-type_wf,
pi1_wf,
pi2_wf,
pi1_wf_top
\mforall{}[A:Type]. \mforall{}[dfp:DataflowProgram(A)]. \mforall{}[s:fst(snd(dfp))].
(df-program-in-state(dfp;s) \mmember{} DataflowProgram(A))
Date html generated:
2011_08_16-AM-09_35_38
Last ObjectModification:
2011_06_02-PM-03_29_07
Home
Index