{ 
[Info:Type]. [eo:EO+(Info)]. [e,e':E].
first(e) ~ ff supposing (e' <loc e) }
{ Proof }
Definitions occuring in Statement :
eo-forward: eo.e,
event-ordering+: EO+(Info),
es-locl: (e <loc e'),
es-first: first(e),
es-E: E,
bfalse: ff,
uimplies: b supposing a,
uall: [x:A]. B[x],
universe: Type,
sqequal: s ~ t
Definitions :
void: Void,
top: Top,
lambda: 
x.A[x],
record-update: r[x := v],
eo-restrict: eo-restrict(eo;P),
es-eq: es-eq(es),
eo-forward: eo.e,
eq_id: a = b,
ifthenelse: if b then t else f fi ,
es-loc: loc(e),
subtype: S 
T,
bfalse: ff,
pair: <a, b>,
fpf: a:A fp-> B[a],
strong-subtype: strong-subtype(A;B),
record-select: r.x,
assert: 
b,
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
apply: f a,
infix_ap: x f y,
es-causl: (e < e'),
set: {x:A| B[x]} ,
dep-isect: Error :dep-isect,
record+: record+,
le: A 
B,
ge: i 
j ,
not: 
A,
less_than: a < b,
product: x:A 
B[x],
and: P 
Q,
uiff: uiff(P;Q),
guard: {T},
implies: P 
Q,
equal: s = t,
sq_type: SQType(T),
bool: 
,
es-first: first(e),
subtype_rel: A r B,
function: x:A 
B[x],
all: x:A. B[x],
prop: 
,
universe: Type,
sqequal: s ~ t,
uall: [x:A]. B[x],
es-E: E,
uimplies: b supposing a,
isect: 
x:A. B[x],
member: t 
T,
es-locl: (e <loc e'),
event-ordering+: EO+(Info),
event_ordering: EO,
Auto: Error :Auto,
CollapseTHEN: Error :CollapseTHEN,
tactic: Error :tactic,
atom: Atom$n,
es-causle: e c e',
existse-before: 
e<e'.P[e],
existse-le: ee'.P[e],
alle-lt: e<e'.P[e],
alle-le: ee'.P[e],
alle-between1: e[e1,e2).P[e],
existse-between1: e[e1,e2).P[e],
alle-between2: e[e1,e2].P[e],
existse-between2: e[e1,e2].P[e],
existse-between3: e(e1,e2].P[e],
es-fset-loc: i locs(s),
exists: x:A. B[x],
es-r-immediate-pred: es-r-immediate-pred(es;R;e';e),
same-thread: same-thread(es;p;e;e'),
decidable: Dec(P),
limited-type: LimitedType,
rev_implies: P 
Q,
es-le: e loc e' ,
union: left + right,
iff: P Q,
or: P 
Q,
eq_lnk: a = b,
es-eq-E: e = e',
es-bless: e <loc e',
bimplies: p 
q,
band: p q,
eqof: eqof(d),
atom: Atom,
es-base-E: es-base-E(es),
bnot: b,
es-ble: e loc e',
true: True,
bor: p q,
false: False,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
record: record(x.T[x]),
token: "$token",
Id: Id,
lt_int: i <z j,
le_int: i z j,
btrue: tt,
unit: Unit,
int: 
,
IdLnk: IdLnk,
so_apply: x[s],
append: as @ bs,
locl: locl(a),
Knd: Knd,
list: type List,
l_member: (x l)
Lemmas :
rev_implies_wf,
es-eq-E_wf,
iff_wf,
assert-es-eq-E-2,
iff_functionality_wrt_iff,
iff_imp_equal_bool,
es-locl_transitivity2,
es-le_weakening_eq,
es-locl_irreflexivity,
eqtt_to_assert,
eqff_to_assert,
es-eq_wf,
es-locl-first,
true_wf,
bor_wf,
false_wf,
assert_wf,
subtype_rel_self,
es-base-E_wf,
es-loc_wf,
eq_id_wf,
bnot_wf,
es-ble_wf,
eo-forward-E,
es-le_wf,
Id_wf,
not_wf,
iff_transitivity,
iff_weakening_uiff,
assert_of_bor,
or_functionality_wrt_iff,
assert-es-ble,
uiff_transitivity,
assert_of_bnot,
not_functionality_wrt_uiff,
assert-eq-id,
decidable__es-le,
atom2_subtype_base,
es-le_weakening,
subtype_base_sq,
bool_subtype_base,
es-locl_wf,
event-ordering+_inc,
event-ordering+_wf,
eo-forward-first,
eo-forward-loc,
member_wf,
eo-forward_wf,
es-E_wf,
subtype_rel_wf,
es-first_wf,
bool_wf,
ifthenelse_wf,
bfalse_wf
\mforall{}[Info:Type]. \mforall{}[eo:EO+(Info)]. \mforall{}[e,e':E]. first(e) \msim{} ff supposing (e' <loc e)
Date html generated:
2011_08_16-AM-11_24_54
Last ObjectModification:
2010_12_10-PM-12_08_15
Home
Index