Nuprl Lemma : com-kind_wf
∀[M:Type ⟶ Type]. ∀[c:pCom(P.M[P])]. (com-kind(c) ∈ Atom)
Proof
Definitions occuring in Statement :
com-kind: com-kind(c),
pCom: pCom(P.M[P]),
uall: ∀[x:A]. B[x],
so_apply: x[s],
member: t ∈ T,
function: x:A ⟶ B[x],
atom: Atom,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
com-kind: com-kind(c),
so_lambda: λ2x.t[x],
so_apply: x[s],
pCom: pCom(P.M[P]),
Com: Com(P.M[P])
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}[c:pCom(P.M[P])]. (com-kind(c) \mmember{} Atom)
Date html generated:
2016_05_17-AM-10_23_01
Last ObjectModification:
2015_12_29-PM-05_27_39
Theory : process-model
Home
Index