Nuprl Lemma : msg-rename_wf
∀[M:IdLnk ⟶ Id ⟶ Type]. ∀[rt:Id ⟶ Id]. ∀[rtinv:Id ⟶ (Id?)].
∀[m:Msg(M)]. msg-rename(rtinv;m) ∈ Msg(λl,tg. (M l (rt tg))) supposing ↑isl(rtinv mtag(m))
supposing inv-rel(Id;Id;rt;rtinv)
Proof
Definitions occuring in Statement :
msg-rename: msg-rename(rtinv;m),
mtag: mtag(m),
Msg: Msg(M),
IdLnk: IdLnk,
Id: Id,
assert: ↑b,
isl: isl(x),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
unit: Unit,
member: t ∈ T,
apply: f a,
lambda: λx.A[x],
function: x:A ⟶ B[x],
union: left + right,
universe: Type,
inv-rel: inv-rel(A;B;f;finv)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
prop: ℙ,
Msg: Msg(M),
msg-rename: msg-rename(rtinv;m),
pi1: fst(t),
pi2: snd(t),
mtag: mtag(m),
all: ∀x:A. B[x],
implies: P ⇒ Q,
outl: outl(x),
isl: isl(x),
and: P ∧ Q,
not: ¬A,
false: False,
Id: Id,
sq_type: SQType(T),
guard: {T},
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
bfalse: ff,
inv-rel: inv-rel(A;B;f;finv)
Latex:
\mforall{}[M:IdLnk {}\mrightarrow{} Id {}\mrightarrow{} Type]. \mforall{}[rt:Id {}\mrightarrow{} Id]. \mforall{}[rtinv:Id {}\mrightarrow{} (Id?)].
\mforall{}[m:Msg(M)]. msg-rename(rtinv;m) \mmember{} Msg(\mlambda{}l,tg. (M l (rt tg))) supposing \muparrow{}isl(rtinv mtag(m))
supposing inv-rel(Id;Id;rt;rtinv)
Date html generated:
2016_05_16-AM-10_55_48
Last ObjectModification:
2015_12_29-AM-09_16_39
Theory : event-ordering
Home
Index