Nuprl Lemma : remove-nat-missing_wf

[i:ℕ]. ∀[s:nat-missing-type()].  (remove-nat-missing(i;s) ∈ nat-missing-type())


Proof




Definitions occuring in Statement :  remove-nat-missing: remove-nat-missing(i;s) nat-missing-type: nat-missing-type() nat: uall: [x:A]. B[x] member: t ∈ T
Lemmas :  value-type-has-value nat_wf set-value-type le_wf int-value-type last_wf assert_of_null assert_wf null_wf3 subtype_rel_list top_wf not_wf equal-wf-T-base list_wf eq_int_wf subtract_wf bool_wf eqtt_to_assert assert_of_eq_int eqff_to_assert equal_wf bool_cases_sqequal subtype_base_sq bool_subtype_base assert-bnot neg_assert_of_eq_int l_member_wf all_wf less_than_wf select-last-in-nat-missing_wf l-ordered_wf subtype_rel_sets set_wf filter_wf5 lt_int_wf l-ordered-filter l_all_iff member_filter_2 assert_of_lt_int l_all_wf2 decidable__le false_wf not-le-2 not-equal-2 sq_stable__le le_antisymmetry_iff condition-implies-le minus-one-mul minus-add minus-minus add-associates add-swap add-commutes add_functionality_wrt_le add-zero le-add-cancel-alt last_member decidable__equal_nat length_wf less-iff-le zero-add le-add-cancel decidable__lt select_wf squash_wf iff_weakening_equal length_of_cons_lemma length_of_nil_lemma lelt_wf subtract-is-less int_seg_wf nil_wf minus-zero le-add-cancel2 decidable__equal_int int_subtype_base zero-le-nat list-cases null_nil_lemma stuck-spread base_wf product_subtype_list null_cons_lemma increasing_wf subtype_rel_dep_function cons_wf length_nil non_neg_length length_wf_nil length_cons length_wf_nat int_seg_subtype-nat l-ordered-is-sorted-by insert-combine_wf int-minus-comparison-inc_wf insert-combine-sorted-by l-ordered-eq-rels iff_wf sorted-by-eq-rels comparison_wf member-insert-combine l_exists_iff
\mforall{}[i:\mBbbN{}].  \mforall{}[s:nat-missing-type()].    (remove-nat-missing(i;s)  \mmember{}  nat-missing-type())



Date html generated: 2015_07_17-AM-08_21_47
Last ObjectModification: 2015_04_02-PM-05_43_27

Home Index