Nuprl Lemma : decidable__run-lt
∀[M:Type ⟶ Type]
  ∀r:pRunType(P.M[P])
    ∀e1,e2:runEvents(r).  Dec(e1 run-lt(r) e2) supposing ∀e:runEvents(r). fst(fst(run-info(r;e))) < run-event-step(e)
Proof
Definitions occuring in Statement : 
run-lt: run-lt(r)
, 
run-event-step: run-event-step(e)
, 
runEvents: runEvents(r)
, 
run-info: run-info(r;e)
, 
pRunType: pRunType(T.M[T])
, 
less_than: a < b
, 
decidable: Dec(P)
, 
uimplies: b supposing a
, 
uall: ∀[x:A]. B[x]
, 
infix_ap: x f y
, 
so_apply: x[s]
, 
pi1: fst(t)
, 
all: ∀x:A. B[x]
, 
function: x:A ⟶ B[x]
, 
universe: Type
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
all: ∀x:A. B[x]
, 
uimplies: b supposing a
, 
member: t ∈ T
, 
so_lambda: λ2x.t[x]
, 
so_apply: x[s]
, 
implies: P 
⇒ Q
, 
pi1: fst(t)
, 
subtype_rel: A ⊆r B
, 
nat: ℕ
, 
run-lt: run-lt(r)
, 
prop: ℙ
Latex:
\mforall{}[M:Type  {}\mrightarrow{}  Type]
    \mforall{}r:pRunType(P.M[P])
        \mforall{}e1,e2:runEvents(r).    Dec(e1  run-lt(r)  e2) 
        supposing  \mforall{}e:runEvents(r).  fst(fst(run-info(r;e)))  <  run-event-step(e)
Date html generated:
2016_05_17-AM-10_50_24
Last ObjectModification:
2015_12_29-PM-05_20_39
Theory : process-model
Home
Index