Nuprl Lemma : ses-thread-order
∀s:SES. ∀es:EO+(Info). ∀thr:Thread. ∀i,j:ℕ||thr||. (thr[i] <loc thr[j]) supposing i < j
Proof
Definitions occuring in Statement :
ses-thread: Thread,
ses-info: Info,
security-event-structure: SES,
event-ordering+: EO+(Info),
es-locl: (e <loc e'),
select: L[n],
length: ||as||,
int_seg: {i..j-},
less_than: a < b,
uimplies: b supposing a,
all: ∀x:A. B[x],
natural_number: $n
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
uall: ∀[x:A]. B[x],
ses-thread: Thread,
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},
es-locl: (e <loc e'),
es-causl: (e < e'),
squash: ↓T,
int_seg: {i..j-},
lelt: i ≤ j < k,
decidable: Dec(P),
or: P ∨ Q,
subtype_rel: A ⊆r B,
le: A ≤ B,
less_than': less_than'(a;b),
less_than: a < b,
uiff: uiff(P;Q),
subtract: n - m,
ses-act: Act,
sq_type: SQType(T)
Latex:
\mforall{}s:SES. \mforall{}es:EO+(Info). \mforall{}thr:Thread. \mforall{}i,j:\mBbbN{}||thr||. (thr[i] <loc thr[j]) supposing i < j
Date html generated:
2016_05_17-PM-00_30_19
Last ObjectModification:
2016_01_18-AM-07_44_44
Theory : event-logic-applications
Home
Index