{ 
[Info:Type]. [eo:EO+(Info)]. [e:E]. eo.e = eo supposing 
first(e) }
{ Proof }
Definitions occuring in Statement :
eo-forward: eo.e,
event-ordering+: EO+(Info),
es-first: first(e),
es-E: E,
assert: b,
uimplies: b supposing a,
uall: [x:A]. B[x],
universe: Type,
equal: s = t
Definitions :
es-dom: es-dom(es),
eo-restrict: eo-restrict(eo;P),
subtype: S 
T,
es-first: first(e),
pair: <a, b>,
fpf: a:A fp-> B[a],
strong-subtype: strong-subtype(A;B),
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
decide: case b of inl(x) => s[x] | inr(y) => t[y],
ifthenelse: if b then t else f fi ,
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),
subtype_rel: A r B,
all: x:A. B[x],
uall: [x:A]. B[x],
event_ordering: EO,
uimplies: b supposing a,
prop: 
,
isect: 
x:A. B[x],
axiom: Ax,
eo-forward: eo.e,
assert: b,
es-E: E,
event-ordering+: EO+(Info),
member: t 
T,
universe: Type,
Auto: Error :Auto,
Complete: Error :Complete,
Try: Error :Try,
CollapseTHEN: Error :CollapseTHEN,
token: "$token",
record-select: r.x,
es-loc: loc(e),
eq_id: a = b,
bnot: 
b,
es-ble: e loc e',
bor: p 
q,
apply: f a,
band: p q,
lambda: 
x.A[x],
bool: 
,
es-base-E: es-base-E(es),
function: x:A 
B[x],
equal: s = t,
AssertBY: Error :AssertBY,
RepUR: Error :RepUR,
tactic: Error :tactic,
atom: Atom,
tag-by: zT,
rev_implies: P 
Q,
or: P Q,
iff: P 
Q,
fset: FSet{T},
isect2: T1 T2,
b-union: A 
B,
bag: bag(T),
list: type List,
top: Top,
true: True,
fpf-cap: f(x)?z,
record: record(x.T[x]),
false: False,
limited-type: LimitedType,
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,
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_str: Error :eq_str,
eq_lnk: a = b,
es-eq-E: e = e',
es-bless: e <loc e',
bimplies: p q,
implies: P Q,
union: left + right,
unit: Unit,
int: 
,
MaAuto: Error :MaAuto,
CollapseTHENA: Error :CollapseTHENA,
Id: Id,
void: Void,
es-locl: (e <loc e'),
es-le: e loc e' ,
es-causl: (e < e'),
D: Error :D,
RepeatFor: Error :RepeatFor,
THENM: Error :THENM,
es-ble: Error :es-ble,
l_member: (x l),
guard: {T},
so_apply: x[s],
atom: Atom$n,
record-update: r[x := v],
sqequal: s ~ t,
sq_type: SQType(T),
atom_eq: if a=b then c else d,
ORELSE: Error :ORELSE,
THENL_v2: Error :THENL,
THENL_cons: Error :THENL_cons,
MaAuto: Error :MaAuto,
THENL_cons: Error :THENL_nil,
exists: x:A. B[x],
nat: 
,
so_lambda: 
x.t[x],
intensional-universe: IType,
grp_car: |g|,
real: 
,
Unfold: Error :Unfold,
Knd: Knd,
locl: locl(a),
append: as @ bs,
IdLnk: IdLnk,
eo-reset-dom: eo-reset-dom(es;d)
Lemmas :
eo-reset-dom_wf_extended,
intensional-universe_wf,
nat_wf,
record+_wf,
record_wf,
top_wf,
l_member_wf,
event_ordering_wf,
subtype_rel-equal,
eq_atom_wf,
atom_subtype_base,
assert_of_eq_atom,
subtype_base_sq,
Error :es-ble_wf,
es-le-total,
btrue_neq_bfalse,
es-locl-first,
assert_elim,
es-le_weakening,
es-le_weakening_eq,
assert-eq-id,
not_functionality_wrt_uiff,
Id_wf,
es-le_wf,
assert-es-ble,
not_functionality_wrt_iff,
iff_weakening_uiff,
iff_transitivity,
ifthenelse_wf,
false_wf,
bfalse_wf,
btrue_wf,
not_wf,
assert_of_bnot,
eqff_to_assert,
uiff_transitivity,
eqtt_to_assert,
subtype_rel_self,
eo-forward_wf,
assert_wf,
es-first_wf,
event-ordering+_inc,
event-ordering+_wf,
bool_wf,
band_wf,
bor_wf,
es-ble_wf,
bnot_wf,
eq_id_wf,
es-loc_wf,
member_wf,
es-E_wf,
es-base-E_wf,
subtype_rel_wf,
es-dom_wf
\mforall{}[Info:Type]. \mforall{}[eo:EO+(Info)]. \mforall{}[e:E]. eo.e = eo supposing \muparrow{}first(e)
Date html generated:
2011_08_16-AM-11_25_12
Last ObjectModification:
2011_06_20-AM-00_26_18
Home
Index