Nuprl Lemma : mk-tagged_wf_pCom_msg
∀[M:Type ─→ Type]
∀[Q:Type]. ∀[m:pMsg(T.M[T])]. (mk-tagged("msg";m) ∈ Com(P.M[P]) Q) supposing Process(P.M[P]) ⊆r Q
supposing Monotone(T.M[T])
Proof
Definitions occuring in Statement :
pMsg: pMsg(P.M[P])
,
Process: Process(P.M[P])
,
Com: Com(P.M[P])
,
type-monotone: Monotone(T.F[T])
,
uimplies: b supposing a
,
subtype_rel: A ⊆r B
,
uall: ∀[x:A]. B[x]
,
so_apply: x[s]
,
member: t ∈ T
,
apply: f a
,
function: x:A ─→ B[x]
,
token: "$token"
,
universe: Type
,
mk-tagged: mk-tagged(tg;x)
Lemmas :
mk-tagged_wf,
assert_of_eq_atom,
Process_wf,
mk-tagged_wf_unequal,
iff_transitivity,
not_wf,
equal-wf-base,
false_wf,
true_wf,
iff_weakening_uiff,
assert_of_bnot,
bfalse_wf,
Id_wf,
unit_wf2,
bool_wf,
pMsg_wf,
subtype_rel_wf,
type-monotone_wf
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]
\mforall{}[Q:Type]. \mforall{}[m:pMsg(T.M[T])]. (mk-tagged("msg";m) \mmember{} Com(P.M[P]) Q) supposing Process(P.M[P]) \msubseteq{}r Q
supposing Monotone(T.M[T])
Date html generated:
2015_07_23-AM-11_06_50
Last ObjectModification:
2015_01_29-AM-00_11_24
Home
Index