(only non hidden objects are presented)
| COM | bool_ancestors | min |
| DISP | b_exists_unique_df | b_exists_unique(<'a:'a:*><x:var>.<p:p:*>) == b_exists_unique(<'a><x>.<p>) |
| ABS | b_exists_unique | b_exists_unique('a;x.p[x]) ==
( |
| THM | b_exists_unique_wf | |
| THM | assert_of_b_exists_unique | |
| ML | assert_of_b_exists_unique_ml | add_lemma_simp `assert_of_b_exists_unique` ;; |
| DISP | one_one_df | one_one(<'a:'a:*><'b:'b:*><f:f:*>)== one_one(<'a><'b><f>) |
| ABS | one_one | one_one('a;'b;f) == |
| THM | one_one_wf | |
| DISP | onto_df | onto(<'a:'a:*><'b:'b:*><f:f:*>)== onto(<'a><'b><f>) |
| ABS | onto | onto('a;'b;f) == |
| THM | onto_wf | |
| COM | bool_Nuprl_defs | -------------- |
| COM | bool_Nuprl_aux | -------------- |
| COM | bool_HOL_type_defs | -------------- |
| COM | bool_HOL_const_defs | -------------- |
| DISP | hexists_df | exists== exists |
| ABS | hexists | exists == |
| ML | hexists_ml | add_to_simpset `hol_to_nuprl` (hdef_to_simp "hexists");; add_info `di rect_old_hdef` `hexists`;; |
| DISP | ht_df | t== t |
| ABS | ht | t == tt |
| ML | ht_ml | add_to_simpset `hol_to_nuprl` (hdef_to_simp "ht");; add_info `direct_ old_hdef` `ht`;; |
| DISP | hall_df | all== all |
| ABS | hall | all == |
| ML | hall_ml | add_to_simpset `hol_to_nuprl` (hdef_to_simp "hall");; add_info `direc t_old_hdef` `hall`;; |
| DISP | hand_df | and== and |
| ABS | hand | and == |
| ML | hand_ml | add_to_simpset `hol_to_nuprl` (hdef_to_simp "hand");; add_info `direc t_old_hdef` `hand`;; |
| DISP | hor_df | or== or |
| ABS | hor | or == |
| ML | hor_ml | add_to_simpset `hol_to_nuprl` (hdef_to_simp "hor");; add_info `direct _old_hdef` `hor`;; |
| DISP | hf_df | f== f |
| ABS | hf | f == ff |
| ML | hf_ml | add_to_simpset `hol_to_nuprl` (hdef_to_simp "hf");; add_info `direct_ old_hdef` `hf`;; |
| DISP | hnot_df | not== not |
| ABS | hnot | not == |
| ML | hnot_ml | add_to_simpset `hol_to_nuprl` (hdef_to_simp "hnot");; add_info `direc t_old_hdef` `hnot`;; |
| DISP | hexists_unique_df | exists_unique== exists_unique |
| ABS | hexists_unique | exists_unique == |
| ML | hexists_unique_ml | add_to_simpset `hol_to_nuprl` (hdef_to_simp "hexists_unique");; add_i nfo `direct_new_hdef` `hexists_unique`;; |
| DISP | hlet_df | let== let |
| ABS | hlet | let == |
| ML | hlet_ml | add_to_simpset `hol_to_nuprl` (hdef_to_simp "hlet");; add_info `direc t_old_hdef` `hlet`;; |
| DISP | hcond_df | cond== cond |
| ABS | hcond | cond == |
| ML | hcond_ml | add_to_simpset `hol_to_nuprl` (hdef_to_simp "hcond");; add_info `dire ct_old_hdef` `hcond`;; |
| DISP | hone_one_df | one_one== one_one |
| ABS | hone_one | one_one == |
| ML | hone_one_ml | add_to_simpset `hol_to_nuprl` (hdef_to_simp "hone_one");; add_info `d irect_new_hdef` `hone_one`;; |
| DISP | honto_df | onto== onto |
| ABS | honto | onto == |
| ML | honto_ml | add_to_simpset `hol_to_nuprl` (hdef_to_simp "honto");; add_info `dire ct_new_hdef` `honto`;; |
| DISP | htype_definition_df | type_definition== type_definition |
| ABS | htype_definition | type_definition ==
|
| ML | htype_definition_ml | add_to_simpset `hol_to_nuprl` (hdef_to_simp "htype_definition");; add _info `direct_new_hdef` `htype_definition`;; |
| COM | bool_HOL_obligations | -------------- |
| THM | hexists_wf | |
| THM | ht_wf | t |
| THM | hall_wf | |
| THM | hand_wf | and |
| THM | hor_wf | or |
| THM | hf_wf | f |
| THM | hnot_wf | not |
| THM | hexists_unique_wf | |
| THM | hlet_wf | |
| THM | hcond_wf | |
| THM | hone_one_wf | |
| THM | honto_wf | |
| THM | htype_definition_wf | |
| THM | hexists_def | |
| THM | htruth | |
| THM | hforall_def | |
| THM | hand_def | |
| THM | hor_def | |
| THM | hf_def | |
| THM | hnot_def | |
| THM | hexists_unique_def | |
| THM | hlet_def | |
| THM | hcond_def | |
| THM | hone_one_def | |
| THM | honto_def | |
| THM | htype_definition_wd | |
| THM | hbool_cases_ax | |
| THM | himp_antisym_ax | |
| THM | heta_ax | |
| THM | hselect_ax | |
| THM | hinfinity_ax | |
| COM | bool_HOL_theorems | -------------- |
| COM | bool_Nuprl_theorems | -------------- |
| COM | bool_additional_theorems | ----------------- |
| THM | band_simp_1 | |
| THM | bor_simp_1 | |
| THM | bor_simp_2 | |
| THM | bor_simp_3 | |
| THM | bor_simp_4 | |
| THM | band_simp_4 | |
| THM | band_simp_3 | |
| THM | band_simp_2 | |
| THM | bnot_simp_1 | |
| THM | bnot_simp_2 | |
| THM | bequal_refl_simp | |
| THM | equal_btrue_to_assert | |
| THM | equal_btrue_to_assert_2 | |
| THM | equal_bfalse_to_assert | |
| THM | equal_bfalse_to_assert_2 | |
| ML | bool_simps_ml | map add_lemma_simp ``band_simp_1 band_simp_2 band_simp_3 band_simp_4 bor_simp_1 bor_simp_2 bor_simp_3 bor_simp_4 bnot_simp_1 bnot_simp_2 bequal_refl_simp equal_btrue_to_assert equal_btrue_to_assert_2 equal_bfalse_to_assert equal_bfalse_to_assert_2 not_true not_false `` ;; |
| THM | bexists_btrue | |
| THM | bexists_bfalse | |
| THM | ball_btrue | |
| THM | ball_bfalse | |
| ML | bool_simpset | map (add_to_simpset `bool`)
( map lemma_to_simp
``band_simp_1 bor_simp_1 bor_simp_2 band_simp_2``
@ map bogus_simp
``bor_simp_3 bor_simp_4 band_simp_3 band_simp_4
bnot_simp_1 bnot_simp_2``
@ map lemma_to_simp
``bequal_refl_simp
equal_btrue_to_assert equal_btrue_to_assert_2
equal_bfalse_to_assert equal_bfalse_to_assert_2``
@ [unfold_top_if_simp `bor`
(\t. fo_matches |
| ML | assert_of_hlogic_simpset | map (add_to_simpset `assert_of_hlogic`)
[pattern_unfold_op_simp `assert_of_hall` `hall` [ |