Nuprl Lemma : decidable__run-pred
∀[M:Type ⟶ Type]. ∀r:pRunType(P.M[P]). ∀e1,e2:runEvents(r). Dec(e1 run-pred(r) e2)
Proof
Definitions occuring in Statement :
run-pred: run-pred(r),
runEvents: runEvents(r),
pRunType: pRunType(T.M[T]),
decidable: Dec(P),
uall: ∀[x:A]. B[x],
infix_ap: x f y,
so_apply: x[s],
all: ∀x:A. B[x],
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
member: t ∈ T,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
let: let,
run-pred: run-pred(r),
infix_ap: x f y,
decidable: Dec(P),
and: P ∧ Q,
or: P ∨ Q,
not: ¬A,
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
uimplies: b supposing a,
top: Top,
implies: P ⇒ Q,
runEvents: runEvents(r),
run-event-step: run-event-step(e),
run-event-loc: run-event-loc(e),
pi2: snd(t),
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),
nat: ℕ,
bfalse: ff,
exposed-it: exposed-it,
exists: ∃x:A. B[x],
prop: ℙ,
sq_type: SQType(T),
guard: {T},
assert: ↑b,
false: False,
bnot: ¬bb,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
cand: A c∧ B
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}r:pRunType(P.M[P]). \mforall{}e1,e2:runEvents(r). Dec(e1 run-pred(r) e2)
Date html generated:
2016_05_17-AM-10_49_14
Last ObjectModification:
2015_12_29-PM-05_21_50
Theory : process-model
Home
Index