Nuprl Lemma : command-to-msg_wf

[M:Type ⟶ Type]. ∀[c:pCom(P.M[P])]. ∀[nmsg,lmsg:pMsg(P.M[P])].  (command-to-msg(c;nmsg;lmsg) ∈ pMsg(P.M[P]))


Proof




Definitions occuring in Statement :  command-to-msg: command-to-msg(c;nmsg;lmsg) pCom: pCom(P.M[P]) pMsg: pMsg(P.M[P]) uall: [x:A]. B[x] so_apply: x[s] member: t ∈ T function: x:A ⟶ B[x] universe: Type
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T command-to-msg: command-to-msg(c;nmsg;lmsg) so_lambda: λ2x.t[x] so_apply: x[s] all: x:A. B[x] implies:  Q bool: 𝔹 unit: Unit it: btrue: tt uiff: uiff(P;Q) and: P ∧ Q uimplies: supposing a ifthenelse: if then else fi  bfalse: ff iff: ⇐⇒ Q not: ¬A prop: rev_implies:  Q

Latex:
\mforall{}[M:Type  {}\mrightarrow{}  Type].  \mforall{}[c:pCom(P.M[P])].  \mforall{}[nmsg,lmsg:pMsg(P.M[P])].
    (command-to-msg(c;nmsg;lmsg)  \mmember{}  pMsg(P.M[P]))



Date html generated: 2016_05_17-AM-10_56_44
Last ObjectModification: 2015_12_29-PM-05_18_05

Theory : process-model


Home Index