Nuprl Lemma : finite-run-pred
∀[M:Type ⟶ Type]
∀r:pRunType(P.M[P])
rel_finite(runEvents(r);run-pred(r)) supposing ∀e:runEvents(r). fst(fst(run-info(r;e))) < run-event-step(e)
Proof
Definitions occuring in Statement :
run-pred: run-pred(r),
run-event-step: run-event-step(e),
runEvents: runEvents(r),
run-info: run-info(r;e),
pRunType: pRunType(T.M[T]),
rel_finite: rel_finite(T;R),
less_than: a < b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
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: ℕ,
rel_finite: rel_finite(T;R),
exists: ∃x:A. B[x],
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
prop: ℙ,
infix_ap: x f y
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]
\mforall{}r:pRunType(P.M[P])
rel\_finite(runEvents(r);run-pred(r))
supposing \mforall{}e:runEvents(r). fst(fst(run-info(r;e))) < run-event-step(e)
Date html generated:
2016_05_17-AM-10_47_55
Last ObjectModification:
2015_12_29-PM-05_22_01
Theory : process-model
Home
Index