Nuprl Lemma : pCom_wf
∀[M:Type ⟶ Type]. (pCom(P.M[P]) ∈ Type)
Proof
Definitions occuring in Statement : 
pCom: pCom(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
, 
pCom: pCom(P.M[P])
, 
so_lambda: λ2x.t[x]
, 
so_apply: x[s]
Latex:
\mforall{}[M:Type  {}\mrightarrow{}  Type].  (pCom(P.M[P])  \mmember{}  Type)
Date html generated:
2016_05_17-AM-10_22_38
Last ObjectModification:
2015_12_29-PM-05_28_09
Theory : process-model
Home
Index