{ 
s:SES. (PropertyO 
ActionsDisjoint ses-ordering'(s)) }
{ Proof }
Definitions occuring in Statement :
ses-disjoint: ActionsDisjoint,
ses-ordering': ses-ordering'(s),
ses-ordering: PropertyO,
security-event-structure: SES,
all: x:A. B[x],
implies: P Q
Definitions :
member: t 
T,
function: x:A 
B[x],
ses-info: Info,
event-ordering+: EO+(Info),
security-event-structure: SES,
ses-ordering: PropertyO,
ses-disjoint: ActionsDisjoint,
event_ordering: EO,
top: Top,
union: left + right,
ses-ordering': ses-ordering'(s),
subtype_rel: A 
r B,
strong-subtype: strong-subtype(A;B),
void: Void,
false: False,
assert: 
b,
not: 
A,
prop: 
,
ses-crypt: cipherText(e),
event-has*: e has* a,
es-causl: (e < e'),
and: P 
Q,
es-locl: (e <loc e'),
ses-send: Send,
es-E-interface: E(X),
exists: 
x:A. B[x],
es-le: e 
loc e' ,
or: P 
Q,
ses-encrypt: Encrypt,
eclass-val: X(e),
atom: Atom$n,
encryption-key: Key,
product: x:A 
B[x],
sdata: SecurityData,
equal: s = t,
ses-info-flow: ->>,
es-E: E,
rel_exp: R^n,
infix_ap: x f y,
event-has: (e has a),
implies: P Q,
all: x:A. B[x],
ses-sig: signature(e),
ses-sign: Sign,
Id: Id,
ses-new: New,
nat: 
,
Auto: Error :Auto,
D: Error :D,
CollapseTHENA: Error :CollapseTHENA,
CollapseTHEN: Error :CollapseTHEN,
tactic: Error :tactic,
dep-isect: Error :dep-isect,
universe: Type,
token: "$token",
eq_atom: x =a y,
ifthenelse: if b then t else f fi ,
atom: Atom,
eq_atom: eq_atom$n(x;y),
apply: f a,
record-select: r.x,
record+: record+,
set: {x:A| B[x]} ,
rel_star: R^*,
bool: 
,
less_than: a < b,
isect: 
x:A. B[x],
le: A B,
int: 
,
eclass: EClass(A[eo; e]),
so_lambda: 
x y.t[x; y],
cand: A c B,
class-value-has: X(e) has a,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
rec: rec(x.A[x]),
tree: Tree(E),
guard: {T},
decidable: Dec(P),
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),
collect-event: collect-event(es;X;n;v.num[v];L.P[L];e),
cut-order: a (X;f) b,
path-goes-thru: x-f*-y thru i,
es-r-immediate-pred: es-r-immediate-pred(es;R;e';e),
same-thread: same-thread(es;p;e;e'),
ses-action: Action(e),
in-eclass: e 
X,
true: True,
sq_type: SQType(T),
subtype: S T,
lambda: x.A[x],
l_member: (x l),
so_apply: x[s],
fpf: a:A fp-> B[a],
isl: isl(x),
can-apply: can-apply(f;x),
natural_number: $n,
add: n + m,
subtract: n - m,
real: 
,
grp_car: |g|,
minus: -n,
ge: i 
j ,
btrue: tt,
iff: P 
Q,
squash: 
T,
sqequal: s ~ t,
RepUR: Error :RepUR,
MaAuto: Error :MaAuto,
Complete: Error :Complete,
Try: Error :Try,
ExRepD: Error :ExRepD,
AssertBY: Error :AssertBY,
pair: <a, b>,
ses-rcv: Rcv,
ses-verify: Verify,
ses-decrypt: Decrypt,
intensional-universe: IType,
limited-type: LimitedType,
same-action: same-action(x;y),
list: type List,
nat_plus: 
,
l_contains: A B,
inject: Inj(A;B;f),
reducible: reducible(a),
prime: prime(a),
l_disjoint: l_disjoint(T;l1;l2),
l_exists: (xL. P[x]),
l_all: (xL.P[x]),
fun-connected: y is f*(x),
rationals: 
,
qle: r s,
qless: r < s,
q-rel: q-rel(r;x),
p-outcome: Outcome,
dstype: dstype(TypeNames; d; a),
fset-member: a s,
f-subset: xs ys,
fset: FSet{T},
fset-closed: (s closed under fs),
string: Error :string,
IdLnk: IdLnk,
Knd: Knd,
MaName: MaName,
consensus-state3: consensus-state3(T),
cs-not-completed: in state s, a has not completed inning i,
cs-archived: by state s, a archived v in inning i,
cs-passed: by state s, a passed inning i without archiving a value,
cs-inning-committed: in state s, inning i has committed v,
cs-inning-committable: in state s, inning i could commit v ,
cs-archive-blocked: in state s, ws' blocks ws from archiving v in inning i,
cs-precondition: state s may consider v in inning i,
consensus-rcv: consensus-rcv(V;A),
eq_int: (i =
j),
HypSubst: Error :HypSubst,
es-p-le: e p e',
causal-predecessor: causal-predecessor(es;p),
es-p-locl: e p< e',
it: 
,
es-loc: loc(e),
rev_implies: P Q,
ParallelOp: Error :ParallelOp,
RepeatFor: Error :RepeatFor
Lemmas :
es-causle_weakening,
rel_star_transitivity,
rel_rel_star,
rel_star_wf,
es-locl_transitivity1,
es-causl_weakening,
es-causle_weakening_locl,
es-causl_transitivity2,
es-le_transitivity,
ses-info-flow-exp_functionality,
nat_plus_wf,
guard_wf,
event-has_functionality,
same-action_wf,
decidable__equal_int,
int_sq,
bool_wf,
intensional-universe_wf,
ses-decrypt_wf,
ses-verify_wf,
ses-rcv_wf,
squash_wf,
true_wf,
rel_exp_iff,
nat_properties,
ge_wf,
nat_wf,
le_wf,
ses-sig_wf,
event-ordering+_inc,
eclass-val_wf,
assert_wf,
bool_sq,
assert_elim,
in-eclass_wf,
decidable__es-le,
event-has_wf,
ses-crypt_wf,
rel_exp_wf,
ses-info-flow_wf,
eclass_wf,
member_wf,
es-interface-top,
es-interface-subtype_rel,
subtype_rel_wf,
top_wf,
subtype_rel_self,
ses-ordering'_wf,
ses-disjoint_wf,
ses-ordering_wf,
security-event-structure_wf,
encryption-key_wf,
ses-encrypt_wf,
Id_wf,
sdata_wf,
ses-sign_wf,
es-le_wf,
es-causl_wf,
es-locl_wf,
ses-send_wf,
event-has*_wf,
ses-new_wf,
es-E-interface_wf,
es-E_wf,
event-ordering+_wf,
ses-info_wf
\mforall{}s:SES. (PropertyO {}\mRightarrow{} ActionsDisjoint {}\mRightarrow{} ses-ordering'(s))
Date html generated:
2011_08_17-PM-07_29_54
Last ObjectModification:
2010_09_24-PM-02_46_16
Home
Index