Nuprl Lemma : lg-remove_wf
∀[T:Type]. ∀[g:LabeledGraph(T)]. ∀[x:ℕ]. (lg-remove(g;x) ∈ LabeledGraph(T))
Proof
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
Lemmas :
map_wf,
list_wf,
int_seg_wf,
nat_wf,
le_int_wf,
bool_wf,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
assert-bnot,
assert_of_le_int,
le_wf,
subtract_wf,
filter_wf5,
subtype_rel_list,
l_member_wf,
bnot_wf,
eq_int_wf,
append_wf,
firstn_wf,
nth_tl_wf,
top_wf,
int_subtype_base,
map-length,
length-append,
lt_int_wf,
length_wf,
eqtt_to_assert,
assert_of_lt_int,
less_than_wf,
sq_stable__le,
le_weakening2,
decidable__le,
false_wf,
not-le-2,
condition-implies-le,
minus-add,
minus-one-mul,
zero-add,
add-associates,
add-swap,
add-commutes,
add_functionality_wrt_le,
add-zero,
le-add-cancel,
less-iff-le,
le-add-cancel2,
add-mul-special,
zero-mul,
add_functionality_wrt_eq,
length_firstn,
length_nth_tl,
iff_weakening_equal,
firstn_all,
nth_tl_is_nil,
length_of_nil_lemma,
assert_wf,
lelt_wf,
minus-minus,
decidable__lt,
le-add-cancel-alt,
not_wf,
equal-wf-base-T,
filter_wf3,
iff_transitivity,
iff_weakening_uiff,
assert_of_bnot,
assert_of_eq_int
Latex:
\mforall{}[T:Type]. \mforall{}[g:LabeledGraph(T)]. \mforall{}[x:\mBbbN{}]. (lg-remove(g;x) \mmember{} LabeledGraph(T))
Date html generated:
2015_07_22-PM-00_28_10
Last ObjectModification:
2015_02_04-PM-04_03_59
Home
Index