Nuprl Lemma : ses-flow-has
∀s:SES. ∀es:EO+(Info). ∀e1,e2:E. ∀a:Atom1. (ses-flow(s;es;a;e1;e2) ⇒ (e2 has a))
Proof
Definitions occuring in Statement :
ses-flow: ses-flow(s;es;a;e1;e2),
event-has: (e has a),
ses-info: Info,
security-event-structure: SES,
event-ordering+: EO+(Info),
es-E: E,
atom: Atom$n,
all: ∀x:A. B[x],
implies: P ⇒ Q
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
uall: ∀[x:A]. B[x],
so_lambda: so_lambda(x,y,z.t[x; y; z]),
subtype_rel: A ⊆r B,
so_apply: x[s1;s2;s3],
implies: P ⇒ Q,
and: P ∧ Q,
prop: ℙ,
es-E-interface: E(X),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
uimplies: b supposing a,
top: Top,
sq_type: SQType(T),
guard: {T},
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
true: True
Latex:
\mforall{}s:SES. \mforall{}es:EO+(Info). \mforall{}e1,e2:E. \mforall{}a:Atom1. (ses-flow(s;es;a;e1;e2) {}\mRightarrow{} (e2 has a))
Date html generated:
2016_05_17-AM-11_47_35
Last ObjectModification:
2016_01_18-AM-07_46_07
Theory : event-logic-applications
Home
Index