{ 
[locs:Id List]. [M:
']. [T:Type]. [f:{x:Id| (x 
locs)} 
M bag(T)].
(general-base-program(locs;f;T) eclass-program{i:l}(M)) }
{ Proof }
Definitions occuring in Statement :
general-base-program: general-base-program(locs;f;T),
eclass-program: eclass-program{i:l}(Info),
Id: Id,
uall: [x:A]. B[x],
member: t T,
set: {x:A| B[x]} ,
function: x:A B[x],
list: type List,
universe: Type,
l_member: (x l),
bag: bag(T)
Definitions :
void: Void,
top: Top,
apply: f a,
pi1: fst(t),
exists: 
x:A. B[x],
subtype: S 
T,
union: left + right,
inl: inl x ,
it: 
,
unit: Unit,
df-program-type: df-program-type(dfp),
lambda: 
x.A[x],
mk_fpf: mk_fpf(L;f),
dataflow-program: DataflowProgram(A),
so_lambda: 
x.t[x],
pair: <a, b>,
prop: 
,
eclass: EClass(A[eo; e]),
fpf: a:A fp-> B[a],
strong-subtype: strong-subtype(A;B),
le: A 
B,
ge: i 
j ,
not: 
A,
less_than: a < b,
uimplies: b supposing a,
product: x:A 
B[x],
and: P 
Q,
uiff: uiff(P;Q),
subtype_rel: A r B,
all: x:A. B[x],
list: type List,
universe: Type,
uall: [x:A]. B[x],
bag: bag(T),
set: {x:A| B[x]} ,
l_member: (x l),
Id: Id,
function: x:A B[x],
isect: 
x:A. B[x],
member: t T,
axiom: Ax,
equal: s = t,
eclass-program: eclass-program{i:l}(Info),
general-base-program: general-base-program(locs;f;T),
MaAuto: Error :MaAuto,
RepUR: Error :RepUR,
CollapseTHEN: Error :CollapseTHEN,
Auto: Error :Auto,
Unfold: Error :Unfold
Lemmas :
member_wf,
dataflow-program_wf,
unit_wf,
bag_wf,
it_wf,
df-program-type_wf,
Id_wf,
fpf_wf,
l_member_wf,
mk_fpf_wf,
eclass-program_wf,
subtype_rel_wf,
pi1_wf,
pi1_wf_top
\mforall{}[locs:Id List]. \mforall{}[M:\mBbbU{}']. \mforall{}[T:Type]. \mforall{}[f:\{x:Id| (x \mmember{} locs)\} {}\mrightarrow{} M {}\mrightarrow{} bag(T)].
(general-base-program(locs;f;T) \mmember{} eclass-program\{i:l\}(M))
Date html generated:
2011_08_16-PM-06_28_29
Last ObjectModification:
2011_03_22-AM-11_43_10
Home
Index