{ 
[Info:Type]. [es:EO+(Info)]. [X:EClass(Top)]. [f:sys-antecedent(es;X)].
[a,b:E(X)].
(a = b) supposing (b 
(X;f) a and a (X;f) b) }
{ Proof }
Definitions occuring in Statement :
cut-order: a (X;f) b,
sys-antecedent: sys-antecedent(es;Sys),
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
uimplies: b supposing a,
uall: [x:A]. B[x],
top: Top,
universe: Type,
equal: s = t
Definitions :
in-eclass: e 
X,
record-select: r.x,
infix_ap: x f y,
es-causl: (e < e'),
union: left + right,
or: P 
Q,
es-causle: e c e',
subtype: S 
T,
top: Top,
event_ordering: EO,
es-E: E,
lambda: 
x.A[x],
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),
fset-member: a s,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
ifthenelse: if b then t else f fi ,
assert: 
b,
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,
function: x:A 
B[x],
all: x:A. B[x],
axiom: Ax,
prop: 
,
cut-order: a (X;f) b,
universe: Type,
uimplies: b supposing a,
equal: s = t,
event-ordering+: EO+(Info),
so_lambda: 
x y.t[x; y],
eclass: EClass(A[eo; e]),
sys-antecedent: sys-antecedent(es;Sys),
uall: [x:A]. B[x],
es-E-interface: E(X),
member: t T,
isect: 
x:A. B[x],
guard: {T},
implies: P 
Q,
btrue: tt,
sq_type: SQType(T),
bool: 
,
true: True,
false: False,
atom: Atom,
apply: f a,
es-base-E: es-base-E(es),
token: "$token",
MaAuto: Error :MaAuto,
RepeatFor: Error :RepeatFor,
CollapseTHEN: Error :CollapseTHEN
Lemmas :
es-base-E_wf,
subtype_rel_self,
false_wf,
ifthenelse_wf,
true_wf,
subtype_base_sq,
bool_subtype_base,
bool_wf,
assert_elim,
in-eclass_wf,
cut-order_wf,
sys-antecedent_wf,
eclass_wf,
top_wf,
event-ordering+_inc,
event-ordering+_wf,
cut-order-causle,
es-E-interface_wf,
assert_wf,
es-E_wf,
es-causle_antisymmetry
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[f:sys-antecedent(es;X)]. \mforall{}[a,b:E(X)].
(a = b) supposing (b \mleq{}(X;f) a and a \mleq{}(X;f) b)
Date html generated:
2011_08_16-PM-05_55_21
Last ObjectModification:
2011_06_20-AM-01_38_44
Home
Index