Nuprl Lemma : run-cause_wf
∀[M:Type ⟶ Type]. ∀[r:pRunType(P.M[P])]. (run-cause(r) ∈ runEvents(r) ⟶ (runEvents(r)?))
Proof
Definitions occuring in Statement :
run-cause: run-cause(r),
runEvents: runEvents(r),
pRunType: pRunType(T.M[T]),
uall: ∀[x:A]. B[x],
so_apply: x[s],
unit: Unit,
member: t ∈ T,
function: x:A ⟶ B[x],
union: left + right,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
run-cause: run-cause(r),
so_lambda: λ2x.t[x],
so_apply: x[s],
all: ∀x:A. B[x],
implies: P ⇒ Q,
pi1: fst(t),
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
band: p ∧b q,
ifthenelse: if b then t else f fi ,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
nat: ℕ,
prop: ℙ,
bfalse: ff,
exposed-bfalse: exposed-bfalse,
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
pi2: snd(t),
runEvents: runEvents(r),
subtype_rel: A ⊆r B,
top: Top,
assert: ↑b,
false: False,
bnot: ¬bb,
not: ¬A,
le: A ≤ B,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}[r:pRunType(P.M[P])]. (run-cause(r) \mmember{} runEvents(r) {}\mrightarrow{} (runEvents(r)?))
Date html generated:
2016_05_17-AM-10_47_26
Last ObjectModification:
2015_12_29-PM-05_22_30
Theory : process-model
Home
Index