Nuprl Lemma : graph-rcvs_wf2
[S:Id List]. [G:Graph(S)]. [a:Id 
Id Id]. [b:Id]. [j:{j:Id| (j 
S)} ].
(graph-rcvs(S;G;a;b;j) {k:Knd| 
hasloc(k;j)} List)
Proof not projected
Definitions occuring in Statement :
hasloc: hasloc(k;i),
graph-rcvs: graph-rcvs(S;G;a;b;j),
id-graph: Graph(S),
Knd: Knd,
Id: Id,
assert: b,
uall: [x:A]. B[x],
member: t T,
set: {x:A| B[x]} ,
function: x:A B[x],
list: type List,
l_member: (x l)
Definitions :
so_lambda: 
x.t[x],
implies: P 
Q,
all: x:A. B[x],
prop: 
,
member: t T,
uall: [x:A]. B[x],
IdLnk: IdLnk,
Knd: Knd,
Id: Id,
guard: {T},
ifthenelse: if b then t else f fi ,
btrue: tt,
band: p 
q,
hasloc: hasloc(k;i),
not: 
A,
so_apply: x[s],
uimplies: b supposing a,
sq_type: SQType(T),
iff: P 
Q,
and: P Q,
exists: 
x:A. B[x],
uiff: uiff(P;Q),
rev_uimplies: rev_uimplies(P;Q),
false: False
Lemmas :
subtype_rel_self,
subtype_rel_list_set,
hasloc_wf,
assert_wf,
id-graph_wf,
Id_wf,
equal_wf,
l_member_wf,
graph-rcvs_wf,
Knd_wf,
list-subtype,
atom2_subtype_base,
product_subtype_base,
IdLnk_wf,
union_subtype_base,
subtype_base_sq,
member-graph-rcvs,
assert-eq-id,
not_functionality_wrt_uiff,
assert_of_bnot,
uiff_transitivity,
not_wf,
eq_id_wf,
bnot_wf,
member_wf
\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{} \{k:Knd| \muparrow{}hasloc(k;j)\} List)
Date html generated:
2012_01_23-AM-11_53_17
Last ObjectModification:
2011_12_09-PM-07_33_06
Home
Index