{ 
[locs:Id List]. [hdr:Name]. [T:Type].
(base-program(locs;hdr;T) 
eclass-program{i:l}(Name 
T:Type T)) }
{ Proof }
Definitions occuring in Statement :
base-program: base-program(locs;hdr;T),
eclass-program: eclass-program{i:l}(Info),
Id: Id,
name: Name,
uall: [x:A]. B[x],
member: t T,
product: x:A B[x],
list: type List,
universe: Type
Definitions :
sqequal: s ~ t,
tag-by: zT,
rev_implies: P 
Q,
iff: P 
Q,
record+: record+,
record: record(x.T[x]),
fset: FSet{T},
dataflow: dataflow(A;B),
isect2: T1 
T2,
true: True,
fpf-cap: f(x)?z,
filter: filter(P;l),
permutation: permutation(T;L1;L2),
atom: Atom$n,
atom: Atom,
rec: rec(x.A[x]),
quotient: x,y:A//B[x; y],
tunion: 
x:A.B[x],
b-union: A B,
es-E-interface: E(X),
in-eclass: e 
X,
eq_knd: a = b,
fpf-dom: x dom(f),
false: False,
limited-type: LimitedType,
bfalse: ff,
btrue: tt,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
eq_bool: p =b q,
lt_int: i <z j,
le_int: i 
z j,
eq_int: (i =
j),
eq_atom: x =a y,
null: null(as),
set_blt: a < b,
grp_blt: a < b,
infix_ap: x f y,
dcdr-to-bool: [d],
bl-all: (xL.P[x])_b,
bl-exists: (
xL.P[x])_b,
b-exists: (i<n.P[i])_b,
eq_type: eq_type(T;T'),
eq_atom: eq_atom$n(x;y),
qeq: qeq(r;s),
q_less: q_less(r;s),
q_le: q_le(r;s),
deq-member: deq-member(eq;x;L),
deq-disjoint: deq-disjoint(eq;as;bs),
deq-all-disjoint: deq-all-disjoint(eq;ass;bs),
eq_id: a = b,
eq_lnk: a = b,
es-eq-E: e = e',
es-bless: e <loc e',
es-ble: e loc e',
bimplies: p q,
bor: p 
q,
bnot: 
b,
sq_type: SQType(T),
valueall-type: valueall-type(T),
bool: 
,
spread: spread def,
natural_number: $n,
int: 
,
apply: f a,
so_apply: x[s],
implies: P Q,
or: P Q,
guard: {T},
assert: 
b,
void: Void,
top: Top,
pi1: fst(t),
subtype: S 
T,
union: left + right,
bag: bag(T),
exists: x:A. B[x],
prop: 
,
spreadn: spread3,
ifthenelse: if b then t else f fi ,
empty-bag: {},
single-bag: {x},
band: p 
q,
eq_term: a == b,
name_eq: name_eq(x;y),
inl: inl x ,
it: 
,
unit: Unit,
l_member: (x l),
df-program-type: df-program-type(dfp),
lambda: 
x.A[x],
mk_fpf: mk_fpf(L;f),
dataflow-program: DataflowProgram(A),
set: {x:A| B[x]} ,
so_lambda: 
x.t[x],
pair: <a, b>,
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,
and: P Q,
uiff: uiff(P;Q),
subtype_rel: A r B,
function: x:A 
B[x],
all: x:A. B[x],
Id: Id,
eclass-program: eclass-program{i:l}(Info),
product: x:A B[x],
base-program: base-program(locs;hdr;T),
universe: Type,
name: Name,
list: type List,
equal: s = t,
axiom: Ax,
member: t T,
isect: x:A. B[x],
uall: [x:A]. B[x],
Auto: Error :Auto,
CollapseTHEN: Error :CollapseTHEN,
MaAuto: Error :MaAuto,
RepUR: Error :RepUR,
Unfold: Error :Unfold
Lemmas :
it_wf,
unit_wf,
dataflow-program_wf,
name_wf,
member_wf,
df-program-type_wf,
Id_wf,
fpf_wf,
l_member_wf,
mk_fpf_wf,
eclass-program_wf,
bag_wf,
pi1_wf_top,
ifthenelse_wf,
band_wf,
name_eq_wf,
eq_term_wf,
valueall-type_wf,
bool_wf,
eqtt_to_assert,
assert_wf,
not_wf,
uiff_transitivity,
eqff_to_assert,
assert_of_bnot,
bnot_wf,
btrue_wf,
subtype_rel_wf,
type-valueall-type,
single-bag_wf,
subtype_base_sq,
permutation_wf,
assert-eq_term,
empty-bag_wf
\mforall{}[locs:Id List]. \mforall{}[hdr:Name]. \mforall{}[T:Type].
(base-program(locs;hdr;T) \mmember{} eclass-program\{i:l\}(Name \mtimes{} T:Type \mtimes{} T))
Date html generated:
2011_08_16-PM-06_28_56
Last ObjectModification:
2011_05_04-AM-11_54_03
Home
Index