Nuprl Lemma : intransit-to-info_wf
∀[M:Type ⟶ Type]. ∀[r:fulpRunType(P.M[P])]. ∀[n2m:ℕ ⟶ pMsg(P.M[P])]. ∀[l2m:Id ⟶ pMsg(P.M[P])].
∀[env:pEnvType(P.M[P])]. ∀[t:ℕ+]. ∀[lbl:pInTransit(P.M[P])].
(intransit-to-info(n2m;l2m;r;env;t;lbl) ∈ ℤ × Id × pMsg(P.M[P]))
Proof
Definitions occuring in Statement :
intransit-to-info: intransit-to-info(n2m;l2m;r;env;t;lbl),
pEnvType: pEnvType(T.M[T]),
fulpRunType: fulpRunType(T.M[T]),
pInTransit: pInTransit(P.M[P]),
pMsg: pMsg(P.M[P]),
Id: Id,
nat_plus: ℕ+,
nat: ℕ,
uall: ∀[x:A]. B[x],
so_apply: x[s],
member: t ∈ T,
function: x:A ⟶ B[x],
product: x:A × B[x],
int: ℤ,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
intransit-to-info: intransit-to-info(n2m;l2m;r;env;t;lbl),
pEnvType: pEnvType(T.M[T]),
fulpRunType: fulpRunType(T.M[T]),
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
nat_plus: ℕ+,
uimplies: b supposing a,
le: A ≤ B,
and: P ∧ Q,
less_than': less_than'(a;b),
false: False,
not: ¬A,
implies: P ⇒ Q,
prop: ℙ,
all: ∀x:A. B[x],
System: System(P.M[P]),
top: Top,
spreadn: spread3,
pInTransit: pInTransit(P.M[P])
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}[r:fulpRunType(P.M[P])]. \mforall{}[n2m:\mBbbN{} {}\mrightarrow{} pMsg(P.M[P])]. \mforall{}[l2m:Id {}\mrightarrow{} pMsg(P.M[P])].
\mforall{}[env:pEnvType(P.M[P])]. \mforall{}[t:\mBbbN{}\msupplus{}]. \mforall{}[lbl:pInTransit(P.M[P])].
(intransit-to-info(n2m;l2m;r;env;t;lbl) \mmember{} \mBbbZ{} \mtimes{} Id \mtimes{} pMsg(P.M[P]))
Date html generated:
2016_05_17-AM-10_56_57
Last ObjectModification:
2015_12_29-PM-05_17_48
Theory : process-model
Home
Index