Nuprl Lemma : ses-flow-causle

s:SES. ∀es:EO+(Info). ∀e1,e2:E. ∀a:Atom1.  (ses-flow(s;es;a;e1;e2)  e1 c≤ e2)


Proof




Definitions occuring in Statement :  ses-flow: ses-flow(s;es;a;e1;e2) ses-info: Info security-event-structure: SES event-ordering+: EO+(Info) es-causle: c≤ e' es-E: E atom: Atom$n all: x:A. B[x] implies:  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 ⊆B so_apply: x[s1;s2;s3] implies:  Q and: P ∧ Q guard: {T} prop: es-E-interface: E(X) so_lambda: λ2y.t[x; y] so_apply: x[s1;s2] uimplies: supposing a top: Top sq_type: SQType(T) assert: b ifthenelse: if then else 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{}  e1  c\mleq{}  e2)



Date html generated: 2016_05_17-AM-11_48_12
Last ObjectModification: 2016_01_18-AM-07_45_57

Theory : event-logic-applications


Home Index