Nuprl Theory bool

(only non hidden objects are presented)

COMbool_ancestorsmin
DISPb_exists_unique_dfb_exists_unique(<'a:'a:*><x:var>.<p:p:*>) == b_exists_unique(<'a><x>.<p>)
ABSb_exists_uniqueb_exists_unique('a;x.p[x]) == (x:'a. p[x]) (x,y:'a. (p[x] p[y]) (x = y))
THMb_exists_unique_wf'a:. p:'a . b_exists_unique('a;x.p[x])
THMassert_of_b_exists_unique'a:. p:'a . b_exists_unique('a;x.p[x]) (x:'a. p[x]) (x,y:'a. p[x] p[y] x = y)
MLassert_of_b_exists_unique_mladd_lemma_simp `assert_of_b_exists_unique` ;;
DISPone_one_dfone_one(<'a:'a:*><'b:'b:*><f:f:*>)== one_one(<'a><'b><f>)
ABSone_oneone_one('a;'b;f) == x,y:'a. f x = f y x = y
THMone_one_wf'a,'b:. f:'a 'b. one_one('a;'b;f)
DISPonto_dfonto(<'a:'a:*><'b:'b:*><f:f:*>)== onto(<'a><'b><f>)
ABSontoonto('a;'b;f) == y:'b. x:'a. y = f x
THMonto_wf'a,'b:. f:'a 'b. onto('a;'b;f)
COMbool_Nuprl_defs--------------
COMbool_Nuprl_aux--------------
COMbool_HOL_type_defs--------------
COMbool_HOL_const_defs--------------
DISPhexists_dfexists== exists
ABShexistsexists == p:'a . x:'a. p x
MLhexists_mladd_to_simpset `hol_to_nuprl` (hdef_to_simp "hexists");; add_info `di rect_old_hdef` `hexists`;;
DISPht_dft== t
ABShtt == tt
MLht_mladd_to_simpset `hol_to_nuprl` (hdef_to_simp "ht");; add_info `direct_ old_hdef` `ht`;;
DISPhall_dfall== all
ABShallall == p:'a . x:'a. p x
MLhall_mladd_to_simpset `hol_to_nuprl` (hdef_to_simp "hall");; add_info `direc t_old_hdef` `hall`;;
DISPhand_dfand== and
ABShandand == p:. q:. p q
MLhand_mladd_to_simpset `hol_to_nuprl` (hdef_to_simp "hand");; add_info `direc t_old_hdef` `hand`;;
DISPhor_dfor== or
ABShoror == p:. q:. p q
MLhor_mladd_to_simpset `hol_to_nuprl` (hdef_to_simp "hor");; add_info `direct _old_hdef` `hor`;;
DISPhf_dff== f
ABShff == ff
MLhf_mladd_to_simpset `hol_to_nuprl` (hdef_to_simp "hf");; add_info `direct_ old_hdef` `hf`;;
DISPhnot_dfnot== not
ABShnotnot == p:. p
MLhnot_mladd_to_simpset `hol_to_nuprl` (hdef_to_simp "hnot");; add_info `direc t_old_hdef` `hnot`;;
DISPhexists_unique_dfexists_unique== exists_unique
ABShexists_uniqueexists_unique == p:'a . b_exists_unique('a;x.p x)
MLhexists_unique_mladd_to_simpset `hol_to_nuprl` (hdef_to_simp "hexists_unique");; add_i nfo `direct_new_hdef` `hexists_unique`;;
DISPhlet_dflet== let
ABShletlet == f:'a 'b. e:'a. let x = e in f x)
MLhlet_mladd_to_simpset `hol_to_nuprl` (hdef_to_simp "hlet");; add_info `direc t_old_hdef` `hlet`;;
DISPhcond_dfcond== cond
ABShcondcond == b:. p:'a. q:'a. if b then p else q fi
MLhcond_mladd_to_simpset `hol_to_nuprl` (hdef_to_simp "hcond");; add_info `dire ct_old_hdef` `hcond`;;
DISPhone_one_dfone_one== one_one
ABShone_oneone_one == f:'a 'b. one_one('a;'b;f)
MLhone_one_mladd_to_simpset `hol_to_nuprl` (hdef_to_simp "hone_one");; add_info `d irect_new_hdef` `hone_one`;;
DISPhonto_dfonto== onto
ABShontoonto == f:'a 'b. onto('a;'b;f)
MLhonto_mladd_to_simpset `hol_to_nuprl` (hdef_to_simp "honto");; add_info `dire ct_new_hdef` `honto`;;
DISPhtype_definition_dftype_definition== type_definition
ABShtype_definitiontype_definition == P:'a . rep:'b 'a. type_definition('a;'b;P;rep)
MLhtype_definition_mladd_to_simpset `hol_to_nuprl` (hdef_to_simp "htype_definition");; add _info `direct_new_hdef` `htype_definition`;;
COMbool_HOL_obligations--------------
THMhexists_wf'a:S. exists ('a hbool{}) hbool{}
THMht_wft hbool{}
THMhall_wf'a:S. all ('a hbool{}) hbool{}
THMhand_wfand hbool{} hbool{} hbool{}
THMhor_wfor hbool{} hbool{} hbool{}
THMhf_wff hbool{}
THMhnot_wfnot hbool{} hbool{}
THMhexists_unique_wf'a:S. exists_unique ('a hbool{}) hbool{}
THMhlet_wf'a,'b:S. let ('a 'b) 'a 'b
THMhcond_wf'a:S. cond hbool{} 'a 'a 'a
THMhone_one_wf'a,'b:S. one_one ('a 'b) hbool{}
THMhonto_wf'a,'b:S. onto ('a 'b) hbool{}
THMhtype_definition_wf'a,'b:S. type_definition ('a hbool{}) ('b 'a) hbool{}
THMhexists_def'a:S. (equal exists (P:'a hbool{}. P (select P)))
THMhtruth(equal t (equal (x:hbool{}. x) (x:hbool{}. x)))
THMhforall_def'a:S. (equal all (P:'a hbool{}. equal P (x:'a. t)))
THMhand_def(equal and (t1:hbool{}. t2:hbool{}. all (t:hbool{}. implies (implies t1 (implies t2 t)) t)))
THMhor_def(equal or (t1:hbool{}. t2:hbool{}. all (t:hbool{}. implies (implies t1 t) (implies (implies t2 t) t))))
THMhf_def(equal f (all (t:hbool{}. t)))
THMhnot_def(equal not (t:hbool{}. implies t f))
THMhexists_unique_def'a:S (equal exists_unique (P:'a hbool{}. and (exists P) (all (x:'a. all (y:'a. implies (and (P x) (P y)) (equal x y))))))
THMhlet_def'b,'a:S. (equal let (f:'a 'b. x:'a. f x))
THMhcond_def'a:S (equal cond (t:hbool{}. t1:'a. t2:'a. select (x:'a. and (implies (equal t t) (equal x t1)) (implies (equal t f) (equal x t2)))))
THMhone_one_def'b,'a:S. (all (f:'a 'b. equal (one_one f) (all (x1:'a. all (x2:'a. implies (equal (f x1) (f x2)) (equal x1 x2))))))
THMhonto_def'a,'b:S. (all (f:'a 'b. equal (onto f) (all (y:'b. exists (x:'a. equal y (f x))))))
THMhtype_definition_wd'b,'a:S. (all (P:'a hbool{}. all (rep:'b 'a. equal (type_definition P rep) (and (all (x':'b. all (x'':'b. implies (equal (rep x') (rep x'')) (equal x' x'')))) (all (x:'a. equal (P x) (exists (x':'b. equal x (rep x')))))))))
THMhbool_cases_ax(all (t:hbool{}. or (equal t t) (equal t f)))
THMhimp_antisym_ax(all (t1:hbool{}. all (t2:hbool{}. implies (implies t1 t2) (implies (implies t2 t1) (equal t1 t2)))))
THMheta_ax'b,'a:S. (all (t:'a 'b. equal (x:'a. t x) t))
THMhselect_ax'a:S (all (P:'a hbool{}. all (x:'a. implies (P x) (P (select P)))))
THMhinfinity_ax(exists (f:hind{} hind{}. and (one_one f) (not (onto f))))
COMbool_HOL_theorems--------------
COMbool_Nuprl_theorems--------------
COMbool_additional_theorems-----------------
THMband_simp_1b:. b tt = b
THMbor_simp_1b:. b tt = tt
THMbor_simp_2b:. b ff = b
THMbor_simp_3b:. tt b = tt
THMbor_simp_4b:. ff b = b
THMband_simp_4b:. ff b = ff
THMband_simp_3b:. tt b = b
THMband_simp_2b:. b ff = ff
THMbnot_simp_1tt = ff
THMbnot_simp_2ff = tt
THMbequal_refl_simp'a:S. x:'a. x = x = tt
THMequal_btrue_to_assertp:. p = tt p
THMequal_btrue_to_assert_2p:. tt = p p
THMequal_bfalse_to_assertp:. p = ff p
THMequal_bfalse_to_assert_2p:. ff = p p
MLbool_simps_mlmap 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 `` ;;
THMbexists_btrue'a:S. x:'a. tt = tt
THMbexists_bfalse'a:S. x:'a. ff = ff
THMball_btrue'a:S. x:'a. tt = tt
THMball_bfalse'a:S. x:'a. ff = ff
MLbool_simpsetmap (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 ff b t or fo_matches tt b t) ;unfold_top_if_simp `band` (\t. fo_matches ff b t or fo_matches tt b t) ;unfold_top_if_simp `bnot` (\t. fo_matches tt t or fo_matches ff t) ] ) ;;
MLassert_of_hlogic_simpsetmap (add_to_simpset `assert_of_hlogic`) [pattern_unfold_op_simp `assert_of_hall` `hall` [(all P)] ;pattern_unfold_op_simp `assert_of_hexists` `hexists` [(exists P)] ;pattern_unfold_op_simp `assert_of_hand` `hand` [(and p q)] ;pattern_unfold_op_simp `assert_of_hor` `hor` [(or p q)] ;pattern_unfold_op_simp `assert_of_himplies` `himplies` [(implies p q)] ;pattern_unfold_op_simp `assert_of_hnot` `hnot` [(not p)] ;pattern_unfold_op_simp `assert_of_hequal` `hequal` [(equal a b)] ]

the other theories