Nuprl Lemma : graph-rcvs_wf
∀[S:Id List]. ∀[G:Graph(S)]. ∀[a:Id ⟶ Id ⟶ Id]. ∀[b:Id]. ∀[j:{j:Id| (j ∈ S)} ]. (graph-rcvs(S;G;a;b;j) ∈ Knd List)
Proof
Definitions occuring in Statement :
graph-rcvs: graph-rcvs(S;G;a;b;j),
Knd: Knd,
id-graph: Graph(S),
Id: Id,
l_member: (x ∈ l),
list: T List,
uall: ∀[x:A]. B[x],
member: t ∈ T,
set: {x:A| B[x]} ,
function: x:A ⟶ B[x]
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
id-graph: Graph(S),
graph-rcvs: graph-rcvs(S;G;a;b;j),
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s],
all: ∀x:A. B[x],
subtype_rel: A ⊆r B,
uimplies: b supposing a
Latex:
\mforall{}[S:Id List]. \mforall{}[G:Graph(S)]. \mforall{}[a:Id {}\mrightarrow{} Id {}\mrightarrow{} Id]. \mforall{}[b:Id]. \mforall{}[j:\{j:Id| (j \mmember{} S)\} ].
(graph-rcvs(S;G;a;b;j) \mmember{} Knd List)
Date html generated:
2016_05_16-AM-10_59_11
Last ObjectModification:
2015_12_29-AM-09_10_05
Theory : event-ordering
Home
Index