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
Lemmas :
System_wf,
lg-size_wf,
pInTransit_wf,
map_wf,
list_wf,
int_seg_wf,
nat_wf,
Id_wf,
remove-repeats_wf,
id-deq_wf,
append_wf,
Process_wf,
l_member_wf,
labeled-graph_wf,
mapfilter_wf,
eq_id_wf,
assert_wf
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:
2015_07_23-AM-11_08_22
Last ObjectModification:
2015_01_29-AM-00_09_47
Home
Index