Nuprl Lemma : ses-flow_wf
∀[s:SES]. ∀[es:EO+(Info)]. ∀[e1,e2:E]. ∀[a:Atom1]. (ses-flow(s;es;a;e1;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-E: E,
atom: Atom$n,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
nat: ℕ,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
not: ¬A,
top: Top,
and: P ∧ Q,
prop: ℙ,
guard: {T},
int_seg: {i..j-},
lelt: i ≤ j < k,
decidable: Dec(P),
or: P ∨ Q,
le: A ≤ B,
less_than': less_than'(a;b),
less_than: a < b,
squash: ↓T,
ses-flow: ses-flow(s;es;a;e1;e2),
ycomb: Y,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
so_lambda: λ2x.t[x],
es-E-interface: E(X),
sq_type: SQType(T),
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
true: True,
so_apply: x[s],
es-causle: e c≤ e',
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q
Latex:
\mforall{}[s:SES]. \mforall{}[es:EO+(Info)]. \mforall{}[e1,e2:E]. \mforall{}[a:Atom1]. (ses-flow(s;es;a;e1;e2) \mmember{} \mBbbP{})
Date html generated:
2016_05_17-AM-11_47_04
Last ObjectModification:
2016_01_18-AM-07_49_03
Theory : event-logic-applications
Home
Index