Nuprl Lemma : lg-remove_wf
[T:Type]. [g:LabeledGraph(T)]. [x:
]. (lg-remove(g;x) 
LabeledGraph(T))
Proof not projected
Definitions occuring in Statement :
lg-remove: lg-remove(g;n),
labeled-graph: LabeledGraph(T),
nat: ,
uall: [x:A]. B[x],
member: t T,
universe: Type
Definitions :
implies: P 
Q,
all: x:A. B[x],
top: Top,
lg-remove: lg-remove(g;n),
member: t T,
labeled-graph: LabeledGraph(T),
uall: [x:A]. B[x],
ycomb: Y,
length: ||as||,
iff: P 
Q,
rev_implies: P Q,
false: False,
not: 
A,
int_iseg: {i...j},
bfalse: ff,
and: P 
Q,
prop: 
,
btrue: tt,
le: A 
B,
ifthenelse: if b then t else f fi ,
nat: ,
spreadn: spread3,
int_seg: {i..j
},
lelt: i j < k,
guard: {T},
uimplies: b supposing a,
sq_type: SQType(T),
unit: Unit,
bool: 
,
uiff: uiff(P;Q),
it: 
Lemmas :
labeled-graph_wf,
nat_wf,
nth_tl_wf,
firstn_wf,
append_wf,
map_wf,
top_wf,
int_subtype_base,
subtype_base_sq,
length-append,
length-map-sq,
nth_tl_is_nil,
firstn_all,
length_nth_tl,
length_firstn,
add_functionality_wrt_eq,
assert_of_le_int,
bnot_of_lt_int,
assert_functionality_wrt_uiff,
eqff_to_assert,
bnot_wf,
le_int_wf,
le_wf,
assert_of_lt_int,
eqtt_to_assert,
assert_wf,
uiff_transitivity,
iff_weakening_uiff,
bool_wf,
length_wf,
lt_int_wf,
ifthenelse_wf,
int_seg_wf,
equal_wf,
less_than_wf,
filter_type,
eq_int_wf,
not_wf,
assert_of_bnot,
not_functionality_wrt_uiff,
assert_of_eq_int,
bnot_of_le_int,
lelt_wf,
filter_wf
\mforall{}[T:Type]. \mforall{}[g:LabeledGraph(T)]. \mforall{}[x:\mBbbN{}]. (lg-remove(g;x) \mmember{} LabeledGraph(T))
Date html generated:
2012_01_23-PM-12_36_41
Last ObjectModification:
2012_01_05-PM-02_48_28
Home
Index