is mentioned by
[prime_among_factors] | |
[prime_nat_divby_self_only] | |
[no_prime_divs_one_b] | |
[no_prime_divs_one] | |
[no_nat_prime_divs_one] | |
[prime_decider_wf] | |
[prime_decider_exists] | |
[decidable__prime] | |
[prime_neg] | |
[prime_or_smaller_prime_factor] | |
[prime_or_smaller_prime_factor2] | |
[composite_with_prime_factor] | |
[nonprime_nat] | |
[natprime_nondivs] | |
[natprimes_lb] | |
[prime_nat] | |
[div_inverts_nat_mul2] | |
[div_inverts_nat_mul] | |
[only_one_nat_divs_one] | |
[divides_def_on_nat] | |
[mul_nat_plus] | |
[factors_smaller2] | |
[factors_smaller] | |
[factor_smaller2] | |
[factor_smaller] | |
[pos_mul_arg_boundsNat2] | |
[pos_mul_arg_boundsNat] | |
[factors_bound] | |
[lt_mul_rt_by_pos] | |
[factor_bound] | |
[le_mul_rt_by_pos] | |
[mul_cancel_in_eq2] | |
[mul_cancel_in_eq1] | |
[nat_factor_cancel_rw] | |
[mul_nat_com] | |
[prod_zero_iff_factor_zero] | |
[nat_prod_one_iff_factors_one] |
In prior sections: core well fnd int 1 bool 1 rel 1 quot 1 LogicSupplement int 2 union num thy 1
Try larger context:
DiscrMathExt
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html