Nuprl Lemma : system-fpf_wf
∀[M:Type ⟶ Type]. ∀[S:System(P.M[P])].
(system-fpf(S) ∈ x:Id fp-> Process(P.M[P]) List × LabeledGraph(pInTransit(P.M[P])))
Proof
Definitions occuring in Statement :
system-fpf: system-fpf(S),
System: System(P.M[P]),
pInTransit: pInTransit(P.M[P]),
Process: Process(P.M[P]),
labeled-graph: LabeledGraph(T),
fpf: a:A fp-> B[a],
Id: Id,
list: T List,
uall: ∀[x:A]. B[x],
so_apply: x[s],
member: t ∈ T,
function: x:A ⟶ B[x],
product: x:A × B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_lambda: λ2x.t[x],
so_apply: x[s],
System: System(P.M[P]),
system-fpf: system-fpf(S),
fpf: a:A fp-> B[a],
mkfpf: mkfpf(a;b),
let: let,
ldag: LabeledDAG(T),
labeled-graph: LabeledGraph(T),
lg-size: lg-size(g),
subtype_rel: A ⊆r B,
guard: {T},
nat: ℕ,
pi2: snd(t),
pi1: fst(t),
pInTransit: pInTransit(P.M[P]),
component: component(P.M[P]),
uimplies: b supposing a,
all: ∀x:A. B[x],
top: Top,
prop: ℙ
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}[S:System(P.M[P])].
(system-fpf(S) \mmember{} x:Id fp-> Process(P.M[P]) List \mtimes{} LabeledGraph(pInTransit(P.M[P])))
Date html generated:
2016_05_17-AM-10_37_20
Last ObjectModification:
2015_12_29-PM-05_26_22
Theory : process-model
Home
Index