Nuprl Lemma : run-event-history_wf
∀[M:Type ⟶ Type]. ∀[r:pRunType(P.M[P])]. ∀[e:runEvents(r)]. (run-event-history(r;e) ∈ runEvents(r) List)
Proof
Definitions occuring in Statement :
run-event-history: run-event-history(r;e),
runEvents: runEvents(r),
pRunType: pRunType(T.M[T]),
list: T List,
uall: ∀[x:A]. B[x],
so_apply: x[s],
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
run-event-history: run-event-history(r;e),
let: let,
and: P ∧ Q,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
nat: ℕ,
uimplies: b supposing a,
implies: P ⇒ Q,
cand: A c∧ B,
pi1: fst(t),
pi2: snd(t),
is-run-event: is-run-event(r;t;x),
runEvents: runEvents(r),
top: Top
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}[r:pRunType(P.M[P])]. \mforall{}[e:runEvents(r)].
(run-event-history(r;e) \mmember{} runEvents(r) List)
Date html generated:
2016_05_17-AM-10_44_02
Last ObjectModification:
2015_12_29-PM-05_23_23
Theory : process-model
Home
Index