Nuprl Lemma : decidable__equal_runEvents
∀[M:Type ⟶ Type]. ∀r:pRunType(P.M[P]). ∀e1,e2:runEvents(r). Dec(e1 = e2 ∈ runEvents(r))
Proof
Definitions occuring in Statement :
runEvents: runEvents(r),
pRunType: pRunType(T.M[T]),
decidable: Dec(P),
uall: ∀[x:A]. B[x],
so_apply: x[s],
all: ∀x:A. B[x],
function: x:A ⟶ B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
runEvents: runEvents(r),
member: t ∈ T,
implies: P ⇒ Q,
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
uimplies: b supposing a,
top: Top,
prop: ℙ
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}r:pRunType(P.M[P]). \mforall{}e1,e2:runEvents(r). Dec(e1 = e2)
Date html generated:
2016_05_17-AM-10_42_48
Last ObjectModification:
2015_12_29-PM-05_23_31
Theory : process-model
Home
Index