is mentioned by
[exist_intseg_vs_iter_or] | |
[exist_intseg_null] | |
Thm* a<b ((i:{a..b}. P(i)) (i:{a..(b-1)}. P(i)) P(b-1)) | [or_via_exist_intseg_split_last] |
Thm* a<b Thm* Thm* (c:. b = c+1 ((i:{a..b}. P(i)) (i:{a..c}. P(i)) P(c))) | [or_via_exist_intseg_notnull] |
[all_intseg_vs_iter_and] | |
Thm* a<b ((i:{a..b}. P(i)) (i:{a..(b-1)}. P(i)) & P(b-1)) | [and_via_all_intseg_split_last] |
Thm* a<b Thm* Thm* (c:. b = c+1 ((i:{a..b}. P(i)) (i:{a..c}. P(i)) & P(c))) | [and_via_all_intseg_notnull] |
Thm* (a:, b:{...a}. P(a,b)) Thm* Thm* (a:, b:{a+1...}. (c:{a..b}. P(a,c)) P(a,b)) (a,b:. P(a,b)) | [all_int_segs_by_upper_ind] |
Thm* (b:{...a}. P(a,b)) Thm* Thm* (b:{a+1...}. (c:{a..b}. P(a,c)) P(a,b)) (b:. P(a,b)) | [int_segs_from_base_by_upper_ind] |
Thm* (b:{...a}. P(a,a) P(a,b)) (b:{a...}. P(a,b)) (b:. P(a,b)) | [split_int_domain_by_norm_lower] |
Thm* (b:{a...}. (c:{a..b}. P(a,c)) P(a,b)) (b:{a...}. P(a,b)) | [int_seg_upper_ind] |
Thm* (a:, b:{...a}. P(a,b)) Thm* Thm* (a:. (b:{...a}. P(a,b)) (b:{a...}. P(a,b))) (a,b:. P(a,b)) | [all_int_pairs_via_all_splits] |
Thm* (b:{...a}. P(a,b)) Thm* Thm* ((b:{...a}. P(a,b)) (b:{a...}. P(a,b))) (b:. P(a,b)) | [split_int_domain] |
[is_commutative_sep_wf] | |
[is_commutative_wf] | |
[is_assoc_sep_wf] | |
[is_ident_wf] |
In prior sections: core well fnd int 1 bool 1 rel 1 quot 1 LogicSupplement int 2
Try larger context:
DiscrMathExt
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html