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
Lemmas :
Com_wf,
Process_wf
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. (pCom(P.M[P]) \mmember{} Type)
Date html generated:
2015_07_23-AM-11_06_48
Last ObjectModification:
2015_01_29-AM-00_10_37
Home
Index