Nuprl Lemma : processChoose_wf2

[l_comm:Id]. (processChoose(l_comm) ∈ pi-process())


Proof




Definitions occuring in Statement :  processChoose: processChoose(l_comm) pi-process: pi-process() Id: Id uall: [x:A]. B[x] member: t ∈ T
Definitions unfolded in proof :  member: t ∈ T uall: [x:A]. B[x] processChoose: processChoose(l_comm) let: let so_lambda: λ2y.t[x; y] all: x:A. B[x] piM: piM(T) implies:  Q bool: 𝔹 unit: Unit it: btrue: tt ifthenelse: if then else fi  uiff: uiff(P;Q) and: P ∧ Q uimplies: supposing a iff: ⇐⇒ Q so_lambda: λ2x.t[x] so_apply: x[s] bfalse: ff exists: x:A. B[x] prop: or: P ∨ Q sq_type: SQType(T) guard: {T} bnot: ¬bb assert: b false: False not: ¬A rev_implies:  Q type-monotone: Monotone(T.F[T]) subtype_rel: A ⊆B pi-process: pi-process() PiDataVal: PiDataVal() pMsg: pMsg(P.M[P]) so_apply: x[s1;s2]

Latex:
\mforall{}[l$_{comm}$:Id].  (processChoose(l$_{comm}$)  \mmember{}  pi-process())



Date html generated: 2016_05_17-AM-11_31_00
Last ObjectModification: 2015_12_29-PM-06_50_32

Theory : event-logic-applications


Home Index