Nuprl Lemma : ses-thread-weak-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-le: e ≤loc e'  select: L[n] length: ||as|| int_seg: {i..j-} uimplies: supposing a le: A ≤ B all: x:A. B[x] natural_number: $n
Definitions unfolded in proof :  all: x:A. B[x] member: t ∈ T ses-thread: Thread uimplies: supposing a le: A ≤ B and: P ∧ Q not: ¬A implies:  Q false: False uall: [x:A]. B[x] int_seg: {i..j-} prop: decidable: Dec(P) or: P ∨ Q guard: {T} subtype_rel: A ⊆B lelt: i ≤ j < k satisfiable_int_formula: satisfiable_int_formula(fmla) exists: x:A. B[x] top: Top less_than: a < b squash: T 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]  \mleq{}loc  thr[j]    supposing  i  \mleq{}  j



Date html generated: 2016_05_17-PM-00_30_32
Last ObjectModification: 2016_01_18-AM-07_43_31

Theory : event-logic-applications


Home Index