Nuprl Lemma : add-cause_wf
∀[M:Type ⟶ Type]. ∀[ev:ℕ × Id]. ∀[ext:pExt(P.M[P])]. (add-cause(ev;ext) ∈ LabeledDAG(pInTransit(P.M[P])))
Proof
Definitions occuring in Statement :
add-cause: add-cause(ev;ext),
pInTransit: pInTransit(P.M[P]),
pExt: pExt(P.M[P]),
ldag: LabeledDAG(T),
Id: Id,
nat: ℕ,
uall: ∀[x:A]. B[x],
so_apply: x[s],
member: t ∈ T,
function: x:A ⟶ B[x],
product: x:A × B[x],
universe: Type
Definitions unfolded in proof :
pInTransit: pInTransit(P.M[P]),
pExt: pExt(P.M[P]),
uall: ∀[x:A]. B[x],
member: t ∈ T,
add-cause: add-cause(ev;ext),
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
uimplies: b supposing a,
nat: ℕ,
all: ∀x:A. B[x]
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}[ev:\mBbbN{} \mtimes{} Id]. \mforall{}[ext:pExt(P.M[P])].
(add-cause(ev;ext) \mmember{} LabeledDAG(pInTransit(P.M[P])))
Date html generated:
2016_05_17-AM-10_37_47
Last ObjectModification:
2015_12_29-PM-05_25_55
Theory : process-model
Home
Index