{ 
[Info:Type]
es:EO+(Info)
[T:Type]
X:EClass(T). e:E.
e':E
((e' <loc e)
(
e' 
X)
(e'':E. ((e' <loc e'') 
(e'' <loc e) (
e'' X)))
((X)'(e) = X(e')))
supposing e (X)' }
{ Proof }
Definitions occuring in Statement :
es-prior-val: (X)',
eclass-val: X(e),
in-eclass: e X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-locl: (e <loc e'),
es-E: E,
assert: b,
uimplies: b supposing a,
uall: [x:A]. B[x],
all: x:A. B[x],
exists: x:A. B[x],
not: A,
implies: P Q,
and: P Q,
universe: Type,
equal: s = t
Definitions :
bag_only_single: bag_only_single{bag_only_single_compseq_tag_def:o}(x),
limited-type: LimitedType,
atom: Atom,
es-base-E: es-base-E(es),
token: "$token",
quotient: x,y:A//B[x; y],
bag: bag(T),
es-causl: (e < e'),
es-locl: (e <loc e'),
es-E-interface: E(X),
bfalse: ff,
btrue: tt,
eq_bool: p =b q,
lt_int: i <z j,
le_int: i 
z j,
eq_int: (i =
j),
null: null(as),
set_blt: a < b,
grp_blt: a < b,
apply: f a,
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'),
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,
band: p q,
bor: p 
q,
bnot: b,
int: 
,
unit: Unit,
union: left + right,
bool: 
,
es-prior-interface: prior(X),
eclass-val: X(e),
iff: P 
Q,
lambda: 
x.A[x],
subtype: S 
T,
fpf: a:A fp-> B[a],
strong-subtype: strong-subtype(A;B),
record-select: r.x,
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
dep-isect: Error :dep-isect,
record+: record+,
le: A B,
ge: i 
j ,
not: A,
less_than: a < b,
and: P Q,
uiff: uiff(P;Q),
subtype_rel: A r B,
top: Top,
es-prior-val: (X)',
in-eclass: e X,
universe: Type,
eclass: EClass(A[eo; e]),
so_lambda: 
x y.t[x; y],
all: x:A. B[x],
event-ordering+: EO+(Info),
event_ordering: EO,
uimplies: b supposing a,
prop: 
,
exists: x:A. B[x],
product: x:A 
B[x],
es-E: E,
set: {x:A| B[x]} ,
assert: b,
ifthenelse: if b then t else f fi ,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
true: True,
false: False,
void: Void,
implies: P Q,
function: x:A 
B[x],
member: t T,
equal: s = t,
isect: 
x:A. B[x],
uall: [x:A]. B[x],
MaAuto: Error :MaAuto,
Auto: Error :Auto,
CollapseTHEN: Error :CollapseTHEN,
SplitOn: Error :SplitOn,
CollapseTHENA: Error :CollapseTHENA,
RepUR: Error :RepUR,
intensional-universe: IType,
es-loc: loc(e),
so_apply: x[s],
or: P Q,
l_member: (x l),
guard: {T},
fpf-cap: f(x)?z,
pair: <a, b>,
Id: Id,
cand: A c B,
rev_implies: P Q
Lemmas :
is-prior-interface,
false_wf,
es-locl_wf,
eclass-val_wf2,
eclass-val_wf,
es-prior-interface-val,
Id_wf,
es-loc_wf,
es-causl_wf,
intensional-universe_wf,
es-interface-val_wf2,
ifthenelse_wf,
true_wf,
eclass_wf,
member_wf,
es-prior-interface_wf1,
in-eclass_wf,
assert_of_bnot,
eqff_to_assert,
uiff_transitivity,
bool_wf,
not_wf,
assert_wf,
eqtt_to_assert,
is-prior-val,
event-ordering+_wf,
event-ordering+_inc,
es-E_wf,
es-interface-top,
subtype_rel_wf,
top_wf,
es-prior-val_wf,
assert_witness,
es-prior-interface_wf,
es-interface-subtype_rel2,
es-E-interface_wf,
es-base-E_wf,
subtype_rel_self,
bnot_wf
\mforall{}[Info:Type]
\mforall{}es:EO+(Info)
\mforall{}[T:Type]
\mforall{}X:EClass(T). \mforall{}e:E.
\mexists{}e':E
((e' <loc e)
\mwedge{} (\muparrow{}e' \mmember{}\msubb{} X)
\mwedge{} (\mforall{}e'':E. ((e' <loc e'') {}\mRightarrow{} (e'' <loc e) {}\mRightarrow{} (\mneg{}\muparrow{}e'' \mmember{}\msubb{} X)))
\mwedge{} ((X)'(e) = X(e')))
supposing \muparrow{}e \mmember{}\msubb{} (X)'
Date html generated:
2011_08_16-PM-05_06_42
Last ObjectModification:
2011_06_20-AM-01_10_47
Home
Index