Nuprl Lemma : norm-system_wf
∀[M:Type ⟶ Type]. norm-system ∈ id-fun(System(P.M[P])) supposing M[Top]
Proof
Definitions occuring in Statement :
norm-system: norm-system,
System: System(P.M[P]),
id-fun: id-fun(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
so_apply: x[s],
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
System: System(P.M[P]),
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
norm-system: norm-system,
so_lambda: λ2x.t[x],
so_apply: x[s],
all: ∀x:A. B[x],
ldag: LabeledDAG(T),
labeled-graph: LabeledGraph(T),
implies: P ⇒ Q,
or: P ∨ Q,
prop: ℙ,
pInTransit: pInTransit(P.M[P]),
id-fun: id-fun(T)
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. norm-system \mmember{} id-fun(System(P.M[P])) supposing M[Top]
Date html generated:
2016_05_17-AM-10_37_39
Last ObjectModification:
2015_12_29-PM-05_25_51
Theory : process-model
Home
Index