@ceccec/millennium-solutions 9.2.8 → 9.2.9

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (14) hide show
  1. package/ACCOUNTING.md +6 -6
  2. package/AXIOMS.md +4 -4
  3. package/CHALLENGES.md +33 -3
  4. package/PRIOR-ART.md +5 -5
  5. package/README.md +20 -20
  6. package/dashboard.md +1 -1
  7. package/forensic.md +4 -4
  8. package/index.md +20 -20
  9. package/package.json +1 -1
  10. package/paper.md +309 -187
  11. package/speedup.md +4 -4
  12. package/src/proof/discovered.json +75 -0
  13. package/src/proof/nim.lean +209 -3
  14. package/src/proof/trial-all.json +90 -0
package/paper.md CHANGED
@@ -8,32 +8,32 @@ aside: false
8
8
  <div class="paper-masthead">
9
9
  <h1 class="paper-title">The collected theorems of the ℤ/9 vortex framework</h1>
10
10
  <div class="paper-byline">Rouschev, T. · <em>Millennium Solutions</em> · DOI <a href="https://doi.org/10.5281/zenodo.21819217">10.5281/zenodo.21819217</a> · CC BY-NC-ND 4.0</div>
11
- <div class="paper-addr">625 theorems by exhaustion + 70 proved for every value + 9 rfl declarations · 33 sources · content-address <code>3680c9e0-1802-8af6-9eb8-a5e1edda1e62</code></div>
11
+ <div class="paper-addr">625 theorems by exhaustion + 85 proved for every value + 9 rfl declarations · 33 sources · content-address <code>e0a7e304-f6df-82ce-a29c-23cc8cced5db</code></div>
12
12
  </div>
13
13
 
14
14
  <h2 class="paper-h">Abstract</h2>
15
15
 
16
- This document collects the 704 declarations of the ℤ/9 vortex framework that the Lean 4 kernel accepts — 625 of them THEOREMS closing by exhaustion, 70 PROVED for every value, and 9 rfl declarations shown and marked as such, across 33 source files. Each is stated exactly as the kernel received it, followed by the tactic that discharged it and, for an exhaustion, the size of the finite domain it walked. Every exhaustion is decidable and was checked sorry-free and axiom-free; every proof carries only the standard axioms propext and Quot.sound, printed per file. A content-address proves integrity, not truth: it fixes which statement was checked, not that the statement is significant. <h2 class="paper-h">The size of what was checked</h2>
16
+ This document collects the 719 declarations of the ℤ/9 vortex framework that the Lean 4 kernel accepts — 625 of them THEOREMS closing by exhaustion, 85 PROVED for every value, and 9 rfl declarations shown and marked as such, across 33 source files. Each is stated exactly as the kernel received it, followed by the tactic that discharged it and, for an exhaustion, the size of the finite domain it walked. Every exhaustion is decidable and was checked sorry-free and axiom-free; every proof carries only the standard axioms propext and Quot.sound, printed per file. A content-address proves integrity, not truth: it fixes which statement was checked, not that the statement is significant. <h2 class="paper-h">The size of what was checked</h2>
17
17
 
18
- The domains sum to 156,871,620,425 cases, and that total should not be read as the weight of this work: **one theorem carries 97.257% of it**. The median theorem walks **9** cases, and **212** of 704 walk a single point — a check by evaluation, not by exhaustion. The honest summary is a distribution, not a sum, so it is drawn below rather than reported as one number.
18
+ The domains sum to 156,871,620,425 cases, and that total should not be read as the weight of this work: **one theorem carries 97.257% of it**. The median theorem walks **9** cases, and **212** of 719 walk a single point — a check by evaluation, not by exhaustion. The honest summary is a distribution, not a sum, so it is drawn below rather than reported as one number.
19
19
 
20
20
  <figure class="paper-fig">
21
- <svg viewBox="0 0 1203 466" role="img" class="fig" xmlns="http://www.w3.org/2000/svg" aria-label="every theorem placed by the size of the domain its proof exhausted"><title>Figure 1 — all 704 declarations by domain size</title><rect x="6.0" y="419.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>address_is_sixteen_bytes — 1 cases</title></rect><rect x="14.6" y="419.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>address_bytes_are_bytes — 1 cases</title></rect><rect x="23.2" y="419.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>version_nibble_is_forced — 1 cases</title></rect><rect x="31.8" y="419.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>variant_bits_are_forced — 1 cases</title></rect><rect x="40.4" y="419.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>addressing_is_deterministic — 1 cases</title></rect><rect x="49.0" y="419.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>distinct_seeds_give_distinct_addresses — 1 cases</title></rect><rect x="57.6" y="419.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>addressing_is_not_the_identity — 1 cases</title></rect><rect x="66.2" y="419.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>addressing_is_not_constant — 1 cases</title></rect><rect x="74.8" y="419.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_four_seeds_are_distinct — 1 cases</title></rect><rect x="6.0" y="410.6" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>address_settles_its_range — 1 cases</title></rect><rect x="14.6" y="410.6" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_address_is_order_sensitive — 4 cases</title></rect><rect x="23.2" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_reflection_is_an_involution — 1 cases</title></rect><rect x="31.8" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>one_side_is_reflected_onto_itself — 1 cases</title></rect><rect x="40.4" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_other_two_swap — 1 cases</title></rect><rect x="49.0" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>exactly_one_digit_is_unmoved — 1 cases</title></rect><rect x="57.6" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>exactly_one_digit_reflects_out_of_range — 1 cases</title></rect><rect x="66.2" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_classes_partition_the_nine — 1 cases</title></rect><rect x="74.8" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>every_digit_is_sorted_exactly_once — 1 cases</title></rect><rect x="6.0" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_fall_fixes_every_digit_but_the_void — 1 cases</title></rect><rect x="14.6" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_fall_and_the_reflection_share_one_exceptional_digit — 1 cases</title></rect><rect x="23.2" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>on_the_fixed_points_the_reflection_never_leaves — 1 cases</title></rect><rect x="31.8" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>what_escapes_falls_back_inside — 1 cases</title></rect><rect x="40.4" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_nines_complement_pairs_the_ten_digits — 1 cases</title></rect><rect x="49.0" y="402.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>factorial_seven_is_five_thousand_and_forty — 1 cases</title></rect><rect x="57.6" y="402.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>mantels_bound_is_n_squared_over_four_for_every_n — 1 cases</title></rect><rect x="66.2" y="402.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>picks_theorem_holds_for_every_lattice_triangle_in_the_four_grid — 1 cases</title></rect><rect x="74.8" y="402.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_latin_squares_of_order_four_number_five_hundred_and_seventy_six — 1 cases</title></rect><rect x="6.0" y="393.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_two_power_sums_are_one_sum — 1 cases</title></rect><rect x="14.6" y="393.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>nicomachus_sum_of_cubes_is_the_square_of_the_triangular_number_for_every_n — 1 cases</title></rect><rect x="23.2" y="393.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_sum_of_fifth_powers_has_the_closed_form_for_every_n — 1 cases</title></rect><rect x="31.8" y="393.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_euler_characteristic_of_a_genus_g_surface_for_every_g — 1 cases</title></rect><rect x="40.4" y="393.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>a_repunit_has_the_residue_of_its_length_mod_three — 1 cases</title></rect><rect x="49.0" y="393.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>a_repunit_is_divisible_by_three_exactly_when_its_length_is_for_every_n — 1 cases</title></rect><rect x="57.6" y="393.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>repunit_of_a_sum — 1 cases</title></rect><rect x="66.2" y="393.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>repunits_repeat_mod_seven_every_six_digits — 1 cases</title></rect><rect x="74.8" y="393.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>a_repunit_has_the_residue_of_its_length_mod_six_mod_seven — 1 cases</title></rect><rect x="6.0" y="384.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>a_repunit_is_divisible_by_seven_exactly_when_six_divides_its_length_for_every_n — 1 cases</title></rect><rect x="14.6" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>euclids_form_is_perfect_at_every_mersenne_prime_to_seven — 4 cases</title></rect><rect x="23.2" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_mersenne_hypothesis_is_real_at_eleven — 1 cases</title></rect><rect x="31.8" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_amicable_pair_is_mutual_and_neither_is_perfect — 1 cases</title></rect><rect x="40.4" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_primitive_roots_mod_nine_are_exactly_two_and_five — 2 cases</title></rect><rect x="49.0" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_units_of_z9_form_three_pairs_summing_to_nine — 1 cases</title></rect><rect x="57.6" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_multiplication_table_of_the_z9_units_is_a_latin_square — 1 cases</title></rect><rect x="66.2" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>three_is_a_primitive_root_mod_seven_and_seven_is_six_plus_one — 7 cases</title></rect><rect x="74.8" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_z9_unit_group_splits_as_reflection_times_trinity — 1 cases</title></rect><rect x="6.0" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_inverse_map_permutes_the_units_and_is_an_involution — 1 cases</title></rect><rect x="14.6" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>consecutive_farey_neighbours_have_unit_determinant_and_bracket_their_mediant — 1 cases</title></rect><rect x="23.2" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_units_are_three_regular_under_doubling_halving_and_reflection — 1 cases</title></rect><rect x="31.8" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>a_knight_has_exactly_eight_leaps_and_every_one_flips_the_colour — 1 cases</title></rect><rect x="40.4" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_partition_and_bell_numbers_count_what_they_claim_to_count — 6 cases</title></rect><rect x="49.0" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_unit_graph_is_complete_bipartite_between_the_two_tetrahedra — 1 cases</title></rect><rect x="57.6" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>elementary_settles_its_range — 1 cases</title></rect><rect x="66.2" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_interior_and_exterior_angles_are_n_straight_angles_for_every_n — 1 cases</title></rect><rect x="74.8" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>a_product_of_consecutive_numbers_is_even — 1 cases</title></rect><rect x="6.0" y="367.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>eight_times_a_triangular_number_plus_one_is_an_odd_square_for_every_n — 1 cases</title></rect><rect x="14.6" y="367.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_lucas_numbers_are_the_sum_of_the_neighbouring_fibonaccis_for_every_n — 1 cases</title></rect><rect x="23.2" y="367.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_gases_are_two_to_one_and_consume_each_other_exactly — 1 cases</title></rect><rect x="31.8" y="367.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>one_litre_split_returns_one_litre_burnt — 1 cases</title></rect><rect x="40.4" y="367.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>only_oxy_hydrogen_burns_without_admitting_nitrogen — 1 cases</title></rect><rect x="49.0" y="367.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>splitting_then_burning_is_the_identity_at_every_ledger_value — 1 cases</title></rect><rect x="57.6" y="367.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>two_parts_in_three_is_two_thirds_at_every_scale_for_every_m — 1 cases</title></rect><rect x="66.2" y="367.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>flt_all_primes_under_thirty — 1 cases</title></rect><rect x="74.8" y="367.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>wilson_all_primes_under_thirty — 1 cases</title></rect><rect x="6.0" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>xor_is_parity_up_to_eight_bits — 8 cases</title></rect><rect x="14.6" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>nat_div_is_a_total_function_returning_zero_at_a_zero_divisor — 1 cases</title></rect><rect x="23.2" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>at_a_zero_divisor_the_identity_is_carried_by_the_remainder — 1 cases</title></rect><rect x="31.8" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>demorgan_holds_at_every_arity_to_eight — 7 cases</title></rect><rect x="40.4" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>multiplication_permutes_z9_at_exactly_the_units — 8 cases</title></rect><rect x="49.0" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>addition_generates_z9_at_exactly_the_units — 8 cases</title></rect><rect x="57.6" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>an_inverse_mod_nine_exists_at_exactly_the_units — 9 cases</title></rect><rect x="66.2" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_inverse_of_a_unit_mod_nine_is_its_fifth_power — 1 cases</title></rect><rect x="74.8" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>and_the_converse_fails_at_six — 1 cases</title></rect><rect x="6.0" y="350.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_order_of_every_unit_mod_nine_divides_six — 1 cases</title></rect><rect x="14.6" y="350.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>there_are_exactly_five_platonic_solids_and_each_satisfies_eulers_formula — 1 cases</title></rect><rect x="23.2" y="350.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_involutions_are_counted_by_the_telephone_numbers — 6 cases</title></rect><rect x="31.8" y="350.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>invOf_is_an_inverse_and_an_involution_on_the_units — 9 cases</title></rect><rect x="40.4" y="350.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>families_settle_their_ranges — 1 cases</title></rect><rect x="49.0" y="350.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_powers_of_two_sum_to_one_less_than_the_next_for_every_n — 1 cases</title></rect><rect x="57.6" y="350.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>square_of_successor — 1 cases</title></rect><rect x="66.2" y="350.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_first_n_odd_numbers_sum_to_n_squared_for_every_n — 1 cases</title></rect><rect x="74.8" y="350.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>cassinis_identity_for_every_m — 1 cases</title></rect><rect x="6.0" y="341.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>a_sum_over_one_to_n_plus_one_adds_the_last_term — 1 cases</title></rect><rect x="14.6" y="341.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_numbers_sum_to_their_closed_form_for_every_n — 1 cases</title></rect><rect x="23.2" y="341.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_squares_sum_to_their_closed_form_for_every_n — 1 cases</title></rect><rect x="31.8" y="341.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_cubes_sum_to_their_closed_form_for_every_n — 1 cases</title></rect><rect x="40.4" y="341.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_fourth_powers_sum_to_their_closed_form_for_every_n — 1 cases</title></rect><rect x="49.0" y="341.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_fifth_powers_sum_to_their_closed_form_for_every_n — 1 cases</title></rect><rect x="57.6" y="341.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>power_sums_match_their_closed_forms_for_every_n — 1 cases</title></rect><rect x="66.2" y="341.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_sums_of_triangular_numbers_are_the_tetrahedral_numbers_for_every_n — 1 cases</title></rect><rect x="74.8" y="341.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_doubling_flow_repeats_every_six_steps — 1 cases</title></rect><rect x="6.0" y="333.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_doubling_flow_is_its_first_six_steps — 1 cases</title></rect><rect x="14.6" y="333.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>navier_stokes_flow_is_bounded_for_every_step — 1 cases</title></rect><rect x="23.2" y="333.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>hash_a_seed_zero — 1 cases</title></rect><rect x="31.8" y="333.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>hash_ab_seed_zero — 2 cases</title></rect><rect x="40.4" y="333.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>hash_a_seed_golden — 1 cases</title></rect><rect x="49.0" y="333.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>hash_uuidna_seed_zero — 6 cases</title></rect><rect x="57.6" y="333.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>hash_is_not_the_identity — 1 cases</title></rect><rect x="66.2" y="333.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>hash_is_not_constant — 1 cases</title></rect><rect x="74.8" y="333.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>fnv_settles_its_range — 1 cases</title></rect><rect x="6.0" y="324.6" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_hash_is_order_sensitive — 4 cases</title></rect><rect x="14.6" y="324.6" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_empty_input_is_still_mixed — 1 cases</title></rect><rect x="23.2" y="324.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>demorgan_all_widths — 7 cases</title></rect><rect x="31.8" y="324.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>invpow_is_fifth_power_all_units — 6 cases</title></rect><rect x="40.4" y="324.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>cyclic_units_have_a_primitive_root — 6 cases</title></rect><rect x="49.0" y="324.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>decimal_period_is_the_order_of_ten — 8 cases</title></rect><rect x="57.6" y="324.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triad_is_closed_under_double — 9 cases</title></rect><rect x="66.2" y="324.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triad_is_closed_under_triple — 9 cases</title></rect><rect x="74.8" y="324.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triad_is_closed_under_quadruple — 9 cases</title></rect><rect x="6.0" y="316.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>tetA_is_closed_under_quadruple — 9 cases</title></rect><rect x="14.6" y="316.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>tetB_is_closed_under_quadruple — 9 cases</title></rect><rect x="23.2" y="316.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triad_is_closed_under_negate — 9 cases</title></rect><rect x="31.8" y="316.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>cubes_is_closed_under_negate — 9 cases</title></rect><rect x="40.4" y="316.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>tetA_is_closed_under_square — 9 cases</title></rect><rect x="49.0" y="316.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>cubes_is_closed_under_square — 9 cases</title></rect><rect x="57.6" y="316.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triad_is_closed_under_fourth — 9 cases</title></rect><rect x="66.2" y="316.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>tetA_is_closed_under_fourth — 9 cases</title></rect><rect x="74.8" y="316.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>cubes_is_closed_under_fourth — 9 cases</title></rect><rect x="6.0" y="307.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triad_is_closed_under_sixth — 9 cases</title></rect><rect x="14.6" y="307.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>tetA_is_closed_under_sixth — 9 cases</title></rect><rect x="23.2" y="307.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>cubes_is_closed_under_sixth — 9 cases</title></rect><rect x="31.8" y="307.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triad_is_closed_under_quintuple — 9 cases</title></rect><rect x="40.4" y="307.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triad_is_closed_under_sextuple — 9 cases</title></rect><rect x="49.0" y="307.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triad_is_closed_under_septuple — 9 cases</title></rect><rect x="57.6" y="307.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>tetA_is_closed_under_septuple — 9 cases</title></rect><rect x="66.2" y="307.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>tetB_is_closed_under_septuple — 9 cases</title></rect><rect x="74.8" y="307.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triad_is_closed_under_octuple — 9 cases</title></rect><rect x="6.0" y="298.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>cubes_is_closed_under_octuple — 9 cases</title></rect><rect x="14.6" y="298.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>double_is_involutive_on_triad — 3 cases</title></rect><rect x="23.2" y="298.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>quadruple_is_involutive_on_triad — 3 cases</title></rect><rect x="31.8" y="298.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>square_is_involutive_on_tetA — 3 cases</title></rect><rect x="40.4" y="298.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>square_is_involutive_on_squares — 4 cases</title></rect><rect x="49.0" y="298.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>cube_is_involutive_on_cubes — 3 cases</title></rect><rect x="57.6" y="298.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fourth_is_involutive_on_tetA — 3 cases</title></rect><rect x="66.2" y="298.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fourth_is_involutive_on_squares — 4 cases</title></rect><rect x="74.8" y="298.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fifth_is_involutive_on_units — 6 cases</title></rect><rect x="6.0" y="290.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fifth_is_involutive_on_orbit — 6 cases</title></rect><rect x="14.6" y="290.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fifth_is_involutive_on_tetA — 3 cases</title></rect><rect x="23.2" y="290.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fifth_is_involutive_on_tetB — 3 cases</title></rect><rect x="31.8" y="290.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fifth_is_involutive_on_squares — 4 cases</title></rect><rect x="40.4" y="290.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fifth_is_involutive_on_cubes — 3 cases</title></rect><rect x="49.0" y="290.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>quintuple_is_involutive_on_triad — 3 cases</title></rect><rect x="57.6" y="290.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>septuple_is_involutive_on_triad — 3 cases</title></rect><rect x="66.2" y="290.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triple_collapses_triad_to_one_value — 3 cases</title></rect><rect x="74.8" y="290.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triple_collapses_tetA_to_one_value — 3 cases</title></rect><rect x="6.0" y="281.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triple_collapses_tetB_to_one_value — 3 cases</title></rect><rect x="14.6" y="281.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>cube_collapses_triad_to_one_value — 3 cases</title></rect><rect x="23.2" y="281.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>cube_collapses_tetA_to_one_value — 3 cases</title></rect><rect x="31.8" y="281.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>cube_collapses_tetB_to_one_value — 3 cases</title></rect><rect x="40.4" y="281.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fourth_collapses_triad_to_one_value — 3 cases</title></rect><rect x="49.0" y="281.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fifth_collapses_triad_to_one_value — 3 cases</title></rect><rect x="57.6" y="281.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>sixth_collapses_units_to_one_value — 6 cases</title></rect><rect x="66.2" y="281.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>sixth_collapses_triad_to_one_value — 3 cases</title></rect><rect x="74.8" y="281.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>sixth_collapses_orbit_to_one_value — 6 cases</title></rect><rect x="6.0" y="273.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>sixth_collapses_tetA_to_one_value — 3 cases</title></rect><rect x="14.6" y="273.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>sixth_collapses_tetB_to_one_value — 3 cases</title></rect><rect x="23.2" y="273.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>sextuple_collapses_triad_to_one_value — 3 cases</title></rect><rect x="31.8" y="273.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>sextuple_collapses_tetA_to_one_value — 3 cases</title></rect><rect x="40.4" y="273.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>sextuple_collapses_tetB_to_one_value — 3 cases</title></rect><rect x="49.0" y="273.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>yang_mills_spectral_gap — 6 cases</title></rect><rect x="57.6" y="273.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>birch_swinnerton_dyer_vanishing — 9 cases</title></rect><rect x="66.2" y="273.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_sequence_is_its_named_parts_and_closes — 3 cases</title></rect><rect x="74.8" y="273.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>there_are_2620_involutions_of_nine — 1 cases</title></rect><rect x="6.0" y="264.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_fuel_was_not_the_limit — 1 cases</title></rect><rect x="14.6" y="264.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>every_involution_fixes_at_least_one_point — 1 cases</title></rect><rect x="23.2" y="264.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_fixed_points_are_always_odd — 1 cases</title></rect><rect x="31.8" y="264.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>no_single_point_is_fixed_by_all — 1 cases</title></rect><rect x="40.4" y="264.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_constant_sum_is_rare — 1 cases</title></rect><rect x="49.0" y="264.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>so_involutions_are_not_all_harmonic_in_that_sense — 1 cases</title></rect><rect x="57.6" y="264.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_coins_reflection_is_harmonic_and_is_one_of_the_ninety — 1 cases</title></rect><rect x="66.2" y="264.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>a_seal_is_128_bits — 1 cases</title></rect><rect x="74.8" y="264.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>membership_grows_by_one_seal_per_doubling — 1 cases</title></rect><rect x="6.0" y="255.8" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>membership_is_logarithmic_not_linear — 1 cases</title></rect><rect x="14.6" y="255.8" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_967_receipt_case — 1 cases</title></rect><rect x="23.2" y="255.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_si_fixes_seven_distinct_nonzero_constants — 1 cases</title></rect><rect x="31.8" y="255.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>travel_at_one_returns_the_defined_constant — 1 cases</title></rect><rect x="40.4" y="255.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_second_returns_from_the_metre_and_the_period_at_every_duration — 1 cases</title></rect><rect x="49.0" y="255.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>travel_and_periods_at_one_return_their_constants — 1 cases</title></rect><rect x="57.6" y="255.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_roots_of_the_seven — 7 cases</title></rect><rect x="66.2" y="255.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_root_moves_with_the_unit_so_it_is_not_about_light — 1 cases</title></rect><rect x="74.8" y="255.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_definitions_are_seven_and_travel_fixes_zero — 1 cases</title></rect><rect x="6.0" y="247.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_second_returns_from_the_metre_and_the_period_for_every_s — 1 cases</title></rect><rect x="14.6" y="247.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>bool_demorgan1 — 4 cases</title></rect><rect x="23.2" y="247.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>bool_demorgan2 — 4 cases</title></rect><rect x="31.8" y="247.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>bool_distributivity — 8 cases</title></rect><rect x="40.4" y="247.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>bool_absorption — 4 cases</title></rect><rect x="49.0" y="247.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>merkaba_cube_q3 — 1 cases</title></rect><rect x="57.6" y="247.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>cover_rotation_full_circle — 9 cases</title></rect><rect x="66.2" y="247.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>fib_trinity_horizon — 1 cases</title></rect><rect x="74.8" y="247.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>arts_nine_hues_distinct — 9 cases</title></rect><rect x="6.0" y="238.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>trial_units_group — 6 cases</title></rect><rect x="14.6" y="238.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>trial_zero_divisors — 1 cases</title></rect><rect x="23.2" y="238.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>trial_zero_no_inverse — 9 cases</title></rect><rect x="31.8" y="238.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>chess_diagonals_15 — 1 cases</title></rect><rect x="40.4" y="238.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>tarot_78_cards — 1 cases</title></rect><rect x="49.0" y="238.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>tarot_minor_4x14 — 1 cases</title></rect><rect x="57.6" y="238.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>tarot_digital_roots — 1 cases</title></rect><rect x="66.2" y="238.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>gf4_size — 4 cases</title></rect><rect x="74.8" y="238.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_digital_root — 6 cases</title></rect><rect x="6.0" y="230.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>harmonic_octave_2_1 — 1 cases</title></rect><rect x="14.6" y="230.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>harmonic_pythagorean_comma — 1 cases</title></rect><rect x="23.2" y="230.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_seven — 1 cases</title></rect><rect x="31.8" y="230.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_eight — 1 cases</title></rect><rect x="40.4" y="230.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_creation_week — 1 cases</title></rect><rect x="49.0" y="230.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_moduli_dimensions_are_three_g_minus_three_and_six_g_minus_six — 1 cases</title></rect><rect x="57.6" y="230.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>genus2_moduli_dim — 1 cases</title></rect><rect x="66.2" y="230.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>genus2_hyperelliptic — 1 cases</title></rect><rect x="74.8" y="230.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>genus2_h1_symplectic — 1 cases</title></rect><rect x="6.0" y="221.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_seven_is_six_plus_one — 6 cases</title></rect><rect x="14.6" y="221.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_units_sum_and_product — 6 cases</title></rect><rect x="23.2" y="221.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_432_factors — 1 cases</title></rect><rect x="31.8" y="221.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_triangular_45_is_base — 9 cases</title></rect><rect x="40.4" y="221.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>kaprekar_constants_digitroot_nine — 1 cases</title></rect><rect x="49.0" y="221.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_three_four_five_right_triangle_is_the_first_pythagorean_triple — 1 cases</title></rect><rect x="57.6" y="221.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_regular_pentagon_angles_are_the_heart_seventy_two_and_hundred_eight — 1 cases</title></rect><rect x="66.2" y="221.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_cyclic_number_142857_is_the_repetend_of_one_seventh — 1 cases</title></rect><rect x="74.8" y="221.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>_142857_times_seven_is_six_nines — 1 cases</title></rect><rect x="6.0" y="212.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>midy_the_two_halves_of_142857_sum_to_nines — 1 cases</title></rect><rect x="14.6" y="212.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_digital_root_of_seven_to_the_k_has_period_three — 1 cases</title></rect><rect x="23.2" y="212.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>seven_divides_the_repunit_of_length_six — 1 cases</title></rect><rect x="31.8" y="212.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>two_to_the_eighth_is_two_hundred_fifty_six_a_byte — 1 cases</title></rect><rect x="40.4" y="212.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>two_to_the_tenth_is_1024_the_harmonic_ledger — 1 cases</title></rect><rect x="49.0" y="212.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_regular_nonagon_exterior_angle_is_the_a432_step — 1 cases</title></rect><rect x="57.6" y="212.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_digits_one_to_nine_sum_to_forty_five_rooting_to_nine — 9 cases</title></rect><rect x="66.2" y="212.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>nine_is_the_base_and_the_trinity_squared — 1 cases</title></rect><rect x="74.8" y="212.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>six_is_the_third_triangular_number — 3 cases</title></rect><rect x="6.0" y="204.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_regular_hexagon_exterior_angle_is_the_gold_string — 1 cases</title></rect><rect x="14.6" y="204.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_doubling_orbit_reflection_pairs_sum_to_nine — 1 cases</title></rect><rect x="23.2" y="204.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>five_is_the_inverse_of_two_so_halving_reverses_the_orbit — 1 cases</title></rect><rect x="31.8" y="204.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>dna_is_the_version_itself — 1 cases</title></rect><rect x="40.4" y="204.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>contribute_two_to_save_sixty_four — 6 cases</title></rect><rect x="49.0" y="204.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>genetic_code_is_the_octave_squared — 1 cases</title></rect><rect x="57.6" y="204.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>sixty_one_sense_three_stop_codons — 1 cases</title></rect><rect x="66.2" y="204.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>six_reading_frames — 1 cases</title></rect><rect x="74.8" y="204.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>genesis_1_the_unit — 9 cases</title></rect><rect x="6.0" y="195.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>genesis_8_the_octave — 1 cases</title></rect><rect x="14.6" y="195.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>genesis_64_the_codon — 1 cases</title></rect><rect x="23.2" y="195.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>diamond_fixed_point_is_zero_entropy — 1 cases</title></rect><rect x="31.8" y="195.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_address_is_shipped_not_the_payload — 1 cases</title></rect><rect x="40.4" y="195.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_harmonic_band_thirty_to_ninety — 1 cases</title></rect><rect x="49.0" y="195.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>sixty_and_ninety_partition_the_quadrant — 1 cases</title></rect><rect x="57.6" y="195.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_hexagon_and_the_square_metrics — 1 cases</title></rect><rect x="66.2" y="195.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a_theorem_responds_in_a_receipt — 1 cases</title></rect><rect x="74.8" y="195.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>involution_negation — 1 cases</title></rect><rect x="6.0" y="187.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a432_factors_as_two_to_the_fourth_times_three_cubed — 1 cases</title></rect><rect x="14.6" y="187.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a432_octave_doubling — 1 cases</title></rect><rect x="23.2" y="187.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>two_bits_thrice_make_the_codon — 1 cases</title></rect><rect x="31.8" y="187.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_skipper_navigates_by_angle — 1 cases</title></rect><rect x="40.4" y="187.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>cheap_to_factor_easy_to_verify — 1 cases</title></rect><rect x="49.0" y="187.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_cell_is_determined_by_content — 1 cases</title></rect><rect x="57.6" y="187.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>present_by_reference_fits_a_tiny_budget — 1 cases</title></rect><rect x="66.2" y="187.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a_cached_address_is_never_recomputed — 1 cases</title></rect><rect x="74.8" y="187.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a_decidable_domain_is_finite_and_coverable — 9 cases</title></rect><rect x="6.0" y="178.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_more_developed_the_more_cross_domain_reach — 1 cases</title></rect><rect x="14.6" y="178.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_full_superposition_has_nine_states — 9 cases</title></rect><rect x="23.2" y="178.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>forward_is_the_deterministic_compute — 1 cases</title></rect><rect x="31.8" y="178.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_cardinality_claims_hold_of_any_four_symbol_alphabet — 1 cases</title></rect><rect x="40.4" y="178.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a_reflexive_address_claim_holds_for_a_constant_function — 1 cases</title></rect><rect x="49.0" y="178.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>consecutive_squares_differ_by_the_odd_numbers — 1 cases</title></rect><rect x="57.6" y="178.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>every_multiple_of_three_four_five_is_pythagorean — 1 cases</title></rect><rect x="66.2" y="178.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_product_of_three_consecutive_numbers_is_even — 1 cases</title></rect><rect x="74.8" y="178.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_product_of_three_consecutive_numbers_is_a_multiple_of_three — 1 cases</title></rect><rect x="6.0" y="169.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_product_of_any_three_consecutive_integers_is_divisible_by_six_for_every_n — 1 cases</title></rect><rect x="14.6" y="169.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>repeated_doubling_is_the_power_of_two_for_every_k — 1 cases</title></rect><rect x="23.2" y="169.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_digitroot_is_residue_mod9_for_every_n — 1 cases</title></rect><rect x="31.8" y="169.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_nine_times_table_always_digital_roots_to_nine_for_every_k — 1 cases</title></rect><rect x="40.4" y="169.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_digital_root_has_the_residue_of_its_number — 1 cases</title></rect><rect x="49.0" y="169.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a_digital_root_lies_between_one_and_nine — 1 cases</title></rect><rect x="57.6" y="169.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>casting_out_nines_is_multiplicative_for_every_a_b — 1 cases</title></rect><rect x="66.2" y="169.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_moduli_dimensions_are_three_g_minus_three_and_six_g_minus_six_for_every_g — 1 cases</title></rect><rect x="74.8" y="169.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_three_classes_partition_z9 — 9 cases</title></rect><rect x="6.0" y="161.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_axis_is_closed_under_doubling — 1 cases</title></rect><rect x="14.6" y="161.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>doubling_counter_rotates_the_two_tetrahedra — 1 cases</title></rect><rect x="23.2" y="161.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_counter_rotation_has_period_two — 1 cases</title></rect><rect x="31.8" y="161.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_tetrahedra_residue_sums_cancel — 1 cases</title></rect><rect x="40.4" y="161.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>one_tetrahedron_covers_half_the_units — 1 cases</title></rect><rect x="49.0" y="161.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_cube_and_the_tetrahedron_count_out — 1 cases</title></rect><rect x="57.6" y="161.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>singleton_fold_is_the_leaf — 1 cases</title></rect><rect x="66.2" y="161.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_fold_of_any_single_leaf_is_that_leaf — 1 cases</title></rect><rect x="74.8" y="161.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>fold_is_order_independent_on_two — 1 cases</title></rect><rect x="6.0" y="152.6" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>merge_is_order_sensitive — 1 cases</title></rect><rect x="14.6" y="152.6" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>sorting_is_what_makes_the_fold_order_free — 1 cases</title></rect><rect x="23.2" y="152.6" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>merkle_settles_its_range — 1 cases</title></rect><rect x="31.8" y="152.6" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_permutation_generator_is_complete — 1 cases</title></rect><rect x="40.4" y="152.6" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>fold_is_order_independent_on_four — 1 cases</title></rect><rect x="49.0" y="152.6" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>fold_is_order_independent_on_three — 1 cases</title></rect><rect x="57.6" y="152.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>bouton_two_heaps_lost_iff_xor_zero — 1 cases</title></rect><rect x="66.2" y="152.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>bouton_lost_iff_heaps_equal — 1 cases</title></rect><rect x="74.8" y="152.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>lost_positions_are_exactly_the_diagonal — 1 cases</title></rect><rect x="6.0" y="144.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>grundy_of_a_single_heap_is_its_size — 1 cases</title></rect><rect x="14.6" y="144.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>grundy_of_two_heaps_is_the_xor — 1 cases</title></rect><rect x="23.2" y="144.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>every_phenomenon_is_definitional_or_credited — 1 cases</title></rect><rect x="31.8" y="144.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>seven_definitional_and_two_credited — 1 cases</title></rect><rect x="40.4" y="144.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_definitional_half_is_the_whole_si — 1 cases</title></rect><rect x="49.0" y="144.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_table_is_closed_and_that_is_all_this_file_decides — 1 cases</title></rect><rect x="57.6" y="144.0" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>novelty_is_claimed_only_where_a_search_was_performed — 1 cases</title></rect><rect x="66.2" y="144.0" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>this_deposit_claims_no_novelty_today — 1 cases</title></rect><rect x="74.8" y="144.0" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>the_restated_sources_are_named_and_claim_nothing — 1 cases</title></rect><rect x="6.0" y="135.4" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>an_unsearched_source_claims_nothing — 1 cases</title></rect><rect x="14.6" y="135.4" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>every_source_is_classified — 1 cases</title></rect><rect x="23.2" y="135.4" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>the_kinds_cover_every_source — 1 cases</title></rect><rect x="31.8" y="135.4" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>some_sources_are_unsearched — 1 cases</title></rect><rect x="40.4" y="135.4" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>zero_claims_is_not_full_attribution — 1 cases</title></rect><rect x="49.0" y="135.4" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>novelty_is_claimed_of_no_source — 1 cases</title></rect><rect x="57.6" y="135.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>perms_of_four_is_factorial — 4 cases</title></rect><rect x="66.2" y="135.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>superposition_collapses_to_one — 4 cases</title></rect><rect x="74.8" y="135.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_receipt_is_not_injective — 1 cases</title></rect><rect x="6.0" y="126.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_uncanonicalised_fold_gives_many_answers — 4 cases</title></rect><rect x="14.6" y="126.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>quantum_settles_its_domain_totally — 1 cases</title></rect><rect x="23.2" y="126.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_ghz_x_support_is_exactly_the_even_parity_strings — 8 cases</title></rect><rect x="31.8" y="126.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>it_is_half_of_the_eight — 8 cases</title></rect><rect x="40.4" y="126.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>exhaustion_never_reaches_its_own_bound — 1 cases</title></rect><rect x="49.0" y="126.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_successor_of_every_bound_lies_outside — 1 cases</title></rect><rect x="57.6" y="126.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>doubling_the_domain_leaves_the_same_hole — 1 cases</title></rect><rect x="66.2" y="126.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_successor_leaves_every_domain_and_the_predecessor_returns — 1 cases</title></rect><rect x="74.8" y="126.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_predecessor_returns_every_successor — 1 cases</title></rect><rect x="6.0" y="118.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>exhaustion_never_reaches_its_own_bound_for_every_n — 1 cases</title></rect><rect x="14.6" y="118.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_successor_of_every_bound_lies_outside_for_every_n — 1 cases</title></rect><rect x="23.2" y="118.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>doubling_the_domain_leaves_the_same_hole_for_every_n — 1 cases</title></rect><rect x="31.8" y="118.2" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>units_sum_zero — 1 cases</title></rect><rect x="40.4" y="118.2" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>triad_nilpotent — 1 cases</title></rect><rect x="49.0" y="118.2" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>triad_sum_zero — 1 cases</title></rect><rect x="57.6" y="118.2" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>units_product_neg1 — 1 cases</title></rect><rect x="66.2" y="118.2" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>order_of_2_is_6 — 5 cases</title></rect><rect x="74.8" y="118.2" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>unit_exp_id_k6 — 1 cases</title></rect><rect x="6.0" y="109.6" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>unit_exp_id_k12 — 1 cases</title></rect><rect x="14.6" y="109.6" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>unit_exp_id_k18 — 1 cases</title></rect><rect x="23.2" y="109.6" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>powperm_k5 — 1 cases</title></rect><rect x="31.8" y="109.6" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>powperm_k7 — 1 cases</title></rect><rect x="40.4" y="109.6" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>qr_u1 — 9 cases</title></rect><rect x="49.0" y="109.6" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>qr_u4 — 9 cases</title></rect><rect x="57.6" y="109.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_ledger_reversal_cases — 1 cases</title></rect><rect x="66.2" y="109.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>reversal_settles_its_range — 1 cases</title></rect><rect x="74.8" y="109.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>foldl_add_start — 1 cases</title></rect><rect x="6.0" y="101.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_digits_sum_to_the_number_mod_nine_when_the_fuel_covers_them — 1 cases</title></rect><rect x="14.6" y="101.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a_number_is_below_ten_to_its_own_successor — 1 cases</title></rect><rect x="23.2" y="101.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_digit_sum_has_the_residue_of_the_number_mod_nine_for_every_n — 1 cases</title></rect><rect x="31.8" y="101.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>folding_by_ten_keeps_the_residue_of_the_digit_sum — 1 cases</title></rect><rect x="40.4" y="101.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>reversal_keeps_the_residue_mod_nine_for_every_n — 1 cases</title></rect><rect x="49.0" y="101.0" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>claims_exactly_what_arises_without_formality — 1 cases</title></rect><rect x="57.6" y="101.0" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>the_claimed_are_copyright_moral_rights_and_the_database — 3 cases</title></rect><rect x="66.2" y="101.0" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>the_claimed_set_is_exactly_those_three_and_the_unregistered_mark — 4 cases</title></rect><rect x="74.8" y="101.0" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>the_unclaimed_are_the_registry_the_excluded_and_the_unownable — 4 cases</title></rect><rect x="6.0" y="92.4" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>no_right_that_needs_a_registry_act_is_claimed — 1 cases</title></rect><rect x="14.6" y="92.4" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>no_excluded_subject_matter_is_claimed — 1 cases</title></rect><rect x="23.2" y="92.4" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>nothing_incapable_of_ownership_is_claimed — 1 cases</title></rect><rect x="31.8" y="92.4" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>the_enumeration_is_complete_and_unduplicated — 9 cases</title></rect><rect x="40.4" y="92.4" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>rights_settles_its_range — 1 cases</title></rect><rect x="49.0" y="92.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>three_five_eight_are_consecutive — 1 cases</title></rect><rect x="57.6" y="92.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>cassinis_identity_for_every_m — 1 cases</title></rect><rect x="66.2" y="92.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_verify_path_is_the_exponent — 1 cases</title></rect><rect x="74.8" y="92.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_gap_widens_with_every_doubling — 1 cases</title></rect><rect x="6.0" y="83.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>no_constant_factor_accounts_for_the_gap — 1 cases</title></rect><rect x="14.6" y="83.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_microseconds_return_from_the_nanoseconds_at_every_count — 1 cases</title></rect><rect x="23.2" y="83.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_advantage_is_the_count_not_the_operation — 1 cases</title></rect><rect x="31.8" y="83.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_break_even_is_the_ratio_of_verifications — 1 cases</title></rect><rect x="40.4" y="83.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_width_is_the_ceiling_of_128_bits_over_the_symbol — 8 cases</title></rect><rect x="49.0" y="83.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>each_pair_is_two_consecutive_units — 1 cases</title></rect><rect x="57.6" y="83.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>every_token_is_a_multiple_of_three — 1 cases</title></rect><rect x="66.2" y="83.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_tokens_are_three_times_these — 7 cases</title></rect><rect x="74.8" y="83.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>addition_and_multiplication_stay_inside — 1 cases</title></rect><rect x="6.0" y="75.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>subtraction_stays_inside — 1 cases</title></rect><rect x="14.6" y="75.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>division_is_the_operation_that_leaves — 1 cases</title></rect><rect x="23.2" y="75.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_roots_are_the_singles — 7 cases</title></rect><rect x="31.8" y="75.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>every_root_is_a_single — 1 cases</title></rect><rect x="40.4" y="75.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_exhaustible_tokens_are_those_six_divides — 4 cases</title></rect><rect x="49.0" y="75.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_rest_halt_on_the_generator — 3 cases</title></rect><rect x="57.6" y="75.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>every_token_is_void_bound_or_halts_on_three — 1 cases</title></rect><rect x="66.2" y="75.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>inside_this_ideal_the_bare_coin_sorts_as_the_scaled_one — 1 cases</title></rect><rect x="74.8" y="75.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>a_seal_divides_into_payments_and_multiplies_back — 8 cases</title></rect><rect x="6.0" y="66.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_coin_step_and_the_coins_are_inverse_for_every_c — 1 cases</title></rect><rect x="14.6" y="66.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>units_are_six — 6 cases</title></rect><rect x="23.2" y="66.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>units_count — 1 cases</title></rect><rect x="31.8" y="66.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>hasinv_units — 1 cases</title></rect><rect x="40.4" y="66.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>hasinv_triad_not — 3 cases</title></rect><rect x="49.0" y="66.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>selfinv_exactly_one_and_eight — 2 cases</title></rect><rect x="57.6" y="66.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>euler_units_pow_six — 1 cases</title></rect><rect x="66.2" y="66.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>invpow_is_u_to_the_fifth — 1 cases</title></rect><rect x="74.8" y="66.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>powsum_zero_at_six — 1 cases</title></rect><rect x="6.0" y="58.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>powsum_zero_at_one — 1 cases</title></rect><rect x="14.6" y="58.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>mulperm_iff_unit — 1 cases</title></rect><rect x="23.2" y="58.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>addgen_iff_coprime — 1 cases</title></rect><rect x="31.8" y="58.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>selfneg_only_zero — 1 cases</title></rect><rect x="40.4" y="58.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>orbit_closes — 1 cases</title></rect><rect x="49.0" y="58.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>orbit_distinct — 6 cases</title></rect><rect x="57.6" y="58.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>orbit_covers_units — 6 cases</title></rect><rect x="66.2" y="58.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_orbit_step_is_read_back_by_its_log — 6 cases</title></rect><rect x="74.8" y="58.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>triad_squares_vanish — 1 cases</title></rect><rect x="6.0" y="49.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>add_group — 1 cases</title></rect><rect x="14.6" y="49.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>neg_involution — 1 cases</title></rect><rect x="23.2" y="49.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>z9_settles_its_domain_totally — 1 cases</title></rect><rect x="31.8" y="49.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>five_is_not_a_square_mod_nine — 1 cases</title></rect><rect x="40.4" y="49.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>cubes_land_exactly_in_zero_one_eight — 9 cases</title></rect><rect x="49.0" y="49.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>primitive_roots_are_exactly_two_and_five — 2 cases</title></rect><rect x="57.6" y="49.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>primitive_root_iff_generates_the_units — 2 cases</title></rect><rect x="66.2" y="49.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_orders_of_the_units_are_exact — 1 cases</title></rect><rect x="74.8" y="49.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_reflected_orbit_covers_the_whole_triad — 3 cases</title></rect><rect x="6.0" y="40.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>reflection_splits_the_orbit_in_half — 9 cases</title></rect><rect x="14.6" y="40.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_crossing_pairs_are_one_four_seven — 9 cases</title></rect><rect x="23.2" y="40.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>reflection_is_injective_on_the_orbit — 1 cases</title></rect><rect x="31.8" y="40.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>reflection_alone_reaches_only_two — 1 cases</title></rect><rect x="40.4" y="40.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>doubling_and_reflection_together_reach_every_residue — 1 cases</title></rect><rect x="49.0" y="40.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>every_residue_is_reachable_from_one — 9 cases</title></rect><rect x="57.6" y="40.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_diameter_is_exactly_four — 1 cases</title></rect><rect x="66.2" y="40.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_frontier_grows_by_two_each_round — 1 cases</title></rect><rect x="74.8" y="40.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>product_of_the_units_is_minus_one — 6 cases</title></rect><rect x="6.0" y="32.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>three_five_eight_are_consecutive_fibonacci — 1 cases</title></rect><rect x="14.6" y="32.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>units_and_triad_partition_the_ring — 1 cases</title></rect><rect x="23.2" y="32.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>both_parts_sum_to_zero — 1 cases</title></rect><rect x="31.8" y="32.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>doubling_has_period_six_for_every_k — 1 cases</title></rect><rect x="40.4" y="32.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>orbit_digital_roots_have_period_six_for_every_k — 1 cases</title></rect><rect x="49.0" y="32.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_doubling_orbit_is_read_from_the_exponent_mod_six — 1 cases</title></rect><rect x="57.6" y="32.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_orbit_never_meets_the_triad_for_every_k — 1 cases</title></rect><rect x="66.2" y="32.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>fibonacci_residues_mod_nine_repeat_every_twenty_four_steps — 1 cases</title></rect><rect x="74.8" y="32.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>pisano_period_mod_nine_is_twenty_four_for_every_k — 1 cases</title></rect><rect x="6.0" y="23.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_fuelled_gcd_is_the_gcd_when_the_fuel_exceeds_the_second_argument — 1 cases</title></rect><rect x="14.6" y="23.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>consecutive_fibonacci_numbers_are_coprime — 1 cases</title></rect><rect x="23.2" y="23.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>consecutive_fibonacci_are_coprime_for_every_n — 1 cases</title></rect><rect x="31.8" y="23.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>digital_root_agrees_with_the_residue_for_every_n — 1 cases</title></rect><rect x="40.4" y="23.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>digital_root_is_the_digit_sum_residue_for_every_n — 1 cases</title></rect><text x="42.7" y="438.2" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">1</text><text x="42.7" y="453.2" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">419</text><rect x="105.4" y="419.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>raw_bytes_of_a — 16 cases</title></rect><rect x="114.0" y="419.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>to_uuid_bytes_of_a — 16 cases</title></rect><rect x="122.6" y="419.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>to_uuid_bytes_of_uuidna — 16 cases</title></rect><rect x="131.2" y="419.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>addressing_is_injective_on_single_characters — 24 cases</title></rect><rect x="139.8" y="419.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_address_is_not_the_payload — 36 cases</title></rect><rect x="148.4" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_mobius_divisor_sum_is_the_identity — 30 cases</title></rect><rect x="157.0" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_derangement_recurrence_holds — 11 cases</title></rect><rect x="165.6" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>mantels_bound_is_n_squared_over_four — 20 cases</title></rect><rect x="174.2" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>every_number_is_a_sum_of_four_squares — 60 cases</title></rect><rect x="105.4" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_cantor_pairing_is_injective_and_covers_an_initial_segment — 36 cases</title></rect><rect x="114.0" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_euler_characteristic_of_a_genus_g_surface — 12 cases</title></rect><rect x="122.6" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_eisenstein_units_are_exactly_six — 49 cases</title></rect><rect x="131.2" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_count_of_primitive_roots_is_phi_of_phi — 59 cases</title></rect><rect x="139.8" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_order_spectrum_of_the_z9_units_realises_gauss_divisor_sum — 36 cases</title></rect><rect x="148.4" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_product_of_the_units_is_minus_one_exactly_where_gauss_says — 59 cases</title></rect><rect x="157.0" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>eight_times_a_triangular_number_plus_one_is_an_odd_square — 60 cases</title></rect><rect x="165.6" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_lucas_numbers_follow_their_recurrence_and_reach_their_named_values — 28 cases</title></rect><rect x="174.2" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_lucas_numbers_are_the_sum_of_the_neighbouring_fibonaccis — 28 cases</title></rect><rect x="105.4" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_pell_numbers_follow_their_recurrence_and_reach_their_named_values — 24 cases</title></rect><rect x="114.0" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_interior_and_exterior_angles_are_n_straight_angles — 30 cases</title></rect><rect x="122.6" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_golden_beatty_identity_holds_across_the_range — 40 cases</title></rect><rect x="131.2" y="402.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>any_yield_below_its_cost_reads_under_the_whole — 60 cases</title></rect><rect x="139.8" y="402.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_cost_per_litre_multiplies_back_to_the_cost — 20 cases</title></rect><rect x="148.4" y="402.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>a_part_and_its_rest_read_back_the_whole — 40 cases</title></rect><rect x="157.0" y="402.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_energy_per_litre_multiplies_back_to_the_energy — 30 cases</title></rect><rect x="165.6" y="402.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>a_ratio_and_its_reciprocal_multiply_back_to_the_whole — 40 cases</title></rect><rect x="174.2" y="402.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_loss_and_the_yield_read_back_the_input — 60 cases</title></rect><rect x="105.4" y="393.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>wilson_fails_at_composites — 20 cases</title></rect><rect x="114.0" y="393.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>pascal_rows_sum_to_powers_of_two — 12 cases</title></rect><rect x="122.6" y="393.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>pascal_alternating_sums_vanish — 11 cases</title></rect><rect x="131.2" y="393.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>totient_at_prime_powers — 12 cases</title></rect><rect x="139.8" y="393.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>geometric_series_all_bases — 40 cases</title></rect><rect x="148.4" y="393.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>division_identity_holds_across_the_range — 13 cases</title></rect><rect x="157.0" y="393.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>primality_is_decided_across_the_range — 17 cases</title></rect><rect x="165.6" y="393.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_units_are_cyclic_at_exactly_the_gauss_moduli — 17 cases</title></rect><rect x="174.2" y="393.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>geometric_series_across_bases_and_exponents — 77 cases</title></rect><rect x="105.4" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>totient_at_prime_powers_through_thirteen — 18 cases</title></rect><rect x="114.0" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_powers_of_a_unit_sum_to_zero_when_g_minus_one_is_invertible — 19 cases</title></rect><rect x="122.6" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_powers_of_two_sum_to_one_less_than_the_next — 41 cases</title></rect><rect x="131.2" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_squares_of_a_pascal_row_sum_to_the_central_binomial — 13 cases</title></rect><rect x="139.8" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>cassinis_identity_holds_across_the_range — 30 cases</title></rect><rect x="148.4" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_golden_convergents_are_fibonacci_ratios_with_unit_determinant — 25 cases</title></rect><rect x="157.0" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_catalan_recurrence_matches_the_binomial_formula — 13 cases</title></rect><rect x="165.6" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_pisano_period_of_nine_is_twenty_four_and_every_modulus_to_twelve_has_one — 11 cases</title></rect><rect x="174.2" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>choose_is_invariant_under_the_involution_k_to_n_minus_k — 13 cases</title></rect><rect x="105.4" y="376.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>hash_is_deterministic — 32 cases</title></rect><rect x="114.0" y="376.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>hash_is_injective_on_single_characters — 64 cases</title></rect><rect x="122.6" y="376.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_seed_separates — 16 cases</title></rect><rect x="131.2" y="376.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>hash_is_thirty_two_bit — 40 cases</title></rect><rect x="139.8" y="376.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>powsum_zero_odd_exponents — 54 cases</title></rect><rect x="148.4" y="376.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>powsum_nonzero_at_even_exponents — 18 cases</title></rect><rect x="157.0" y="376.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>mulperm_fails_at_the_triad — 18 cases</title></rect><rect x="165.6" y="376.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>power_sum_closed_forms — 30 cases</title></rect><rect x="174.2" y="376.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>invpow_fails_off_the_units — 18 cases</title></rect><rect x="105.4" y="367.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>units_is_closed_under_double — 36 cases</title></rect><rect x="114.0" y="367.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>orbit_is_closed_under_double — 36 cases</title></rect><rect x="122.6" y="367.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_double — 81 cases</title></rect><rect x="131.2" y="367.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_triple — 81 cases</title></rect><rect x="139.8" y="367.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>units_is_closed_under_quadruple — 36 cases</title></rect><rect x="148.4" y="367.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>orbit_is_closed_under_quadruple — 36 cases</title></rect><rect x="157.0" y="367.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_quadruple — 81 cases</title></rect><rect x="165.6" y="367.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>squares_is_closed_under_quadruple — 16 cases</title></rect><rect x="174.2" y="367.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>orbit_is_closed_under_negate — 36 cases</title></rect><rect x="105.4" y="359.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_negate — 81 cases</title></rect><rect x="114.0" y="359.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>units_is_closed_under_square — 36 cases</title></rect><rect x="122.6" y="359.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>orbit_is_closed_under_square — 36 cases</title></rect><rect x="131.2" y="359.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_square — 81 cases</title></rect><rect x="139.8" y="359.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>squares_is_closed_under_square — 16 cases</title></rect><rect x="148.4" y="359.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>units_is_closed_under_fourth — 36 cases</title></rect><rect x="157.0" y="359.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>orbit_is_closed_under_fourth — 36 cases</title></rect><rect x="165.6" y="359.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_fourth — 81 cases</title></rect><rect x="174.2" y="359.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>squares_is_closed_under_fourth — 16 cases</title></rect><rect x="105.4" y="350.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>units_is_closed_under_sixth — 36 cases</title></rect><rect x="114.0" y="350.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>orbit_is_closed_under_sixth — 36 cases</title></rect><rect x="122.6" y="350.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_sixth — 81 cases</title></rect><rect x="131.2" y="350.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>squares_is_closed_under_sixth — 16 cases</title></rect><rect x="139.8" y="350.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>units_is_closed_under_quintuple — 36 cases</title></rect><rect x="148.4" y="350.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>orbit_is_closed_under_quintuple — 36 cases</title></rect><rect x="157.0" y="350.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_quintuple — 81 cases</title></rect><rect x="165.6" y="350.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_sextuple — 81 cases</title></rect><rect x="174.2" y="350.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>units_is_closed_under_septuple — 36 cases</title></rect><rect x="105.4" y="341.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>orbit_is_closed_under_septuple — 36 cases</title></rect><rect x="114.0" y="341.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_septuple — 81 cases</title></rect><rect x="122.6" y="341.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>squares_is_closed_under_septuple — 16 cases</title></rect><rect x="131.2" y="341.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>units_is_closed_under_octuple — 36 cases</title></rect><rect x="139.8" y="341.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>orbit_is_closed_under_octuple — 36 cases</title></rect><rect x="148.4" y="341.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_octuple — 81 cases</title></rect><rect x="157.0" y="341.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triple_carries_cubes_onto_triad — 27 cases</title></rect><rect x="165.6" y="341.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>negate_carries_tetA_onto_tetB — 27 cases</title></rect><rect x="174.2" y="341.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>negate_carries_tetB_onto_tetA — 27 cases</title></rect><rect x="105.4" y="333.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>square_carries_tetB_onto_tetA — 27 cases</title></rect><rect x="114.0" y="333.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fourth_carries_tetB_onto_tetA — 27 cases</title></rect><rect x="122.6" y="333.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>quintuple_carries_tetA_onto_tetB — 27 cases</title></rect><rect x="131.2" y="333.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>quintuple_carries_tetB_onto_tetA — 27 cases</title></rect><rect x="139.8" y="333.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>sextuple_carries_cubes_onto_triad — 27 cases</title></rect><rect x="148.4" y="333.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>octuple_carries_tetA_onto_tetB — 27 cases</title></rect><rect x="157.0" y="333.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>octuple_carries_tetB_onto_tetA — 27 cases</title></rect><rect x="165.6" y="333.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>p_vs_np_inverse_is_unique — 81 cases</title></rect><rect x="174.2" y="333.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>hodge_span_is_the_units — 81 cases</title></rect><rect x="105.4" y="324.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>poincare_single_closed_loop — 36 cases</title></rect><rect x="114.0" y="324.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_seven_rest_on_one_finite_structure — 81 cases</title></rect><rect x="122.6" y="324.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_origin_annihilates_and_never_joins_the_circuit — 81 cases</title></rect><rect x="131.2" y="324.6" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>more_payloads_than_addresses_must_collide — 17 cases</title></rect><rect x="139.8" y="324.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>three_on_the_triad_and_four_on_the_units — 18 cases</title></rect><rect x="148.4" y="324.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_seven_roots_miss_four_residues — 36 cases</title></rect><rect x="157.0" y="324.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_absent_residues_are_the_primes_below_nine — 36 cases</title></rect><rect x="165.6" y="324.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>and_a_change_of_unit_destroys_it — 36 cases</title></rect><rect x="174.2" y="324.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>add_group — 81 cases</title></rect><rect x="105.4" y="316.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>nopayload_avalanche — 64 cases</title></rect><rect x="114.0" y="316.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>chess_board_64 — 64 cases</title></rect><rect x="122.6" y="316.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>tarot_major_0_21 — 22 cases</title></rect><rect x="131.2" y="316.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>repeated_doubling_is_the_power_of_two — 21 cases</title></rect><rect x="139.8" y="316.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_nine_times_table_always_digital_roots_to_nine — 60 cases</title></rect><rect x="148.4" y="316.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>collapse_selects_one_state_deterministically — 16 cases</title></rect><rect x="157.0" y="316.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>generation_is_deterministic — 16 cases</title></rect><rect x="165.6" y="316.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>stacked_triangles_are_tetrahedral — 40 cases</title></rect><rect x="174.2" y="316.0" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>merge_agrees — 16 cases</title></rect><rect x="105.4" y="307.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>empty_fold_agrees — 16 cases</title></rect><rect x="114.0" y="307.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>pair_fold_agrees — 16 cases</title></rect><rect x="122.6" y="307.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>xor_zero_is_identity — 32 cases</title></rect><rect x="131.2" y="307.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>bouton_holds_at_every_heap_size_to_six — 49 cases</title></rect><rect x="139.8" y="307.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>receipt_is_order_invariant — 16 cases</title></rect><rect x="148.4" y="307.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>receipt_order_invariant_on_the_orbit — 36 cases</title></rect><rect x="157.0" y="307.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>naive_fold_is_not_order_invariant — 16 cases</title></rect><rect x="165.6" y="307.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_invariance_is_canonicalisation_not_physics — 16 cases</title></rect><rect x="174.2" y="307.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>a_classical_mixture_reaches_the_parity_ghz_never_does — 64 cases</title></rect><rect x="105.4" y="298.8" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>self_inverse_1_8 — 18 cases</title></rect><rect x="114.0" y="298.8" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>sum_1_to_9_zero — 81 cases</title></rect><rect x="122.6" y="298.8" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>doubling_digitroot_period6 — 36 cases</title></rect><rect x="131.2" y="298.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>reversal_is_not_the_identity — 90 cases</title></rect><rect x="139.8" y="298.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>palindromes_are_the_fixed_points — 90 cases</title></rect><rect x="148.4" y="298.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>emirps_exist_below_one_hundred — 90 cases</title></rect><rect x="157.0" y="298.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>reversal_does_not_preserve_primality — 90 cases</title></rect><rect x="165.6" y="298.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>cassini_at_even_indices — 20 cases</title></rect><rect x="174.2" y="298.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>cassini_at_odd_indices — 20 cases</title></rect><rect x="105.4" y="290.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>cassini_deviation_is_exactly_one — 20 cases</title></rect><rect x="114.0" y="290.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>lucas_mod_two_is_the_and_rule — 14 cases</title></rect><rect x="122.6" y="290.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>pisano_twentyfour_is_four_sixes — 30 cases</title></rect><rect x="131.2" y="290.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_measured_ratio_exceeds_the_counted_gap — 20 cases</title></rect><rect x="139.8" y="290.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>verification_grows_it_is_not_constant — 10 cases</title></rect><rect x="148.4" y="290.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_pairs_are_exactly_the_units_in_order — 60 cases</title></rect><rect x="157.0" y="290.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_coin_step_and_the_coins_are_inverse — 20 cases</title></rect><rect x="165.6" y="290.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>paying_and_refunding_coins_on_the_last_pair_round_trips — 27 cases</title></rect><rect x="174.2" y="290.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_orbit_turns_once_per_budget — 60 cases</title></rect><rect x="105.4" y="281.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>universal_centre_is_five — 10 cases</title></rect><rect x="114.0" y="281.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>universal_pairs_sum_to_ten — 11 cases</title></rect><rect x="122.6" y="281.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>universal_reflection_is_not_an_involution_above_ten — 10 cases</title></rect><rect x="131.2" y="281.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>universal_z9_reflection_permutes_the_units — 36 cases</title></rect><rect x="139.8" y="281.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>universal_millennium_reflection_escapes_the_units — 36 cases</title></rect><rect x="148.4" y="281.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>universal_reflection_is_the_vortex_reflection_shifted — 10 cases</title></rect><rect x="157.0" y="281.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>orbit_is_the_six — 36 cases</title></rect><rect x="165.6" y="281.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>triad_never_reaches_one — 12 cases</title></rect><rect x="174.2" y="281.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>squares_land_exactly_in_zero_one_four_seven — 16 cases</title></rect><rect x="105.4" y="273.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>doubling_has_period_six — 30 cases</title></rect><rect x="114.0" y="273.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>no_period_smaller_than_six — 60 cases</title></rect><rect x="122.6" y="273.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>orbit_digital_roots_have_period_six — 24 cases</title></rect><rect x="131.2" y="273.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>pisano_period_mod_nine_is_twenty_four — 30 cases</title></rect><rect x="139.8" y="273.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>fibonacci_recurrence_holds — 20 cases</title></rect><rect x="148.4" y="273.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>consecutive_fibonacci_are_coprime — 25 cases</title></rect><text x="142.1" y="438.2" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">10+</text><text x="142.1" y="453.2" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">159</text><rect x="204.8" y="419.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>distinct_inputs_give_distinct_addresses — 336 cases</title></rect><rect x="213.4" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>fibonacci_gcd_is_the_fibonacci_of_the_gcd — 196 cases</title></rect><rect x="222.0" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>legendres_three_square_theorem — 200 cases</title></rect><rect x="230.6" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>five_six_one_is_the_smallest_carmichael_number — 559 cases</title></rect><rect x="239.2" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_sum_of_fifth_powers_has_the_closed_form_asked_for — 380 cases</title></rect><rect x="247.8" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>wilsons_theorem_and_its_converse — 270 cases</title></rect><rect x="256.4" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>repunit_divisibility_by_three_and_seven — 324 cases</title></rect><rect x="265.0" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>odd_divisor_count_iff_perfect_square — 120 cases</title></rect><rect x="273.6" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_subtraction_game_loses_exactly_at_the_multiples_of_four — 369 cases</title></rect><rect x="204.8" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>an_odd_prime_is_a_sum_of_two_squares_exactly_when_it_is_one_mod_four — 197 cases</title></rect><rect x="213.4" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_hockey_stick_identity_holds_across_the_range — 209 cases</title></rect><rect x="222.0" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_two_to_one_is_forced_by_the_oxygen — 729 cases</title></rect><rect x="230.6" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_mass_balance_is_the_atom_balance — 729 cases</title></rect><rect x="239.2" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_atom_table_decides_the_balance — 729 cases</title></rect><rect x="247.8" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>two_parts_in_three_is_two_thirds_at_every_scale — 500 cases</title></rect><rect x="256.4" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>compression_scales_the_energy_per_litre_linearly — 100 cases</title></rect><rect x="265.0" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_residue_ratio_is_the_same_at_every_volume — 200 cases</title></rect><rect x="273.6" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_atoms_read_back_from_the_mass — 100 cases</title></rect><rect x="204.8" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>power_sums_match_their_closed_forms — 205 cases</title></rect><rect x="213.4" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_first_n_odd_numbers_sum_to_n_squared — 201 cases</title></rect><rect x="222.0" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_sums_of_triangular_numbers_are_the_tetrahedral_numbers — 101 cases</title></rect><rect x="230.6" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>polygonal_closed_forms_match_their_recurrences — 408 cases</title></rect><rect x="239.2" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_digit_square_iteration_reaches_one_or_four — 200 cases</title></rect><rect x="247.8" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>a_number_is_a_sum_of_two_squares_exactly_when_fermats_condition_holds — 200 cases</title></rect><rect x="256.4" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_first_three_power_sums_hold_to_two_hundred — 603 cases</title></rect><rect x="265.0" y="402.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>mulperm_iff_unit_all — 324 cases</title></rect><rect x="273.6" y="402.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>addgen_iff_coprime_all — 486 cases</title></rect><rect x="204.8" y="393.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>hasinv_iff_unit_all — 486 cases</title></rect><rect x="213.4" y="393.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>primality_agrees_with_trial_division — 520 cases</title></rect><rect x="222.0" y="393.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>double_carries_units_onto_orbit — 216 cases</title></rect><rect x="230.6" y="393.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>double_carries_orbit_onto_units — 216 cases</title></rect><rect x="239.2" y="393.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triple_carries_all_onto_triad — 243 cases</title></rect><rect x="247.8" y="393.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>quadruple_carries_units_onto_orbit — 216 cases</title></rect><rect x="256.4" y="393.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>quadruple_carries_orbit_onto_units — 216 cases</title></rect><rect x="265.0" y="393.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>negate_carries_orbit_onto_units — 216 cases</title></rect><rect x="273.6" y="393.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>square_carries_units_onto_tetA — 108 cases</title></rect><rect x="204.8" y="384.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>square_carries_orbit_onto_tetA — 108 cases</title></rect><rect x="213.4" y="384.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>square_carries_all_onto_squares — 324 cases</title></rect><rect x="222.0" y="384.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>cube_carries_all_onto_cubes — 243 cases</title></rect><rect x="230.6" y="384.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fourth_carries_units_onto_tetA — 108 cases</title></rect><rect x="239.2" y="384.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fourth_carries_orbit_onto_tetA — 108 cases</title></rect><rect x="247.8" y="384.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fourth_carries_all_onto_squares — 324 cases</title></rect><rect x="256.4" y="384.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fifth_carries_units_onto_orbit — 216 cases</title></rect><rect x="265.0" y="384.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fifth_carries_orbit_onto_units — 216 cases</title></rect><rect x="273.6" y="384.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>quintuple_carries_units_onto_orbit — 216 cases</title></rect><rect x="204.8" y="376.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>quintuple_carries_orbit_onto_units — 216 cases</title></rect><rect x="213.4" y="376.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>sextuple_carries_all_onto_triad — 243 cases</title></rect><rect x="222.0" y="376.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>septuple_carries_units_onto_orbit — 216 cases</title></rect><rect x="230.6" y="376.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>septuple_carries_orbit_onto_units — 216 cases</title></rect><rect x="239.2" y="376.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>octuple_carries_units_onto_orbit — 216 cases</title></rect><rect x="247.8" y="376.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>octuple_carries_orbit_onto_units — 216 cases</title></rect><rect x="256.4" y="376.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>riemann_reflection_and_heart — 100 cases</title></rect><rect x="265.0" y="376.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_address_does_not_determine_the_payload — 289 cases</title></rect><rect x="273.6" y="376.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>a_proof_is_smaller_than_its_set_across_the_octave — 255 cases</title></rect><rect x="204.8" y="367.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_second_returns_from_the_metre_and_the_period — 100 cases</title></rect><rect x="213.4" y="367.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_chain_scales — 121 cases</title></rect><rect x="222.0" y="367.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_digitroot_is_residue_mod9 — 200 cases</title></rect><rect x="230.6" y="367.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>there_are_infinitely_many_pythagorean_triples — 100 cases</title></rect><rect x="239.2" y="367.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_difference_of_consecutive_squares_is_the_odd_numbers — 501 cases</title></rect><rect x="247.8" y="367.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_product_of_any_three_consecutive_integers_is_divisible_by_six — 500 cases</title></rect><rect x="256.4" y="367.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>each_wave_is_a_local_pure_derivation — 576 cases</title></rect><rect x="265.0" y="367.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>vitepress_hosts_the_content_address — 144 cases</title></rect><rect x="273.6" y="367.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a_content_address_detects_any_change — 256 cases</title></rect><rect x="204.8" y="359.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>xor_is_its_own_inverse — 256 cases</title></rect><rect x="213.4" y="359.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>xor_is_commutative — 256 cases</title></rect><rect x="222.0" y="359.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>reversal_preserves_digit_sum — 300 cases</title></rect><rect x="230.6" y="359.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>digital_root_is_invariant_under_reversal — 300 cases</title></rect><rect x="239.2" y="359.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>reversal_is_involutive_exactly_off_the_trailing_zeros — 300 cases</title></rect><rect x="247.8" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>pascal_has_both_parities — 196 cases</title></rect><rect x="256.4" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>thue_morse_doubling_recurrence — 200 cases</title></rect><rect x="265.0" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>doubling_preserves_the_parity_of_the_bits — 200 cases</title></rect><rect x="273.6" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_odd_step_sets_exactly_one_further_bit — 200 cases</title></rect><rect x="204.8" y="350.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_singles_are_exactly_the_non_units — 160 cases</title></rect><rect x="213.4" y="350.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>sixty_four_is_where_the_doubling_returns — 180 cases</title></rect><rect x="222.0" y="350.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>universal_reflection_involution — 110 cases</title></rect><rect x="230.6" y="350.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>universal_reflection_reverses_the_domain — 121 cases</title></rect><rect x="239.2" y="350.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>digital_root_agrees_with_the_residue — 300 cases</title></rect><rect x="247.8" y="350.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>digital_root_is_the_digit_sum_residue — 300 cases</title></rect><rect x="256.4" y="350.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>reversal_cannot_change_the_digital_root — 300 cases</title></rect><rect x="265.0" y="350.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_orbit_never_meets_the_triad — 120 cases</title></rect><rect x="273.6" y="350.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>doubling_alone_reaches_only_the_units — 432 cases</title></rect><rect x="204.8" y="341.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>no_proper_divisor_of_twenty_four_is_a_period — 182 cases</title></rect><text x="241.5" y="438.2" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">100+</text><text x="241.5" y="453.2" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">82</text><rect x="304.2" y="419.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_address_is_sixteen_bytes_whatever_the_input_length — 4,368 cases</title></rect><rect x="312.8" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_parity_of_popcount_is_the_xor_of_the_bits — 1,024 cases</title></rect><rect x="321.4" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_chinese_remainder_theorem_holds_exactly_when_the_moduli_are_coprime — 8,505 cases</title></rect><rect x="330.0" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>eight_and_nine_are_the_only_consecutive_perfect_powers_below_two_thousand — 1,999 cases</title></rect><rect x="338.6" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>havel_hakimi_decides_graphical_sequences — 1,200 cases</title></rect><rect x="347.2" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>three_is_the_only_prime_one_less_than_a_square_in_this_range — 1,560 cases</title></rect><rect x="355.8" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_whole_ring_is_not_regular_and_the_triad_is_why — 1,458 cases</title></rect><rect x="364.4" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>splitting_then_burning_is_the_identity_at_the_ideal — 1,000 cases</title></rect><rect x="373.0" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_gas_volume_reads_back_its_moles — 1,000 cases</title></rect><rect x="304.2" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>navier_stokes_flow_is_bounded — 2,304 cases</title></rect><rect x="312.8" y="410.6" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>a_saving_never_exceeds_its_value — 1,600 cases</title></rect><rect x="321.4" y="410.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>content_address_is_keyless_integrity — 1,512 cases</title></rect><rect x="330.0" y="410.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>casting_out_nines_is_multiplicative — 3,481 cases</title></rect><rect x="338.6" y="410.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a_sensor_reading_addresses_to_a_uuid — 6,561 cases</title></rect><rect x="347.2" y="410.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_fusion_of_site_and_user_is_deterministic — 2,401 cases</title></rect><rect x="355.8" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>sums_of_two_squares_are_closed — 4,096 cases</title></rect><rect x="364.4" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_verify_in_nanoseconds_reads_back_its_microseconds — 1,000 cases</title></rect><rect x="373.0" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>hexbits_are_slower_and_the_ratio_multiplies_back — 8,000 cases</title></rect><rect x="304.2" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_unit_table_is_a_latin_square — 1,296 cases</title></rect><text x="340.9" y="438.2" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">1,000+</text><text x="340.9" y="453.2" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">19</text><rect x="403.6" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>nicomachus_sum_of_cubes_is_the_square_of_the_triangular_number — 30,400 cases</title></rect><rect x="412.2" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>two_twenty_and_two_eighty_four_are_the_smallest_amicable_pair — 95,048 cases</title></rect><rect x="420.8" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_area_of_an_integer_right_triangle_is_a_multiple_of_six — 96,000 cases</title></rect><rect x="429.4" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_powers_of_two_mod_nine_and_of_three_mod_seven_are_isomorphic — 46,656 cases</title></rect><rect x="438.0" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_wythoff_sequences_partition_the_integers — 80,000 cases</title></rect><rect x="446.6" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>a_chain_of_efficiencies_can_only_lose — 10,201 cases</title></rect><rect x="455.2" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>mass_is_conserved_at_every_scale_so_the_loop_cannot_make_water — 10,000 cases</title></rect><rect x="463.8" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_digital_root_is_invariant_under_digit_reversal — 10,000 cases</title></rect><rect x="472.4" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_digit_sum_rules_for_three_and_nine_hold_below_ten_thousand — 10,000 cases</title></rect><rect x="403.6" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_three_non_units_are_exactly_the_unreachable — 19,683 cases</title></rect><rect x="412.2" y="410.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_superposition_collapse — 10,000 cases</title></rect><rect x="420.8" y="410.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_url_path — 14,641 cases</title></rect><rect x="429.4" y="410.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>each_perspective_is_a_distinct_file — 28,561 cases</title></rect><rect x="438.0" y="410.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>intentions_are_shown_by_receipts_not_role — 10,404 cases</title></rect><rect x="446.6" y="410.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>each_theorem_is_a_superposition_of_readings — 22,308 cases</title></rect><rect x="455.2" y="410.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_theorems_are_the_hull_and_hardware — 41,160 cases</title></rect><rect x="463.8" y="410.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_intention_is_a_computable_deed_receipt — 23,104 cases</title></rect><rect x="472.4" y="410.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>every_error_is_a_receipted_trial_event — 15,876 cases</title></rect><rect x="403.6" y="402.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>every_warning_is_a_receipted_trial_event — 12,138 cases</title></rect><rect x="412.2" y="402.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>each_suggested_next_is_content_addressed — 10,000 cases</title></rect><rect x="420.8" y="402.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_rejected_command_gets_a_receipt — 44,100 cases</title></rect><rect x="429.4" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_sequence_takes_both_values — 40,000 cases</title></rect><text x="440.3" y="438.2" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">10,000+</text><text x="440.3" y="453.2" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">22</text><text x="539.7" y="438.2" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">100,000+</text><text x="539.7" y="453.2" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">0</text><rect x="602.4" y="419.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>gravity_holds_prose_code_and_paths — 7,529,536 cases</title></rect><text x="639.1" y="438.2" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">10^6</text><text x="639.1" y="453.2" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">1</text><text x="738.5" y="438.2" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">10^7</text><text x="738.5" y="453.2" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">0</text><text x="837.9" y="438.2" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">10^8</text><text x="837.9" y="453.2" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">0</text><rect x="900.6" y="419.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_nim_sum_is_a_gf2_vector_addition — 4,294,967,296 cases</title></rect><text x="937.3" y="438.2" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">10^9</text><text x="937.3" y="453.2" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">1</text><text x="1036.7" y="438.2" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">10^10</text><text x="1036.7" y="453.2" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">0</text><rect x="1099.4" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>bezouts_identity_is_attained_and_no_smaller_combination_exists — 152,568,360,000 cases</title></rect><text x="1136.1" y="438.2" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">10^11</text><text x="1136.1" y="453.2" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">1</text><text x="6" y="13" font-size="12" fill="currentColor" opacity="0.65">cases the kernel exhausted, per theorem (log₁₀ buckets) — one square is one theorem</text></svg>
22
- <figcaption><strong>Figure 1.</strong> All 704 declarations, one square each, placed by the size of the domain its proof exhausted (log₁₀ buckets). Colour is the wing. The right-hand tail is a single theorem; the mass is at nine cases.</figcaption>
21
+ <svg viewBox="0 0 1203 483" role="img" class="fig" xmlns="http://www.w3.org/2000/svg" aria-label="every theorem placed by the size of the domain its proof exhausted"><title>Figure 1 — all 719 declarations by domain size</title><rect x="6.0" y="436.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>address_is_sixteen_bytes — 1 cases</title></rect><rect x="14.6" y="436.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>address_bytes_are_bytes — 1 cases</title></rect><rect x="23.2" y="436.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>version_nibble_is_forced — 1 cases</title></rect><rect x="31.8" y="436.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>variant_bits_are_forced — 1 cases</title></rect><rect x="40.4" y="436.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>addressing_is_deterministic — 1 cases</title></rect><rect x="49.0" y="436.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>distinct_seeds_give_distinct_addresses — 1 cases</title></rect><rect x="57.6" y="436.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>addressing_is_not_the_identity — 1 cases</title></rect><rect x="66.2" y="436.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>addressing_is_not_constant — 1 cases</title></rect><rect x="74.8" y="436.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_four_seeds_are_distinct — 1 cases</title></rect><rect x="6.0" y="427.8" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>address_settles_its_range — 1 cases</title></rect><rect x="14.6" y="427.8" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_address_is_order_sensitive — 4 cases</title></rect><rect x="23.2" y="427.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_reflection_is_an_involution — 1 cases</title></rect><rect x="31.8" y="427.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>one_side_is_reflected_onto_itself — 1 cases</title></rect><rect x="40.4" y="427.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_other_two_swap — 1 cases</title></rect><rect x="49.0" y="427.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>exactly_one_digit_is_unmoved — 1 cases</title></rect><rect x="57.6" y="427.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>exactly_one_digit_reflects_out_of_range — 1 cases</title></rect><rect x="66.2" y="427.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_classes_partition_the_nine — 1 cases</title></rect><rect x="74.8" y="427.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>every_digit_is_sorted_exactly_once — 1 cases</title></rect><rect x="6.0" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_fall_fixes_every_digit_but_the_void — 1 cases</title></rect><rect x="14.6" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_fall_and_the_reflection_share_one_exceptional_digit — 1 cases</title></rect><rect x="23.2" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>on_the_fixed_points_the_reflection_never_leaves — 1 cases</title></rect><rect x="31.8" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>what_escapes_falls_back_inside — 1 cases</title></rect><rect x="40.4" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_nines_complement_pairs_the_ten_digits — 1 cases</title></rect><rect x="49.0" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>factorial_seven_is_five_thousand_and_forty — 1 cases</title></rect><rect x="57.6" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>mantels_bound_is_n_squared_over_four_for_every_n — 1 cases</title></rect><rect x="66.2" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>picks_theorem_holds_for_every_lattice_triangle_in_the_four_grid — 1 cases</title></rect><rect x="74.8" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_latin_squares_of_order_four_number_five_hundred_and_seventy_six — 1 cases</title></rect><rect x="6.0" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_two_power_sums_are_one_sum — 1 cases</title></rect><rect x="14.6" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>nicomachus_sum_of_cubes_is_the_square_of_the_triangular_number_for_every_n — 1 cases</title></rect><rect x="23.2" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_sum_of_fifth_powers_has_the_closed_form_for_every_n — 1 cases</title></rect><rect x="31.8" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_euler_characteristic_of_a_genus_g_surface_for_every_g — 1 cases</title></rect><rect x="40.4" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>a_repunit_has_the_residue_of_its_length_mod_three — 1 cases</title></rect><rect x="49.0" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>a_repunit_is_divisible_by_three_exactly_when_its_length_is_for_every_n — 1 cases</title></rect><rect x="57.6" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>repunit_of_a_sum — 1 cases</title></rect><rect x="66.2" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>repunits_repeat_mod_seven_every_six_digits — 1 cases</title></rect><rect x="74.8" y="410.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>a_repunit_has_the_residue_of_its_length_mod_six_mod_seven — 1 cases</title></rect><rect x="6.0" y="402.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>a_repunit_is_divisible_by_seven_exactly_when_six_divides_its_length_for_every_n — 1 cases</title></rect><rect x="14.6" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>euclids_form_is_perfect_at_every_mersenne_prime_to_seven — 4 cases</title></rect><rect x="23.2" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_mersenne_hypothesis_is_real_at_eleven — 1 cases</title></rect><rect x="31.8" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_amicable_pair_is_mutual_and_neither_is_perfect — 1 cases</title></rect><rect x="40.4" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_primitive_roots_mod_nine_are_exactly_two_and_five — 2 cases</title></rect><rect x="49.0" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_units_of_z9_form_three_pairs_summing_to_nine — 1 cases</title></rect><rect x="57.6" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_multiplication_table_of_the_z9_units_is_a_latin_square — 1 cases</title></rect><rect x="66.2" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>three_is_a_primitive_root_mod_seven_and_seven_is_six_plus_one — 7 cases</title></rect><rect x="74.8" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_z9_unit_group_splits_as_reflection_times_trinity — 1 cases</title></rect><rect x="6.0" y="393.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_inverse_map_permutes_the_units_and_is_an_involution — 1 cases</title></rect><rect x="14.6" y="393.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>consecutive_farey_neighbours_have_unit_determinant_and_bracket_their_mediant — 1 cases</title></rect><rect x="23.2" y="393.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_units_are_three_regular_under_doubling_halving_and_reflection — 1 cases</title></rect><rect x="31.8" y="393.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>a_knight_has_exactly_eight_leaps_and_every_one_flips_the_colour — 1 cases</title></rect><rect x="40.4" y="393.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_partition_and_bell_numbers_count_what_they_claim_to_count — 6 cases</title></rect><rect x="49.0" y="393.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_unit_graph_is_complete_bipartite_between_the_two_tetrahedra — 1 cases</title></rect><rect x="57.6" y="393.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>elementary_settles_its_range — 1 cases</title></rect><rect x="66.2" y="393.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_interior_and_exterior_angles_are_n_straight_angles_for_every_n — 1 cases</title></rect><rect x="74.8" y="393.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>a_product_of_consecutive_numbers_is_even — 1 cases</title></rect><rect x="6.0" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>eight_times_a_triangular_number_plus_one_is_an_odd_square_for_every_n — 1 cases</title></rect><rect x="14.6" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_lucas_numbers_are_the_sum_of_the_neighbouring_fibonaccis_for_every_n — 1 cases</title></rect><rect x="23.2" y="384.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_gases_are_two_to_one_and_consume_each_other_exactly — 1 cases</title></rect><rect x="31.8" y="384.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>one_litre_split_returns_one_litre_burnt — 1 cases</title></rect><rect x="40.4" y="384.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>only_oxy_hydrogen_burns_without_admitting_nitrogen — 1 cases</title></rect><rect x="49.0" y="384.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>splitting_then_burning_is_the_identity_at_every_ledger_value — 1 cases</title></rect><rect x="57.6" y="384.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>two_parts_in_three_is_two_thirds_at_every_scale_for_every_m — 1 cases</title></rect><rect x="66.2" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>flt_all_primes_under_thirty — 1 cases</title></rect><rect x="74.8" y="384.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>wilson_all_primes_under_thirty — 1 cases</title></rect><rect x="6.0" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>xor_is_parity_up_to_eight_bits — 8 cases</title></rect><rect x="14.6" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>nat_div_is_a_total_function_returning_zero_at_a_zero_divisor — 1 cases</title></rect><rect x="23.2" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>at_a_zero_divisor_the_identity_is_carried_by_the_remainder — 1 cases</title></rect><rect x="31.8" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>demorgan_holds_at_every_arity_to_eight — 7 cases</title></rect><rect x="40.4" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>multiplication_permutes_z9_at_exactly_the_units — 8 cases</title></rect><rect x="49.0" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>addition_generates_z9_at_exactly_the_units — 8 cases</title></rect><rect x="57.6" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>an_inverse_mod_nine_exists_at_exactly_the_units — 9 cases</title></rect><rect x="66.2" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_inverse_of_a_unit_mod_nine_is_its_fifth_power — 1 cases</title></rect><rect x="74.8" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>and_the_converse_fails_at_six — 1 cases</title></rect><rect x="6.0" y="367.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_order_of_every_unit_mod_nine_divides_six — 1 cases</title></rect><rect x="14.6" y="367.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>there_are_exactly_five_platonic_solids_and_each_satisfies_eulers_formula — 1 cases</title></rect><rect x="23.2" y="367.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_involutions_are_counted_by_the_telephone_numbers — 6 cases</title></rect><rect x="31.8" y="367.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>invOf_is_an_inverse_and_an_involution_on_the_units — 9 cases</title></rect><rect x="40.4" y="367.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>families_settle_their_ranges — 1 cases</title></rect><rect x="49.0" y="367.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_powers_of_two_sum_to_one_less_than_the_next_for_every_n — 1 cases</title></rect><rect x="57.6" y="367.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>square_of_successor — 1 cases</title></rect><rect x="66.2" y="367.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_first_n_odd_numbers_sum_to_n_squared_for_every_n — 1 cases</title></rect><rect x="74.8" y="367.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>cassinis_identity_for_every_m — 1 cases</title></rect><rect x="6.0" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>a_sum_over_one_to_n_plus_one_adds_the_last_term — 1 cases</title></rect><rect x="14.6" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_numbers_sum_to_their_closed_form_for_every_n — 1 cases</title></rect><rect x="23.2" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_squares_sum_to_their_closed_form_for_every_n — 1 cases</title></rect><rect x="31.8" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_cubes_sum_to_their_closed_form_for_every_n — 1 cases</title></rect><rect x="40.4" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_fourth_powers_sum_to_their_closed_form_for_every_n — 1 cases</title></rect><rect x="49.0" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_fifth_powers_sum_to_their_closed_form_for_every_n — 1 cases</title></rect><rect x="57.6" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>power_sums_match_their_closed_forms_for_every_n — 1 cases</title></rect><rect x="66.2" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_sums_of_triangular_numbers_are_the_tetrahedral_numbers_for_every_n — 1 cases</title></rect><rect x="74.8" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_doubling_flow_repeats_every_six_steps — 1 cases</title></rect><rect x="6.0" y="350.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_doubling_flow_is_its_first_six_steps — 1 cases</title></rect><rect x="14.6" y="350.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>navier_stokes_flow_is_bounded_for_every_step — 1 cases</title></rect><rect x="23.2" y="350.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>hash_a_seed_zero — 1 cases</title></rect><rect x="31.8" y="350.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>hash_ab_seed_zero — 2 cases</title></rect><rect x="40.4" y="350.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>hash_a_seed_golden — 1 cases</title></rect><rect x="49.0" y="350.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>hash_uuidna_seed_zero — 6 cases</title></rect><rect x="57.6" y="350.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>hash_is_not_the_identity — 1 cases</title></rect><rect x="66.2" y="350.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>hash_is_not_constant — 1 cases</title></rect><rect x="74.8" y="350.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>fnv_settles_its_range — 1 cases</title></rect><rect x="6.0" y="341.8" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_hash_is_order_sensitive — 4 cases</title></rect><rect x="14.6" y="341.8" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_empty_input_is_still_mixed — 1 cases</title></rect><rect x="23.2" y="341.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>demorgan_all_widths — 7 cases</title></rect><rect x="31.8" y="341.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>invpow_is_fifth_power_all_units — 6 cases</title></rect><rect x="40.4" y="341.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>cyclic_units_have_a_primitive_root — 6 cases</title></rect><rect x="49.0" y="341.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>decimal_period_is_the_order_of_ten — 8 cases</title></rect><rect x="57.6" y="341.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triad_is_closed_under_double — 9 cases</title></rect><rect x="66.2" y="341.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triad_is_closed_under_triple — 9 cases</title></rect><rect x="74.8" y="341.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triad_is_closed_under_quadruple — 9 cases</title></rect><rect x="6.0" y="333.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>tetA_is_closed_under_quadruple — 9 cases</title></rect><rect x="14.6" y="333.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>tetB_is_closed_under_quadruple — 9 cases</title></rect><rect x="23.2" y="333.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triad_is_closed_under_negate — 9 cases</title></rect><rect x="31.8" y="333.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>cubes_is_closed_under_negate — 9 cases</title></rect><rect x="40.4" y="333.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>tetA_is_closed_under_square — 9 cases</title></rect><rect x="49.0" y="333.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>cubes_is_closed_under_square — 9 cases</title></rect><rect x="57.6" y="333.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triad_is_closed_under_fourth — 9 cases</title></rect><rect x="66.2" y="333.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>tetA_is_closed_under_fourth — 9 cases</title></rect><rect x="74.8" y="333.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>cubes_is_closed_under_fourth — 9 cases</title></rect><rect x="6.0" y="324.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triad_is_closed_under_sixth — 9 cases</title></rect><rect x="14.6" y="324.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>tetA_is_closed_under_sixth — 9 cases</title></rect><rect x="23.2" y="324.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>cubes_is_closed_under_sixth — 9 cases</title></rect><rect x="31.8" y="324.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triad_is_closed_under_quintuple — 9 cases</title></rect><rect x="40.4" y="324.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triad_is_closed_under_sextuple — 9 cases</title></rect><rect x="49.0" y="324.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triad_is_closed_under_septuple — 9 cases</title></rect><rect x="57.6" y="324.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>tetA_is_closed_under_septuple — 9 cases</title></rect><rect x="66.2" y="324.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>tetB_is_closed_under_septuple — 9 cases</title></rect><rect x="74.8" y="324.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triad_is_closed_under_octuple — 9 cases</title></rect><rect x="6.0" y="316.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>cubes_is_closed_under_octuple — 9 cases</title></rect><rect x="14.6" y="316.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>double_is_involutive_on_triad — 3 cases</title></rect><rect x="23.2" y="316.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>quadruple_is_involutive_on_triad — 3 cases</title></rect><rect x="31.8" y="316.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>square_is_involutive_on_tetA — 3 cases</title></rect><rect x="40.4" y="316.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>square_is_involutive_on_squares — 4 cases</title></rect><rect x="49.0" y="316.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>cube_is_involutive_on_cubes — 3 cases</title></rect><rect x="57.6" y="316.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fourth_is_involutive_on_tetA — 3 cases</title></rect><rect x="66.2" y="316.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fourth_is_involutive_on_squares — 4 cases</title></rect><rect x="74.8" y="316.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fifth_is_involutive_on_units — 6 cases</title></rect><rect x="6.0" y="307.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fifth_is_involutive_on_orbit — 6 cases</title></rect><rect x="14.6" y="307.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fifth_is_involutive_on_tetA — 3 cases</title></rect><rect x="23.2" y="307.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fifth_is_involutive_on_tetB — 3 cases</title></rect><rect x="31.8" y="307.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fifth_is_involutive_on_squares — 4 cases</title></rect><rect x="40.4" y="307.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fifth_is_involutive_on_cubes — 3 cases</title></rect><rect x="49.0" y="307.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>quintuple_is_involutive_on_triad — 3 cases</title></rect><rect x="57.6" y="307.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>septuple_is_involutive_on_triad — 3 cases</title></rect><rect x="66.2" y="307.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triple_collapses_triad_to_one_value — 3 cases</title></rect><rect x="74.8" y="307.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triple_collapses_tetA_to_one_value — 3 cases</title></rect><rect x="6.0" y="298.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triple_collapses_tetB_to_one_value — 3 cases</title></rect><rect x="14.6" y="298.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>cube_collapses_triad_to_one_value — 3 cases</title></rect><rect x="23.2" y="298.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>cube_collapses_tetA_to_one_value — 3 cases</title></rect><rect x="31.8" y="298.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>cube_collapses_tetB_to_one_value — 3 cases</title></rect><rect x="40.4" y="298.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fourth_collapses_triad_to_one_value — 3 cases</title></rect><rect x="49.0" y="298.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fifth_collapses_triad_to_one_value — 3 cases</title></rect><rect x="57.6" y="298.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>sixth_collapses_units_to_one_value — 6 cases</title></rect><rect x="66.2" y="298.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>sixth_collapses_triad_to_one_value — 3 cases</title></rect><rect x="74.8" y="298.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>sixth_collapses_orbit_to_one_value — 6 cases</title></rect><rect x="6.0" y="290.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>sixth_collapses_tetA_to_one_value — 3 cases</title></rect><rect x="14.6" y="290.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>sixth_collapses_tetB_to_one_value — 3 cases</title></rect><rect x="23.2" y="290.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>sextuple_collapses_triad_to_one_value — 3 cases</title></rect><rect x="31.8" y="290.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>sextuple_collapses_tetA_to_one_value — 3 cases</title></rect><rect x="40.4" y="290.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>sextuple_collapses_tetB_to_one_value — 3 cases</title></rect><rect x="49.0" y="290.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>yang_mills_spectral_gap — 6 cases</title></rect><rect x="57.6" y="290.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>birch_swinnerton_dyer_vanishing — 9 cases</title></rect><rect x="66.2" y="290.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_sequence_is_its_named_parts_and_closes — 3 cases</title></rect><rect x="74.8" y="290.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>there_are_2620_involutions_of_nine — 1 cases</title></rect><rect x="6.0" y="281.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_fuel_was_not_the_limit — 1 cases</title></rect><rect x="14.6" y="281.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>every_involution_fixes_at_least_one_point — 1 cases</title></rect><rect x="23.2" y="281.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_fixed_points_are_always_odd — 1 cases</title></rect><rect x="31.8" y="281.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>no_single_point_is_fixed_by_all — 1 cases</title></rect><rect x="40.4" y="281.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_constant_sum_is_rare — 1 cases</title></rect><rect x="49.0" y="281.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>so_involutions_are_not_all_harmonic_in_that_sense — 1 cases</title></rect><rect x="57.6" y="281.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_coins_reflection_is_harmonic_and_is_one_of_the_ninety — 1 cases</title></rect><rect x="66.2" y="281.6" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>a_seal_is_128_bits — 1 cases</title></rect><rect x="74.8" y="281.6" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>membership_grows_by_one_seal_per_doubling — 1 cases</title></rect><rect x="6.0" y="273.0" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>membership_is_logarithmic_not_linear — 1 cases</title></rect><rect x="14.6" y="273.0" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_967_receipt_case — 1 cases</title></rect><rect x="23.2" y="273.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_si_fixes_seven_distinct_nonzero_constants — 1 cases</title></rect><rect x="31.8" y="273.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>travel_at_one_returns_the_defined_constant — 1 cases</title></rect><rect x="40.4" y="273.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_second_returns_from_the_metre_and_the_period_at_every_duration — 1 cases</title></rect><rect x="49.0" y="273.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>travel_and_periods_at_one_return_their_constants — 1 cases</title></rect><rect x="57.6" y="273.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_roots_of_the_seven — 7 cases</title></rect><rect x="66.2" y="273.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_root_moves_with_the_unit_so_it_is_not_about_light — 1 cases</title></rect><rect x="74.8" y="273.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_definitions_are_seven_and_travel_fixes_zero — 1 cases</title></rect><rect x="6.0" y="264.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_second_returns_from_the_metre_and_the_period_for_every_s — 1 cases</title></rect><rect x="14.6" y="264.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>bool_demorgan1 — 4 cases</title></rect><rect x="23.2" y="264.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>bool_demorgan2 — 4 cases</title></rect><rect x="31.8" y="264.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>bool_distributivity — 8 cases</title></rect><rect x="40.4" y="264.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>bool_absorption — 4 cases</title></rect><rect x="49.0" y="264.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>merkaba_cube_q3 — 1 cases</title></rect><rect x="57.6" y="264.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>cover_rotation_full_circle — 9 cases</title></rect><rect x="66.2" y="264.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>fib_trinity_horizon — 1 cases</title></rect><rect x="74.8" y="264.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>arts_nine_hues_distinct — 9 cases</title></rect><rect x="6.0" y="255.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>trial_units_group — 6 cases</title></rect><rect x="14.6" y="255.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>trial_zero_divisors — 1 cases</title></rect><rect x="23.2" y="255.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>trial_zero_no_inverse — 9 cases</title></rect><rect x="31.8" y="255.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>chess_diagonals_15 — 1 cases</title></rect><rect x="40.4" y="255.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>tarot_78_cards — 1 cases</title></rect><rect x="49.0" y="255.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>tarot_minor_4x14 — 1 cases</title></rect><rect x="57.6" y="255.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>tarot_digital_roots — 1 cases</title></rect><rect x="66.2" y="255.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>gf4_size — 4 cases</title></rect><rect x="74.8" y="255.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_digital_root — 6 cases</title></rect><rect x="6.0" y="247.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>harmonic_octave_2_1 — 1 cases</title></rect><rect x="14.6" y="247.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>harmonic_pythagorean_comma — 1 cases</title></rect><rect x="23.2" y="247.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_seven — 1 cases</title></rect><rect x="31.8" y="247.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_eight — 1 cases</title></rect><rect x="40.4" y="247.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_creation_week — 1 cases</title></rect><rect x="49.0" y="247.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_moduli_dimensions_are_three_g_minus_three_and_six_g_minus_six — 1 cases</title></rect><rect x="57.6" y="247.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>genus2_moduli_dim — 1 cases</title></rect><rect x="66.2" y="247.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>genus2_hyperelliptic — 1 cases</title></rect><rect x="74.8" y="247.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>genus2_h1_symplectic — 1 cases</title></rect><rect x="6.0" y="238.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_seven_is_six_plus_one — 6 cases</title></rect><rect x="14.6" y="238.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_units_sum_and_product — 6 cases</title></rect><rect x="23.2" y="238.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_432_factors — 1 cases</title></rect><rect x="31.8" y="238.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_triangular_45_is_base — 9 cases</title></rect><rect x="40.4" y="238.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>kaprekar_constants_digitroot_nine — 1 cases</title></rect><rect x="49.0" y="238.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_three_four_five_right_triangle_is_the_first_pythagorean_triple — 1 cases</title></rect><rect x="57.6" y="238.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_regular_pentagon_angles_are_the_heart_seventy_two_and_hundred_eight — 1 cases</title></rect><rect x="66.2" y="238.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_cyclic_number_142857_is_the_repetend_of_one_seventh — 1 cases</title></rect><rect x="74.8" y="238.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>_142857_times_seven_is_six_nines — 1 cases</title></rect><rect x="6.0" y="230.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>midy_the_two_halves_of_142857_sum_to_nines — 1 cases</title></rect><rect x="14.6" y="230.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_digital_root_of_seven_to_the_k_has_period_three — 1 cases</title></rect><rect x="23.2" y="230.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>seven_divides_the_repunit_of_length_six — 1 cases</title></rect><rect x="31.8" y="230.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>two_to_the_eighth_is_two_hundred_fifty_six_a_byte — 1 cases</title></rect><rect x="40.4" y="230.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>two_to_the_tenth_is_1024_the_harmonic_ledger — 1 cases</title></rect><rect x="49.0" y="230.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_regular_nonagon_exterior_angle_is_the_a432_step — 1 cases</title></rect><rect x="57.6" y="230.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_digits_one_to_nine_sum_to_forty_five_rooting_to_nine — 9 cases</title></rect><rect x="66.2" y="230.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>nine_is_the_base_and_the_trinity_squared — 1 cases</title></rect><rect x="74.8" y="230.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>six_is_the_third_triangular_number — 3 cases</title></rect><rect x="6.0" y="221.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_regular_hexagon_exterior_angle_is_the_gold_string — 1 cases</title></rect><rect x="14.6" y="221.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_doubling_orbit_reflection_pairs_sum_to_nine — 1 cases</title></rect><rect x="23.2" y="221.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>five_is_the_inverse_of_two_so_halving_reverses_the_orbit — 1 cases</title></rect><rect x="31.8" y="221.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>dna_is_the_version_itself — 1 cases</title></rect><rect x="40.4" y="221.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>contribute_two_to_save_sixty_four — 6 cases</title></rect><rect x="49.0" y="221.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>genetic_code_is_the_octave_squared — 1 cases</title></rect><rect x="57.6" y="221.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>sixty_one_sense_three_stop_codons — 1 cases</title></rect><rect x="66.2" y="221.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>six_reading_frames — 1 cases</title></rect><rect x="74.8" y="221.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>genesis_1_the_unit — 9 cases</title></rect><rect x="6.0" y="212.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>genesis_8_the_octave — 1 cases</title></rect><rect x="14.6" y="212.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>genesis_64_the_codon — 1 cases</title></rect><rect x="23.2" y="212.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>diamond_fixed_point_is_zero_entropy — 1 cases</title></rect><rect x="31.8" y="212.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_address_is_shipped_not_the_payload — 1 cases</title></rect><rect x="40.4" y="212.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_harmonic_band_thirty_to_ninety — 1 cases</title></rect><rect x="49.0" y="212.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>sixty_and_ninety_partition_the_quadrant — 1 cases</title></rect><rect x="57.6" y="212.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_hexagon_and_the_square_metrics — 1 cases</title></rect><rect x="66.2" y="212.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a_theorem_responds_in_a_receipt — 1 cases</title></rect><rect x="74.8" y="212.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>involution_negation — 1 cases</title></rect><rect x="6.0" y="204.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a432_factors_as_two_to_the_fourth_times_three_cubed — 1 cases</title></rect><rect x="14.6" y="204.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a432_octave_doubling — 1 cases</title></rect><rect x="23.2" y="204.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>two_bits_thrice_make_the_codon — 1 cases</title></rect><rect x="31.8" y="204.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_skipper_navigates_by_angle — 1 cases</title></rect><rect x="40.4" y="204.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>cheap_to_factor_easy_to_verify — 1 cases</title></rect><rect x="49.0" y="204.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_cell_is_determined_by_content — 1 cases</title></rect><rect x="57.6" y="204.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>present_by_reference_fits_a_tiny_budget — 1 cases</title></rect><rect x="66.2" y="204.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a_cached_address_is_never_recomputed — 1 cases</title></rect><rect x="74.8" y="204.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a_decidable_domain_is_finite_and_coverable — 9 cases</title></rect><rect x="6.0" y="195.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_more_developed_the_more_cross_domain_reach — 1 cases</title></rect><rect x="14.6" y="195.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_full_superposition_has_nine_states — 9 cases</title></rect><rect x="23.2" y="195.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>forward_is_the_deterministic_compute — 1 cases</title></rect><rect x="31.8" y="195.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_cardinality_claims_hold_of_any_four_symbol_alphabet — 1 cases</title></rect><rect x="40.4" y="195.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a_reflexive_address_claim_holds_for_a_constant_function — 1 cases</title></rect><rect x="49.0" y="195.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>consecutive_squares_differ_by_the_odd_numbers — 1 cases</title></rect><rect x="57.6" y="195.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>every_multiple_of_three_four_five_is_pythagorean — 1 cases</title></rect><rect x="66.2" y="195.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_product_of_three_consecutive_numbers_is_even — 1 cases</title></rect><rect x="74.8" y="195.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_product_of_three_consecutive_numbers_is_a_multiple_of_three — 1 cases</title></rect><rect x="6.0" y="187.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_product_of_any_three_consecutive_integers_is_divisible_by_six_for_every_n — 1 cases</title></rect><rect x="14.6" y="187.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>repeated_doubling_is_the_power_of_two_for_every_k — 1 cases</title></rect><rect x="23.2" y="187.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_digitroot_is_residue_mod9_for_every_n — 1 cases</title></rect><rect x="31.8" y="187.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_nine_times_table_always_digital_roots_to_nine_for_every_k — 1 cases</title></rect><rect x="40.4" y="187.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_digital_root_has_the_residue_of_its_number — 1 cases</title></rect><rect x="49.0" y="187.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a_digital_root_lies_between_one_and_nine — 1 cases</title></rect><rect x="57.6" y="187.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>casting_out_nines_is_multiplicative_for_every_a_b — 1 cases</title></rect><rect x="66.2" y="187.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_moduli_dimensions_are_three_g_minus_three_and_six_g_minus_six_for_every_g — 1 cases</title></rect><rect x="74.8" y="187.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_three_classes_partition_z9 — 9 cases</title></rect><rect x="6.0" y="178.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_axis_is_closed_under_doubling — 1 cases</title></rect><rect x="14.6" y="178.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>doubling_counter_rotates_the_two_tetrahedra — 1 cases</title></rect><rect x="23.2" y="178.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_counter_rotation_has_period_two — 1 cases</title></rect><rect x="31.8" y="178.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_tetrahedra_residue_sums_cancel — 1 cases</title></rect><rect x="40.4" y="178.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>one_tetrahedron_covers_half_the_units — 1 cases</title></rect><rect x="49.0" y="178.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_cube_and_the_tetrahedron_count_out — 1 cases</title></rect><rect x="57.6" y="178.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>singleton_fold_is_the_leaf — 1 cases</title></rect><rect x="66.2" y="178.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_fold_of_any_single_leaf_is_that_leaf — 1 cases</title></rect><rect x="74.8" y="178.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>fold_is_order_independent_on_two — 1 cases</title></rect><rect x="6.0" y="169.8" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>merge_is_order_sensitive — 1 cases</title></rect><rect x="14.6" y="169.8" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>sorting_is_what_makes_the_fold_order_free — 1 cases</title></rect><rect x="23.2" y="169.8" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>merkle_settles_its_range — 1 cases</title></rect><rect x="31.8" y="169.8" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_permutation_generator_is_complete — 1 cases</title></rect><rect x="40.4" y="169.8" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>fold_is_order_independent_on_four — 1 cases</title></rect><rect x="49.0" y="169.8" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>fold_is_order_independent_on_three — 1 cases</title></rect><rect x="57.6" y="169.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>bouton_two_heaps_lost_iff_xor_zero — 1 cases</title></rect><rect x="66.2" y="169.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>bouton_lost_iff_heaps_equal — 1 cases</title></rect><rect x="74.8" y="169.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>lost_positions_are_exactly_the_diagonal — 1 cases</title></rect><rect x="6.0" y="161.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>grundy_of_a_single_heap_is_its_size — 1 cases</title></rect><rect x="14.6" y="161.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>grundy_of_two_heaps_is_the_xor — 1 cases</title></rect><rect x="23.2" y="161.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_xor_of_two_bits_is_their_sum_mod_two — 1 cases</title></rect><rect x="31.8" y="161.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>xor_commutes_at_every_fuel — 1 cases</title></rect><rect x="40.4" y="161.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>one_more_step_of_fuel_changes_nothing_once_it_exceeds_an_argument — 1 cases</title></rect><rect x="49.0" y="161.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>more_fuel_changes_nothing_once_it_exceeds_an_argument — 1 cases</title></rect><rect x="57.6" y="161.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>xor_reads_the_same_at_every_sufficient_fuel — 1 cases</title></rect><rect x="66.2" y="161.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a_number_xored_with_itself_is_zero_at_every_fuel — 1 cases</title></rect><rect x="74.8" y="161.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>xor_splits_off_its_lowest_bit — 1 cases</title></rect><rect x="6.0" y="152.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>xor_undoes_itself_when_the_fuel_suffices — 1 cases</title></rect><rect x="14.6" y="152.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>xor_is_commutative_for_every_a_b — 1 cases</title></rect><rect x="23.2" y="152.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>xor_zero_is_identity_for_every_a — 1 cases</title></rect><rect x="31.8" y="152.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>xor_is_its_own_inverse_for_every_a_b — 1 cases</title></rect><rect x="40.4" y="152.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>xor_is_the_sum_of_the_bits_plus_twice_the_xor_of_the_halves — 1 cases</title></rect><rect x="49.0" y="152.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>xor_is_associative_below_every_bound — 1 cases</title></rect><rect x="57.6" y="152.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>xor_is_associative_for_every_a_b_c — 1 cases</title></rect><rect x="66.2" y="152.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_nim_sum_is_a_gf2_vector_addition_for_every_a_b_c — 1 cases</title></rect><rect x="74.8" y="152.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>every_phenomenon_is_definitional_or_credited — 1 cases</title></rect><rect x="6.0" y="144.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>seven_definitional_and_two_credited — 1 cases</title></rect><rect x="14.6" y="144.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_definitional_half_is_the_whole_si — 1 cases</title></rect><rect x="23.2" y="144.0" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_table_is_closed_and_that_is_all_this_file_decides — 1 cases</title></rect><rect x="31.8" y="144.0" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>novelty_is_claimed_only_where_a_search_was_performed — 1 cases</title></rect><rect x="40.4" y="144.0" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>this_deposit_claims_no_novelty_today — 1 cases</title></rect><rect x="49.0" y="144.0" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>the_restated_sources_are_named_and_claim_nothing — 1 cases</title></rect><rect x="57.6" y="144.0" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>an_unsearched_source_claims_nothing — 1 cases</title></rect><rect x="66.2" y="144.0" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>every_source_is_classified — 1 cases</title></rect><rect x="74.8" y="144.0" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>the_kinds_cover_every_source — 1 cases</title></rect><rect x="6.0" y="135.4" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>some_sources_are_unsearched — 1 cases</title></rect><rect x="14.6" y="135.4" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>zero_claims_is_not_full_attribution — 1 cases</title></rect><rect x="23.2" y="135.4" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>novelty_is_claimed_of_no_source — 1 cases</title></rect><rect x="31.8" y="135.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>perms_of_four_is_factorial — 4 cases</title></rect><rect x="40.4" y="135.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>superposition_collapses_to_one — 4 cases</title></rect><rect x="49.0" y="135.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_receipt_is_not_injective — 1 cases</title></rect><rect x="57.6" y="135.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_uncanonicalised_fold_gives_many_answers — 4 cases</title></rect><rect x="66.2" y="135.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>quantum_settles_its_domain_totally — 1 cases</title></rect><rect x="74.8" y="135.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_ghz_x_support_is_exactly_the_even_parity_strings — 8 cases</title></rect><rect x="6.0" y="126.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>it_is_half_of_the_eight — 8 cases</title></rect><rect x="14.6" y="126.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>exhaustion_never_reaches_its_own_bound — 1 cases</title></rect><rect x="23.2" y="126.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_successor_of_every_bound_lies_outside — 1 cases</title></rect><rect x="31.8" y="126.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>doubling_the_domain_leaves_the_same_hole — 1 cases</title></rect><rect x="40.4" y="126.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_successor_leaves_every_domain_and_the_predecessor_returns — 1 cases</title></rect><rect x="49.0" y="126.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_predecessor_returns_every_successor — 1 cases</title></rect><rect x="57.6" y="126.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>exhaustion_never_reaches_its_own_bound_for_every_n — 1 cases</title></rect><rect x="66.2" y="126.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_successor_of_every_bound_lies_outside_for_every_n — 1 cases</title></rect><rect x="74.8" y="126.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>doubling_the_domain_leaves_the_same_hole_for_every_n — 1 cases</title></rect><rect x="6.0" y="118.2" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>units_sum_zero — 1 cases</title></rect><rect x="14.6" y="118.2" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>triad_nilpotent — 1 cases</title></rect><rect x="23.2" y="118.2" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>triad_sum_zero — 1 cases</title></rect><rect x="31.8" y="118.2" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>units_product_neg1 — 1 cases</title></rect><rect x="40.4" y="118.2" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>order_of_2_is_6 — 5 cases</title></rect><rect x="49.0" y="118.2" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>unit_exp_id_k6 — 1 cases</title></rect><rect x="57.6" y="118.2" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>unit_exp_id_k12 — 1 cases</title></rect><rect x="66.2" y="118.2" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>unit_exp_id_k18 — 1 cases</title></rect><rect x="74.8" y="118.2" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>powperm_k5 — 1 cases</title></rect><rect x="6.0" y="109.6" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>powperm_k7 — 1 cases</title></rect><rect x="14.6" y="109.6" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>qr_u1 — 9 cases</title></rect><rect x="23.2" y="109.6" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>qr_u4 — 9 cases</title></rect><rect x="31.8" y="109.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_ledger_reversal_cases — 1 cases</title></rect><rect x="40.4" y="109.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>reversal_settles_its_range — 1 cases</title></rect><rect x="49.0" y="109.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>foldl_add_start — 1 cases</title></rect><rect x="57.6" y="109.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_digits_sum_to_the_number_mod_nine_when_the_fuel_covers_them — 1 cases</title></rect><rect x="66.2" y="109.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a_number_is_below_ten_to_its_own_successor — 1 cases</title></rect><rect x="74.8" y="109.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_digit_sum_has_the_residue_of_the_number_mod_nine_for_every_n — 1 cases</title></rect><rect x="6.0" y="101.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>folding_by_ten_keeps_the_residue_of_the_digit_sum — 1 cases</title></rect><rect x="14.6" y="101.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>reversal_keeps_the_residue_mod_nine_for_every_n — 1 cases</title></rect><rect x="23.2" y="101.0" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>claims_exactly_what_arises_without_formality — 1 cases</title></rect><rect x="31.8" y="101.0" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>the_claimed_are_copyright_moral_rights_and_the_database — 3 cases</title></rect><rect x="40.4" y="101.0" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>the_claimed_set_is_exactly_those_three_and_the_unregistered_mark — 4 cases</title></rect><rect x="49.0" y="101.0" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>the_unclaimed_are_the_registry_the_excluded_and_the_unownable — 4 cases</title></rect><rect x="57.6" y="101.0" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>no_right_that_needs_a_registry_act_is_claimed — 1 cases</title></rect><rect x="66.2" y="101.0" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>no_excluded_subject_matter_is_claimed — 1 cases</title></rect><rect x="74.8" y="101.0" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>nothing_incapable_of_ownership_is_claimed — 1 cases</title></rect><rect x="6.0" y="92.4" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>the_enumeration_is_complete_and_unduplicated — 9 cases</title></rect><rect x="14.6" y="92.4" width="7" height="7" rx="1.2" fill="hsl(40 62% 52%)"><title>rights_settles_its_range — 1 cases</title></rect><rect x="23.2" y="92.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>three_five_eight_are_consecutive — 1 cases</title></rect><rect x="31.8" y="92.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>cassinis_identity_for_every_m — 1 cases</title></rect><rect x="40.4" y="92.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_verify_path_is_the_exponent — 1 cases</title></rect><rect x="49.0" y="92.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_gap_widens_with_every_doubling — 1 cases</title></rect><rect x="57.6" y="92.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>no_constant_factor_accounts_for_the_gap — 1 cases</title></rect><rect x="66.2" y="92.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_microseconds_return_from_the_nanoseconds_at_every_count — 1 cases</title></rect><rect x="74.8" y="92.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_advantage_is_the_count_not_the_operation — 1 cases</title></rect><rect x="6.0" y="83.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_break_even_is_the_ratio_of_verifications — 1 cases</title></rect><rect x="14.6" y="83.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_width_is_the_ceiling_of_128_bits_over_the_symbol — 8 cases</title></rect><rect x="23.2" y="83.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>each_pair_is_two_consecutive_units — 1 cases</title></rect><rect x="31.8" y="83.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>every_token_is_a_multiple_of_three — 1 cases</title></rect><rect x="40.4" y="83.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_tokens_are_three_times_these — 7 cases</title></rect><rect x="49.0" y="83.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>addition_and_multiplication_stay_inside — 1 cases</title></rect><rect x="57.6" y="83.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>subtraction_stays_inside — 1 cases</title></rect><rect x="66.2" y="83.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>division_is_the_operation_that_leaves — 1 cases</title></rect><rect x="74.8" y="83.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_roots_are_the_singles — 7 cases</title></rect><rect x="6.0" y="75.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>every_root_is_a_single — 1 cases</title></rect><rect x="14.6" y="75.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_exhaustible_tokens_are_those_six_divides — 4 cases</title></rect><rect x="23.2" y="75.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_rest_halt_on_the_generator — 3 cases</title></rect><rect x="31.8" y="75.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>every_token_is_void_bound_or_halts_on_three — 1 cases</title></rect><rect x="40.4" y="75.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>inside_this_ideal_the_bare_coin_sorts_as_the_scaled_one — 1 cases</title></rect><rect x="49.0" y="75.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>a_seal_divides_into_payments_and_multiplies_back — 8 cases</title></rect><rect x="57.6" y="75.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_coin_step_and_the_coins_are_inverse_for_every_c — 1 cases</title></rect><rect x="66.2" y="75.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>units_are_six — 6 cases</title></rect><rect x="74.8" y="75.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>units_count — 1 cases</title></rect><rect x="6.0" y="66.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>hasinv_units — 1 cases</title></rect><rect x="14.6" y="66.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>hasinv_triad_not — 3 cases</title></rect><rect x="23.2" y="66.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>selfinv_exactly_one_and_eight — 2 cases</title></rect><rect x="31.8" y="66.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>euler_units_pow_six — 1 cases</title></rect><rect x="40.4" y="66.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>invpow_is_u_to_the_fifth — 1 cases</title></rect><rect x="49.0" y="66.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>powsum_zero_at_six — 1 cases</title></rect><rect x="57.6" y="66.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>powsum_zero_at_one — 1 cases</title></rect><rect x="66.2" y="66.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>mulperm_iff_unit — 1 cases</title></rect><rect x="74.8" y="66.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>addgen_iff_coprime — 1 cases</title></rect><rect x="6.0" y="58.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>selfneg_only_zero — 1 cases</title></rect><rect x="14.6" y="58.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>orbit_closes — 1 cases</title></rect><rect x="23.2" y="58.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>orbit_distinct — 6 cases</title></rect><rect x="31.8" y="58.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>orbit_covers_units — 6 cases</title></rect><rect x="40.4" y="58.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_orbit_step_is_read_back_by_its_log — 6 cases</title></rect><rect x="49.0" y="58.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>triad_squares_vanish — 1 cases</title></rect><rect x="57.6" y="58.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>add_group — 1 cases</title></rect><rect x="66.2" y="58.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>neg_involution — 1 cases</title></rect><rect x="74.8" y="58.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>z9_settles_its_domain_totally — 1 cases</title></rect><rect x="6.0" y="49.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>five_is_not_a_square_mod_nine — 1 cases</title></rect><rect x="14.6" y="49.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>cubes_land_exactly_in_zero_one_eight — 9 cases</title></rect><rect x="23.2" y="49.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>primitive_roots_are_exactly_two_and_five — 2 cases</title></rect><rect x="31.8" y="49.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>primitive_root_iff_generates_the_units — 2 cases</title></rect><rect x="40.4" y="49.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_orders_of_the_units_are_exact — 1 cases</title></rect><rect x="49.0" y="49.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_reflected_orbit_covers_the_whole_triad — 3 cases</title></rect><rect x="57.6" y="49.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>reflection_splits_the_orbit_in_half — 9 cases</title></rect><rect x="66.2" y="49.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_crossing_pairs_are_one_four_seven — 9 cases</title></rect><rect x="74.8" y="49.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>reflection_is_injective_on_the_orbit — 1 cases</title></rect><rect x="6.0" y="40.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>reflection_alone_reaches_only_two — 1 cases</title></rect><rect x="14.6" y="40.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>doubling_and_reflection_together_reach_every_residue — 1 cases</title></rect><rect x="23.2" y="40.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>every_residue_is_reachable_from_one — 9 cases</title></rect><rect x="31.8" y="40.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_diameter_is_exactly_four — 1 cases</title></rect><rect x="40.4" y="40.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_frontier_grows_by_two_each_round — 1 cases</title></rect><rect x="49.0" y="40.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>product_of_the_units_is_minus_one — 6 cases</title></rect><rect x="57.6" y="40.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>three_five_eight_are_consecutive_fibonacci — 1 cases</title></rect><rect x="66.2" y="40.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>units_and_triad_partition_the_ring — 1 cases</title></rect><rect x="74.8" y="40.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>both_parts_sum_to_zero — 1 cases</title></rect><rect x="6.0" y="32.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>doubling_has_period_six_for_every_k — 1 cases</title></rect><rect x="14.6" y="32.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>orbit_digital_roots_have_period_six_for_every_k — 1 cases</title></rect><rect x="23.2" y="32.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_doubling_orbit_is_read_from_the_exponent_mod_six — 1 cases</title></rect><rect x="31.8" y="32.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_orbit_never_meets_the_triad_for_every_k — 1 cases</title></rect><rect x="40.4" y="32.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>fibonacci_residues_mod_nine_repeat_every_twenty_four_steps — 1 cases</title></rect><rect x="49.0" y="32.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>pisano_period_mod_nine_is_twenty_four_for_every_k — 1 cases</title></rect><rect x="57.6" y="32.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_fuelled_gcd_is_the_gcd_when_the_fuel_exceeds_the_second_argument — 1 cases</title></rect><rect x="66.2" y="32.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>consecutive_fibonacci_numbers_are_coprime — 1 cases</title></rect><rect x="74.8" y="32.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>consecutive_fibonacci_are_coprime_for_every_n — 1 cases</title></rect><rect x="6.0" y="23.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>digital_root_agrees_with_the_residue_for_every_n — 1 cases</title></rect><rect x="14.6" y="23.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>digital_root_is_the_digit_sum_residue_for_every_n — 1 cases</title></rect><text x="42.7" y="455.4" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">1</text><text x="42.7" y="470.4" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">434</text><rect x="105.4" y="436.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>raw_bytes_of_a — 16 cases</title></rect><rect x="114.0" y="436.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>to_uuid_bytes_of_a — 16 cases</title></rect><rect x="122.6" y="436.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>to_uuid_bytes_of_uuidna — 16 cases</title></rect><rect x="131.2" y="436.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>addressing_is_injective_on_single_characters — 24 cases</title></rect><rect x="139.8" y="436.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_address_is_not_the_payload — 36 cases</title></rect><rect x="148.4" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_mobius_divisor_sum_is_the_identity — 30 cases</title></rect><rect x="157.0" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_derangement_recurrence_holds — 11 cases</title></rect><rect x="165.6" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>mantels_bound_is_n_squared_over_four — 20 cases</title></rect><rect x="174.2" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>every_number_is_a_sum_of_four_squares — 60 cases</title></rect><rect x="105.4" y="427.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_cantor_pairing_is_injective_and_covers_an_initial_segment — 36 cases</title></rect><rect x="114.0" y="427.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_euler_characteristic_of_a_genus_g_surface — 12 cases</title></rect><rect x="122.6" y="427.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_eisenstein_units_are_exactly_six — 49 cases</title></rect><rect x="131.2" y="427.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_count_of_primitive_roots_is_phi_of_phi — 59 cases</title></rect><rect x="139.8" y="427.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_order_spectrum_of_the_z9_units_realises_gauss_divisor_sum — 36 cases</title></rect><rect x="148.4" y="427.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_product_of_the_units_is_minus_one_exactly_where_gauss_says — 59 cases</title></rect><rect x="157.0" y="427.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>eight_times_a_triangular_number_plus_one_is_an_odd_square — 60 cases</title></rect><rect x="165.6" y="427.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_lucas_numbers_follow_their_recurrence_and_reach_their_named_values — 28 cases</title></rect><rect x="174.2" y="427.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_lucas_numbers_are_the_sum_of_the_neighbouring_fibonaccis — 28 cases</title></rect><rect x="105.4" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_pell_numbers_follow_their_recurrence_and_reach_their_named_values — 24 cases</title></rect><rect x="114.0" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_interior_and_exterior_angles_are_n_straight_angles — 30 cases</title></rect><rect x="122.6" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_golden_beatty_identity_holds_across_the_range — 40 cases</title></rect><rect x="131.2" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>any_yield_below_its_cost_reads_under_the_whole — 60 cases</title></rect><rect x="139.8" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_cost_per_litre_multiplies_back_to_the_cost — 20 cases</title></rect><rect x="148.4" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>a_part_and_its_rest_read_back_the_whole — 40 cases</title></rect><rect x="157.0" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_energy_per_litre_multiplies_back_to_the_energy — 30 cases</title></rect><rect x="165.6" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>a_ratio_and_its_reciprocal_multiply_back_to_the_whole — 40 cases</title></rect><rect x="174.2" y="419.2" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_loss_and_the_yield_read_back_the_input — 60 cases</title></rect><rect x="105.4" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>wilson_fails_at_composites — 20 cases</title></rect><rect x="114.0" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>pascal_rows_sum_to_powers_of_two — 12 cases</title></rect><rect x="122.6" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>pascal_alternating_sums_vanish — 11 cases</title></rect><rect x="131.2" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>totient_at_prime_powers — 12 cases</title></rect><rect x="139.8" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>geometric_series_all_bases — 40 cases</title></rect><rect x="148.4" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>division_identity_holds_across_the_range — 13 cases</title></rect><rect x="157.0" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>primality_is_decided_across_the_range — 17 cases</title></rect><rect x="165.6" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_units_are_cyclic_at_exactly_the_gauss_moduli — 17 cases</title></rect><rect x="174.2" y="410.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>geometric_series_across_bases_and_exponents — 77 cases</title></rect><rect x="105.4" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>totient_at_prime_powers_through_thirteen — 18 cases</title></rect><rect x="114.0" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_powers_of_a_unit_sum_to_zero_when_g_minus_one_is_invertible — 19 cases</title></rect><rect x="122.6" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_powers_of_two_sum_to_one_less_than_the_next — 41 cases</title></rect><rect x="131.2" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_squares_of_a_pascal_row_sum_to_the_central_binomial — 13 cases</title></rect><rect x="139.8" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>cassinis_identity_holds_across_the_range — 30 cases</title></rect><rect x="148.4" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_golden_convergents_are_fibonacci_ratios_with_unit_determinant — 25 cases</title></rect><rect x="157.0" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_catalan_recurrence_matches_the_binomial_formula — 13 cases</title></rect><rect x="165.6" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_pisano_period_of_nine_is_twenty_four_and_every_modulus_to_twelve_has_one — 11 cases</title></rect><rect x="174.2" y="402.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>choose_is_invariant_under_the_involution_k_to_n_minus_k — 13 cases</title></rect><rect x="105.4" y="393.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>hash_is_deterministic — 32 cases</title></rect><rect x="114.0" y="393.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>hash_is_injective_on_single_characters — 64 cases</title></rect><rect x="122.6" y="393.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_seed_separates — 16 cases</title></rect><rect x="131.2" y="393.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>hash_is_thirty_two_bit — 40 cases</title></rect><rect x="139.8" y="393.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>powsum_zero_odd_exponents — 54 cases</title></rect><rect x="148.4" y="393.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>powsum_nonzero_at_even_exponents — 18 cases</title></rect><rect x="157.0" y="393.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>mulperm_fails_at_the_triad — 18 cases</title></rect><rect x="165.6" y="393.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>power_sum_closed_forms — 30 cases</title></rect><rect x="174.2" y="393.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>invpow_fails_off_the_units — 18 cases</title></rect><rect x="105.4" y="384.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>units_is_closed_under_double — 36 cases</title></rect><rect x="114.0" y="384.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>orbit_is_closed_under_double — 36 cases</title></rect><rect x="122.6" y="384.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_double — 81 cases</title></rect><rect x="131.2" y="384.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_triple — 81 cases</title></rect><rect x="139.8" y="384.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>units_is_closed_under_quadruple — 36 cases</title></rect><rect x="148.4" y="384.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>orbit_is_closed_under_quadruple — 36 cases</title></rect><rect x="157.0" y="384.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_quadruple — 81 cases</title></rect><rect x="165.6" y="384.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>squares_is_closed_under_quadruple — 16 cases</title></rect><rect x="174.2" y="384.8" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>orbit_is_closed_under_negate — 36 cases</title></rect><rect x="105.4" y="376.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_negate — 81 cases</title></rect><rect x="114.0" y="376.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>units_is_closed_under_square — 36 cases</title></rect><rect x="122.6" y="376.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>orbit_is_closed_under_square — 36 cases</title></rect><rect x="131.2" y="376.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_square — 81 cases</title></rect><rect x="139.8" y="376.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>squares_is_closed_under_square — 16 cases</title></rect><rect x="148.4" y="376.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>units_is_closed_under_fourth — 36 cases</title></rect><rect x="157.0" y="376.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>orbit_is_closed_under_fourth — 36 cases</title></rect><rect x="165.6" y="376.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_fourth — 81 cases</title></rect><rect x="174.2" y="376.2" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>squares_is_closed_under_fourth — 16 cases</title></rect><rect x="105.4" y="367.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>units_is_closed_under_sixth — 36 cases</title></rect><rect x="114.0" y="367.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>orbit_is_closed_under_sixth — 36 cases</title></rect><rect x="122.6" y="367.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_sixth — 81 cases</title></rect><rect x="131.2" y="367.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>squares_is_closed_under_sixth — 16 cases</title></rect><rect x="139.8" y="367.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>units_is_closed_under_quintuple — 36 cases</title></rect><rect x="148.4" y="367.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>orbit_is_closed_under_quintuple — 36 cases</title></rect><rect x="157.0" y="367.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_quintuple — 81 cases</title></rect><rect x="165.6" y="367.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_sextuple — 81 cases</title></rect><rect x="174.2" y="367.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>units_is_closed_under_septuple — 36 cases</title></rect><rect x="105.4" y="359.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>orbit_is_closed_under_septuple — 36 cases</title></rect><rect x="114.0" y="359.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_septuple — 81 cases</title></rect><rect x="122.6" y="359.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>squares_is_closed_under_septuple — 16 cases</title></rect><rect x="131.2" y="359.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>units_is_closed_under_octuple — 36 cases</title></rect><rect x="139.8" y="359.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>orbit_is_closed_under_octuple — 36 cases</title></rect><rect x="148.4" y="359.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>all_is_closed_under_octuple — 81 cases</title></rect><rect x="157.0" y="359.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triple_carries_cubes_onto_triad — 27 cases</title></rect><rect x="165.6" y="359.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>negate_carries_tetA_onto_tetB — 27 cases</title></rect><rect x="174.2" y="359.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>negate_carries_tetB_onto_tetA — 27 cases</title></rect><rect x="105.4" y="350.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>square_carries_tetB_onto_tetA — 27 cases</title></rect><rect x="114.0" y="350.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fourth_carries_tetB_onto_tetA — 27 cases</title></rect><rect x="122.6" y="350.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>quintuple_carries_tetA_onto_tetB — 27 cases</title></rect><rect x="131.2" y="350.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>quintuple_carries_tetB_onto_tetA — 27 cases</title></rect><rect x="139.8" y="350.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>sextuple_carries_cubes_onto_triad — 27 cases</title></rect><rect x="148.4" y="350.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>octuple_carries_tetA_onto_tetB — 27 cases</title></rect><rect x="157.0" y="350.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>octuple_carries_tetB_onto_tetA — 27 cases</title></rect><rect x="165.6" y="350.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>p_vs_np_inverse_is_unique — 81 cases</title></rect><rect x="174.2" y="350.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>hodge_span_is_the_units — 81 cases</title></rect><rect x="105.4" y="341.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>poincare_single_closed_loop — 36 cases</title></rect><rect x="114.0" y="341.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_seven_rest_on_one_finite_structure — 81 cases</title></rect><rect x="122.6" y="341.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_origin_annihilates_and_never_joins_the_circuit — 81 cases</title></rect><rect x="131.2" y="341.8" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>more_payloads_than_addresses_must_collide — 17 cases</title></rect><rect x="139.8" y="341.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>three_on_the_triad_and_four_on_the_units — 18 cases</title></rect><rect x="148.4" y="341.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_seven_roots_miss_four_residues — 36 cases</title></rect><rect x="157.0" y="341.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_absent_residues_are_the_primes_below_nine — 36 cases</title></rect><rect x="165.6" y="341.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>and_a_change_of_unit_destroys_it — 36 cases</title></rect><rect x="174.2" y="341.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>add_group — 81 cases</title></rect><rect x="105.4" y="333.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>nopayload_avalanche — 64 cases</title></rect><rect x="114.0" y="333.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>chess_board_64 — 64 cases</title></rect><rect x="122.6" y="333.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>tarot_major_0_21 — 22 cases</title></rect><rect x="131.2" y="333.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>repeated_doubling_is_the_power_of_two — 21 cases</title></rect><rect x="139.8" y="333.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_nine_times_table_always_digital_roots_to_nine — 60 cases</title></rect><rect x="148.4" y="333.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>collapse_selects_one_state_deterministically — 16 cases</title></rect><rect x="157.0" y="333.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>generation_is_deterministic — 16 cases</title></rect><rect x="165.6" y="333.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>stacked_triangles_are_tetrahedral — 40 cases</title></rect><rect x="174.2" y="333.2" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>merge_agrees — 16 cases</title></rect><rect x="105.4" y="324.6" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>empty_fold_agrees — 16 cases</title></rect><rect x="114.0" y="324.6" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>pair_fold_agrees — 16 cases</title></rect><rect x="122.6" y="324.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>xor_zero_is_identity — 32 cases</title></rect><rect x="131.2" y="324.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>bouton_holds_at_every_heap_size_to_six — 49 cases</title></rect><rect x="139.8" y="324.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>receipt_is_order_invariant — 16 cases</title></rect><rect x="148.4" y="324.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>receipt_order_invariant_on_the_orbit — 36 cases</title></rect><rect x="157.0" y="324.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>naive_fold_is_not_order_invariant — 16 cases</title></rect><rect x="165.6" y="324.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_invariance_is_canonicalisation_not_physics — 16 cases</title></rect><rect x="174.2" y="324.6" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>a_classical_mixture_reaches_the_parity_ghz_never_does — 64 cases</title></rect><rect x="105.4" y="316.0" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>self_inverse_1_8 — 18 cases</title></rect><rect x="114.0" y="316.0" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>sum_1_to_9_zero — 81 cases</title></rect><rect x="122.6" y="316.0" width="7" height="7" rx="1.2" fill="hsl(80 62% 52%)"><title>doubling_digitroot_period6 — 36 cases</title></rect><rect x="131.2" y="316.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>reversal_is_not_the_identity — 90 cases</title></rect><rect x="139.8" y="316.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>palindromes_are_the_fixed_points — 90 cases</title></rect><rect x="148.4" y="316.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>emirps_exist_below_one_hundred — 90 cases</title></rect><rect x="157.0" y="316.0" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>reversal_does_not_preserve_primality — 90 cases</title></rect><rect x="165.6" y="316.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>cassini_at_even_indices — 20 cases</title></rect><rect x="174.2" y="316.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>cassini_at_odd_indices — 20 cases</title></rect><rect x="105.4" y="307.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>cassini_deviation_is_exactly_one — 20 cases</title></rect><rect x="114.0" y="307.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>lucas_mod_two_is_the_and_rule — 14 cases</title></rect><rect x="122.6" y="307.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>pisano_twentyfour_is_four_sixes — 30 cases</title></rect><rect x="131.2" y="307.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_measured_ratio_exceeds_the_counted_gap — 20 cases</title></rect><rect x="139.8" y="307.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>verification_grows_it_is_not_constant — 10 cases</title></rect><rect x="148.4" y="307.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_pairs_are_exactly_the_units_in_order — 60 cases</title></rect><rect x="157.0" y="307.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_coin_step_and_the_coins_are_inverse — 20 cases</title></rect><rect x="165.6" y="307.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>paying_and_refunding_coins_on_the_last_pair_round_trips — 27 cases</title></rect><rect x="174.2" y="307.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_orbit_turns_once_per_budget — 60 cases</title></rect><rect x="105.4" y="298.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>universal_centre_is_five — 10 cases</title></rect><rect x="114.0" y="298.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>universal_pairs_sum_to_ten — 11 cases</title></rect><rect x="122.6" y="298.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>universal_reflection_is_not_an_involution_above_ten — 10 cases</title></rect><rect x="131.2" y="298.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>universal_z9_reflection_permutes_the_units — 36 cases</title></rect><rect x="139.8" y="298.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>universal_millennium_reflection_escapes_the_units — 36 cases</title></rect><rect x="148.4" y="298.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>universal_reflection_is_the_vortex_reflection_shifted — 10 cases</title></rect><rect x="157.0" y="298.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>orbit_is_the_six — 36 cases</title></rect><rect x="165.6" y="298.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>triad_never_reaches_one — 12 cases</title></rect><rect x="174.2" y="298.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>squares_land_exactly_in_zero_one_four_seven — 16 cases</title></rect><rect x="105.4" y="290.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>doubling_has_period_six — 30 cases</title></rect><rect x="114.0" y="290.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>no_period_smaller_than_six — 60 cases</title></rect><rect x="122.6" y="290.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>orbit_digital_roots_have_period_six — 24 cases</title></rect><rect x="131.2" y="290.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>pisano_period_mod_nine_is_twenty_four — 30 cases</title></rect><rect x="139.8" y="290.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>fibonacci_recurrence_holds — 20 cases</title></rect><rect x="148.4" y="290.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>consecutive_fibonacci_are_coprime — 25 cases</title></rect><text x="142.1" y="455.4" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">10+</text><text x="142.1" y="470.4" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">159</text><rect x="204.8" y="436.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>distinct_inputs_give_distinct_addresses — 336 cases</title></rect><rect x="213.4" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>fibonacci_gcd_is_the_fibonacci_of_the_gcd — 196 cases</title></rect><rect x="222.0" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>legendres_three_square_theorem — 200 cases</title></rect><rect x="230.6" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>five_six_one_is_the_smallest_carmichael_number — 559 cases</title></rect><rect x="239.2" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_sum_of_fifth_powers_has_the_closed_form_asked_for — 380 cases</title></rect><rect x="247.8" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>wilsons_theorem_and_its_converse — 270 cases</title></rect><rect x="256.4" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>repunit_divisibility_by_three_and_seven — 324 cases</title></rect><rect x="265.0" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>odd_divisor_count_iff_perfect_square — 120 cases</title></rect><rect x="273.6" y="436.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_subtraction_game_loses_exactly_at_the_multiples_of_four — 369 cases</title></rect><rect x="204.8" y="427.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>an_odd_prime_is_a_sum_of_two_squares_exactly_when_it_is_one_mod_four — 197 cases</title></rect><rect x="213.4" y="427.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_hockey_stick_identity_holds_across_the_range — 209 cases</title></rect><rect x="222.0" y="427.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_two_to_one_is_forced_by_the_oxygen — 729 cases</title></rect><rect x="230.6" y="427.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_mass_balance_is_the_atom_balance — 729 cases</title></rect><rect x="239.2" y="427.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_atom_table_decides_the_balance — 729 cases</title></rect><rect x="247.8" y="427.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>two_parts_in_three_is_two_thirds_at_every_scale — 500 cases</title></rect><rect x="256.4" y="427.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>compression_scales_the_energy_per_litre_linearly — 100 cases</title></rect><rect x="265.0" y="427.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_residue_ratio_is_the_same_at_every_volume — 200 cases</title></rect><rect x="273.6" y="427.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_atoms_read_back_from_the_mass — 100 cases</title></rect><rect x="204.8" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>power_sums_match_their_closed_forms — 205 cases</title></rect><rect x="213.4" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_first_n_odd_numbers_sum_to_n_squared — 201 cases</title></rect><rect x="222.0" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_sums_of_triangular_numbers_are_the_tetrahedral_numbers — 101 cases</title></rect><rect x="230.6" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>polygonal_closed_forms_match_their_recurrences — 408 cases</title></rect><rect x="239.2" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_digit_square_iteration_reaches_one_or_four — 200 cases</title></rect><rect x="247.8" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>a_number_is_a_sum_of_two_squares_exactly_when_fermats_condition_holds — 200 cases</title></rect><rect x="256.4" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_first_three_power_sums_hold_to_two_hundred — 603 cases</title></rect><rect x="265.0" y="419.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>mulperm_iff_unit_all — 324 cases</title></rect><rect x="273.6" y="419.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>addgen_iff_coprime_all — 486 cases</title></rect><rect x="204.8" y="410.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>hasinv_iff_unit_all — 486 cases</title></rect><rect x="213.4" y="410.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>primality_agrees_with_trial_division — 520 cases</title></rect><rect x="222.0" y="410.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>double_carries_units_onto_orbit — 216 cases</title></rect><rect x="230.6" y="410.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>double_carries_orbit_onto_units — 216 cases</title></rect><rect x="239.2" y="410.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>triple_carries_all_onto_triad — 243 cases</title></rect><rect x="247.8" y="410.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>quadruple_carries_units_onto_orbit — 216 cases</title></rect><rect x="256.4" y="410.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>quadruple_carries_orbit_onto_units — 216 cases</title></rect><rect x="265.0" y="410.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>negate_carries_orbit_onto_units — 216 cases</title></rect><rect x="273.6" y="410.6" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>square_carries_units_onto_tetA — 108 cases</title></rect><rect x="204.8" y="402.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>square_carries_orbit_onto_tetA — 108 cases</title></rect><rect x="213.4" y="402.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>square_carries_all_onto_squares — 324 cases</title></rect><rect x="222.0" y="402.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>cube_carries_all_onto_cubes — 243 cases</title></rect><rect x="230.6" y="402.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fourth_carries_units_onto_tetA — 108 cases</title></rect><rect x="239.2" y="402.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fourth_carries_orbit_onto_tetA — 108 cases</title></rect><rect x="247.8" y="402.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fourth_carries_all_onto_squares — 324 cases</title></rect><rect x="256.4" y="402.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fifth_carries_units_onto_orbit — 216 cases</title></rect><rect x="265.0" y="402.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>fifth_carries_orbit_onto_units — 216 cases</title></rect><rect x="273.6" y="402.0" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>quintuple_carries_units_onto_orbit — 216 cases</title></rect><rect x="204.8" y="393.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>quintuple_carries_orbit_onto_units — 216 cases</title></rect><rect x="213.4" y="393.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>sextuple_carries_all_onto_triad — 243 cases</title></rect><rect x="222.0" y="393.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>septuple_carries_units_onto_orbit — 216 cases</title></rect><rect x="230.6" y="393.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>septuple_carries_orbit_onto_units — 216 cases</title></rect><rect x="239.2" y="393.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>octuple_carries_units_onto_orbit — 216 cases</title></rect><rect x="247.8" y="393.4" width="7" height="7" rx="1.2" fill="hsl(0 62% 52%)"><title>octuple_carries_orbit_onto_units — 216 cases</title></rect><rect x="256.4" y="393.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>riemann_reflection_and_heart — 100 cases</title></rect><rect x="265.0" y="393.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_address_does_not_determine_the_payload — 289 cases</title></rect><rect x="273.6" y="393.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>a_proof_is_smaller_than_its_set_across_the_octave — 255 cases</title></rect><rect x="204.8" y="384.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_second_returns_from_the_metre_and_the_period — 100 cases</title></rect><rect x="213.4" y="384.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_chain_scales — 121 cases</title></rect><rect x="222.0" y="384.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_digitroot_is_residue_mod9 — 200 cases</title></rect><rect x="230.6" y="384.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>there_are_infinitely_many_pythagorean_triples — 100 cases</title></rect><rect x="239.2" y="384.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_difference_of_consecutive_squares_is_the_odd_numbers — 501 cases</title></rect><rect x="247.8" y="384.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_product_of_any_three_consecutive_integers_is_divisible_by_six — 500 cases</title></rect><rect x="256.4" y="384.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>each_wave_is_a_local_pure_derivation — 576 cases</title></rect><rect x="265.0" y="384.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>vitepress_hosts_the_content_address — 144 cases</title></rect><rect x="273.6" y="384.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a_content_address_detects_any_change — 256 cases</title></rect><rect x="204.8" y="376.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>xor_is_its_own_inverse — 256 cases</title></rect><rect x="213.4" y="376.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>xor_is_commutative — 256 cases</title></rect><rect x="222.0" y="376.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>reversal_preserves_digit_sum — 300 cases</title></rect><rect x="230.6" y="376.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>digital_root_is_invariant_under_reversal — 300 cases</title></rect><rect x="239.2" y="376.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>reversal_is_involutive_exactly_off_the_trailing_zeros — 300 cases</title></rect><rect x="247.8" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>pascal_has_both_parities — 196 cases</title></rect><rect x="256.4" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>thue_morse_doubling_recurrence — 200 cases</title></rect><rect x="265.0" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>doubling_preserves_the_parity_of_the_bits — 200 cases</title></rect><rect x="273.6" y="376.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_odd_step_sets_exactly_one_further_bit — 200 cases</title></rect><rect x="204.8" y="367.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_singles_are_exactly_the_non_units — 160 cases</title></rect><rect x="213.4" y="367.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>sixty_four_is_where_the_doubling_returns — 180 cases</title></rect><rect x="222.0" y="367.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>universal_reflection_involution — 110 cases</title></rect><rect x="230.6" y="367.6" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>universal_reflection_reverses_the_domain — 121 cases</title></rect><rect x="239.2" y="367.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>digital_root_agrees_with_the_residue — 300 cases</title></rect><rect x="247.8" y="367.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>digital_root_is_the_digit_sum_residue — 300 cases</title></rect><rect x="256.4" y="367.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>reversal_cannot_change_the_digital_root — 300 cases</title></rect><rect x="265.0" y="367.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_orbit_never_meets_the_triad — 120 cases</title></rect><rect x="273.6" y="367.6" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>doubling_alone_reaches_only_the_units — 432 cases</title></rect><rect x="204.8" y="359.0" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>no_proper_divisor_of_twenty_four_is_a_period — 182 cases</title></rect><text x="241.5" y="455.4" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">100+</text><text x="241.5" y="470.4" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">82</text><rect x="304.2" y="436.4" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>the_address_is_sixteen_bytes_whatever_the_input_length — 4,368 cases</title></rect><rect x="312.8" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_parity_of_popcount_is_the_xor_of_the_bits — 1,024 cases</title></rect><rect x="321.4" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_chinese_remainder_theorem_holds_exactly_when_the_moduli_are_coprime — 8,505 cases</title></rect><rect x="330.0" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>eight_and_nine_are_the_only_consecutive_perfect_powers_below_two_thousand — 1,999 cases</title></rect><rect x="338.6" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>havel_hakimi_decides_graphical_sequences — 1,200 cases</title></rect><rect x="347.2" y="436.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>three_is_the_only_prime_one_less_than_a_square_in_this_range — 1,560 cases</title></rect><rect x="355.8" y="436.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_whole_ring_is_not_regular_and_the_triad_is_why — 1,458 cases</title></rect><rect x="364.4" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>splitting_then_burning_is_the_identity_at_the_ideal — 1,000 cases</title></rect><rect x="373.0" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_gas_volume_reads_back_its_moles — 1,000 cases</title></rect><rect x="304.2" y="427.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>navier_stokes_flow_is_bounded — 2,304 cases</title></rect><rect x="312.8" y="427.8" width="7" height="7" rx="1.2" fill="hsl(200 62% 52%)"><title>a_saving_never_exceeds_its_value — 1,600 cases</title></rect><rect x="321.4" y="427.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>content_address_is_keyless_integrity — 1,512 cases</title></rect><rect x="330.0" y="427.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>casting_out_nines_is_multiplicative — 3,481 cases</title></rect><rect x="338.6" y="427.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>a_sensor_reading_addresses_to_a_uuid — 6,561 cases</title></rect><rect x="347.2" y="427.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_fusion_of_site_and_user_is_deterministic — 2,401 cases</title></rect><rect x="355.8" y="427.8" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>sums_of_two_squares_are_closed — 4,096 cases</title></rect><rect x="364.4" y="427.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_verify_in_nanoseconds_reads_back_its_microseconds — 1,000 cases</title></rect><rect x="373.0" y="427.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>hexbits_are_slower_and_the_ratio_multiplies_back — 8,000 cases</title></rect><rect x="304.2" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_unit_table_is_a_latin_square — 1,296 cases</title></rect><text x="340.9" y="455.4" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">1,000+</text><text x="340.9" y="470.4" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">19</text><rect x="403.6" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>nicomachus_sum_of_cubes_is_the_square_of_the_triangular_number — 30,400 cases</title></rect><rect x="412.2" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>two_twenty_and_two_eighty_four_are_the_smallest_amicable_pair — 95,048 cases</title></rect><rect x="420.8" y="436.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_area_of_an_integer_right_triangle_is_a_multiple_of_six — 96,000 cases</title></rect><rect x="429.4" y="436.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_powers_of_two_mod_nine_and_of_three_mod_seven_are_isomorphic — 46,656 cases</title></rect><rect x="438.0" y="436.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_wythoff_sequences_partition_the_integers — 80,000 cases</title></rect><rect x="446.6" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>a_chain_of_efficiencies_can_only_lose — 10,201 cases</title></rect><rect x="455.2" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>mass_is_conserved_at_every_scale_so_the_loop_cannot_make_water — 10,000 cases</title></rect><rect x="463.8" y="436.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_digital_root_is_invariant_under_digit_reversal — 10,000 cases</title></rect><rect x="472.4" y="436.4" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_digit_sum_rules_for_three_and_nine_hold_below_ten_thousand — 10,000 cases</title></rect><rect x="403.6" y="427.8" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>the_three_non_units_are_exactly_the_unreachable — 19,683 cases</title></rect><rect x="412.2" y="427.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_superposition_collapse — 10,000 cases</title></rect><rect x="420.8" y="427.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>relation_url_path — 14,641 cases</title></rect><rect x="429.4" y="427.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>each_perspective_is_a_distinct_file — 28,561 cases</title></rect><rect x="438.0" y="427.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>intentions_are_shown_by_receipts_not_role — 10,404 cases</title></rect><rect x="446.6" y="427.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>each_theorem_is_a_superposition_of_readings — 22,308 cases</title></rect><rect x="455.2" y="427.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_theorems_are_the_hull_and_hardware — 41,160 cases</title></rect><rect x="463.8" y="427.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_intention_is_a_computable_deed_receipt — 23,104 cases</title></rect><rect x="472.4" y="427.8" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>every_error_is_a_receipted_trial_event — 15,876 cases</title></rect><rect x="403.6" y="419.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>every_warning_is_a_receipted_trial_event — 12,138 cases</title></rect><rect x="412.2" y="419.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>each_suggested_next_is_content_addressed — 10,000 cases</title></rect><rect x="420.8" y="419.2" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_rejected_command_gets_a_receipt — 44,100 cases</title></rect><rect x="429.4" y="419.2" width="7" height="7" rx="1.2" fill="hsl(240 62% 52%)"><title>the_sequence_takes_both_values — 40,000 cases</title></rect><text x="440.3" y="455.4" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">10,000+</text><text x="440.3" y="470.4" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">22</text><text x="539.7" y="455.4" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">100,000+</text><text x="539.7" y="470.4" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">0</text><rect x="602.4" y="436.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>gravity_holds_prose_code_and_paths — 7,529,536 cases</title></rect><text x="639.1" y="455.4" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">10^6</text><text x="639.1" y="470.4" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">1</text><text x="738.5" y="455.4" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">10^7</text><text x="738.5" y="470.4" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">0</text><text x="837.9" y="455.4" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">10^8</text><text x="837.9" y="470.4" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">0</text><rect x="900.6" y="436.4" width="7" height="7" rx="1.2" fill="hsl(320 62% 52%)"><title>the_nim_sum_is_a_gf2_vector_addition — 4,294,967,296 cases</title></rect><text x="937.3" y="455.4" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">10^9</text><text x="937.3" y="470.4" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">1</text><text x="1036.7" y="455.4" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">10^10</text><text x="1036.7" y="470.4" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">0</text><rect x="1099.4" y="436.4" width="7" height="7" rx="1.2" fill="hsl(280 62% 52%)"><title>bezouts_identity_is_attained_and_no_smaller_combination_exists — 152,568,360,000 cases</title></rect><text x="1136.1" y="455.4" font-size="13" text-anchor="middle" fill="currentColor" opacity="0.8">10^11</text><text x="1136.1" y="470.4" font-size="12" text-anchor="middle" fill="currentColor" opacity="0.5">1</text><text x="6" y="13" font-size="12" fill="currentColor" opacity="0.65">cases the kernel exhausted, per theorem (log₁₀ buckets) — one square is one theorem</text></svg>
22
+ <figcaption><strong>Figure 1.</strong> All 719 declarations, one square each, placed by the size of the domain its proof exhausted (log₁₀ buckets). Colour is the wing. The right-hand tail is a single theorem; the mass is at nine cases.</figcaption>
23
23
  </figure>
24
24
 
25
25
  <figure class="paper-fig">
26
- <svg viewBox="0 0 460 149" role="img" class="fig" xmlns="http://www.w3.org/2000/svg" aria-label="how many theorems each wing carries"><title>Figure 2 — theorems per wing</title><text x="0" y="18" font-size="9.5" fill="currentColor" opacity="0.8">the ring</text><rect x="128" y="9.5" width="250.0" height="11" rx="2" fill="hsl(240 62% 52%)"/><text x="382.0" y="18" font-size="9" fill="currentColor" opacity="0.65">221</text><text x="0" y="37" font-size="9.5" fill="currentColor" opacity="0.8">the machine</text><rect x="128" y="28.5" width="186.7" height="11" rx="2" fill="hsl(320 62% 52%)"/><text x="318.7" y="37" font-size="9" fill="currentColor" opacity="0.65">165</text><text x="0" y="56" font-size="9.5" fill="currentColor" opacity="0.8">the imagined</text><rect x="128" y="47.5" width="133.5" height="11" rx="2" fill="hsl(0 62% 52%)"/><text x="265.5" y="56" font-size="9" fill="currentColor" opacity="0.65">118</text><text x="0" y="75" font-size="9.5" fill="currentColor" opacity="0.8">the floor</text><rect x="128" y="66.5" width="131.2" height="11" rx="2" fill="hsl(280 62% 52%)"/><text x="263.2" y="75" font-size="9" fill="currentColor" opacity="0.65">116</text><text x="0" y="94" font-size="9.5" fill="currentColor" opacity="0.8">the address</text><rect x="128" y="85.5" width="57.7" height="11" rx="2" fill="hsl(200 62% 52%)"/><text x="189.7" y="94" font-size="9" fill="currentColor" opacity="0.65">51</text><text x="0" y="113" font-size="9.5" fill="currentColor" opacity="0.8">the record</text><rect x="128" y="104.5" width="20.4" height="11" rx="2" fill="hsl(40 62% 52%)"/><text x="152.4" y="113" font-size="9" fill="currentColor" opacity="0.65">18</text><text x="0" y="132" font-size="9.5" fill="currentColor" opacity="0.8">the returned</text><rect x="128" y="123.5" width="17.0" height="11" rx="2" fill="hsl(80 62% 52%)"/><text x="149.0" y="132" font-size="9" fill="currentColor" opacity="0.65">15</text></svg>
26
+ <svg viewBox="0 0 460 149" role="img" class="fig" xmlns="http://www.w3.org/2000/svg" aria-label="how many theorems each wing carries"><title>Figure 2 — theorems per wing</title><text x="0" y="18" font-size="9.5" fill="currentColor" opacity="0.8">the ring</text><rect x="128" y="9.5" width="250.0" height="11" rx="2" fill="hsl(240 62% 52%)"/><text x="382.0" y="18" font-size="9" fill="currentColor" opacity="0.65">221</text><text x="0" y="37" font-size="9.5" fill="currentColor" opacity="0.8">the machine</text><rect x="128" y="28.5" width="203.6" height="11" rx="2" fill="hsl(320 62% 52%)"/><text x="335.6" y="37" font-size="9" fill="currentColor" opacity="0.65">180</text><text x="0" y="56" font-size="9.5" fill="currentColor" opacity="0.8">the imagined</text><rect x="128" y="47.5" width="133.5" height="11" rx="2" fill="hsl(0 62% 52%)"/><text x="265.5" y="56" font-size="9" fill="currentColor" opacity="0.65">118</text><text x="0" y="75" font-size="9.5" fill="currentColor" opacity="0.8">the floor</text><rect x="128" y="66.5" width="131.2" height="11" rx="2" fill="hsl(280 62% 52%)"/><text x="263.2" y="75" font-size="9" fill="currentColor" opacity="0.65">116</text><text x="0" y="94" font-size="9.5" fill="currentColor" opacity="0.8">the address</text><rect x="128" y="85.5" width="57.7" height="11" rx="2" fill="hsl(200 62% 52%)"/><text x="189.7" y="94" font-size="9" fill="currentColor" opacity="0.65">51</text><text x="0" y="113" font-size="9.5" fill="currentColor" opacity="0.8">the record</text><rect x="128" y="104.5" width="20.4" height="11" rx="2" fill="hsl(40 62% 52%)"/><text x="152.4" y="113" font-size="9" fill="currentColor" opacity="0.65">18</text><text x="0" y="132" font-size="9.5" fill="currentColor" opacity="0.8">the returned</text><rect x="128" y="123.5" width="17.0" height="11" rx="2" fill="hsl(80 62% 52%)"/><text x="149.0" y="132" font-size="9" fill="currentColor" opacity="0.65">15</text></svg>
27
27
  <figcaption><strong>Figure 2.</strong> Theorems per wing — counts, because summing case-counts across wings would draw the one large domain again.</figcaption>
28
28
  </figure>
29
29
 
30
30
  <h2 class="paper-h">Method</h2>
31
31
 
32
- Each theorem is a proposition over a finite domain, discharged by exhaustion: the kernel evaluates the proposition at every point of that domain rather than accepting an argument about it. **625** of 704 are closed by `by decide` and are sealed in the append-only ledger. **70** are PROVED for every value — a proof, not an exhaustion, resting on the standard axioms that core Lean's lemmas carry — and are sealed as proofs, never as decisions. The remaining **9** are settled by `rfl` — a declaration that unfolds to itself — and are deliberately **not sealed**: they are shown here, and marked, because a definitional unfolding is not an exhaustion and must not be counted as one. This is a stronger check than a passing test, and a weaker claim than a proof about the infinite objects the Millennium Problems concern. No Mathlib, no `native_decide`, no `sorry`.
32
+ Each theorem is a proposition over a finite domain, discharged by exhaustion: the kernel evaluates the proposition at every point of that domain rather than accepting an argument about it. **625** of 719 are closed by `by decide` and are sealed in the append-only ledger. **85** are PROVED for every value — a proof, not an exhaustion, resting on the standard axioms that core Lean's lemmas carry — and are sealed as proofs, never as decisions. The remaining **9** are settled by `rfl` — a declaration that unfolds to itself — and are deliberately **not sealed**: they are shown here, and marked, because a definitional unfolding is not an exhaustion and must not be counted as one. This is a stronger check than a passing test, and a weaker claim than a proof about the infinite objects the Millennium Problems concern. No Mathlib, no `native_decide`, no `sorry`.
33
33
 
34
34
  <h2 class="paper-h">How to read this document</h2>
35
35
 
36
- Sections are the Lean source files, ordered by the wing each declares in its own frontmatter; the prose under a section heading is that file's own header comment, and the remark under a theorem is the comment written above it in the source. Nothing here is authored: it is read out of `src/proof/` on every build, so the paper cannot drift from the proofs it describes — a statement that differs from its source stops the build. A remark under a theorem is printed only when the source comment is that theorem's own: **492** of 704 have one. A comment that belongs to the enclosing section is not repeated under each theorem it precedes, because it is context for the section and not a statement about any one of them. Integrity, not truth.
36
+ Sections are the Lean source files, ordered by the wing each declares in its own frontmatter; the prose under a section heading is that file's own header comment, and the remark under a theorem is the comment written above it in the source. Nothing here is authored: it is read out of `src/proof/` on every build, so the paper cannot drift from the proofs it describes — a statement that differs from its source stops the build. A remark under a theorem is printed only when the source comment is that theorem's own: **493** of 719 have one. A comment that belongs to the enclosing section is not repeated under each theorem it precedes, because it is context for the section and not a statement about any one of them. Integrity, not truth.
37
37
 
38
38
  <h2 class="paper-h">Contents</h2>
39
39
 
@@ -67,10 +67,10 @@ Sections are the Lean source files, ordered by the wing each declares in its own
67
67
  - [What exhaustion reaches, and what lies outside it](#reach) · `reach.lean` · 8
68
68
  - [Why verification is fast, and what it is not](#speed) · `speed.lean` · 11
69
69
 
70
- **the machine** — 165 theorems
70
+ **the machine** — 180 theorems
71
71
  - [Generated at scale](#generated) · `generated.lean` · 13
72
72
  - [Mechanically translated](#mechanical) · `mechanical.lean` · 119
73
- - [Nim](#nim) · `nim.lean` · 10
73
+ - [Nim](#nim) · `nim.lean` · 25
74
74
  - [Digit reversal](#reversal) · `reversal.lean` · 15
75
75
  - [Theorems](#theorems) · `theorems.lean` · 8
76
76
 
@@ -5285,7 +5285,7 @@ CLAIMS: physical
5285
5285
 
5286
5286
  ### Nim {#nim}
5287
5287
 
5288
- <p class="paper-src"><code>src/proof/nim.lean</code> · namespace <code>Nim</code> · 10 theorems</p>
5288
+ <p class="paper-src"><code>src/proof/nim.lean</code> · namespace <code>Nim</code> · 25 theorems</p>
5289
5289
 
5290
5290
  Nim — Bouton's theorem and Sprague–Grundy, decided.
5291
5291
 
@@ -5297,7 +5297,8 @@ bound — which is what `decide` can honestly deliver. It is not a proof for all
5297
5297
  stated in each name rather than implied.
5298
5298
 
5299
5299
  XOR is imported from Fnv rather than restated: it is the same fuel-bounded structural fold, built because
5300
- Nat's bitwise operations are well-founded and would drag `propext` into every theorem here.
5300
+ Nat's bitwise operations are well-founded and would drag `propext` into every theorem here. Its laws are
5301
+ proved below for every a, b, c, on the standard axioms; the decided rows above stay as their instances.
5301
5302
 
5302
5303
  <p class="paper-h">Definitions</p>
5303
5304
 
@@ -5309,7 +5310,7 @@ Nat's bitwise operations are well-founded and would drag `propext` into every th
5309
5310
  <pre class="thm-statement"><code>(List.range N).all (fun a =&gt; (List.range N).all (fun b =&gt; isLost a b == (xorN a b == 0)))</code></pre>
5310
5311
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall a \in \{0,\dots,N-1\},\; \forall b \in \{0,\dots,N-1\},\; \mathrm{isLost}\mathopen{}\left(a,\,b\right) = \mathrm{xorN}\mathopen{}\left(a,\,b\right) = 0</code></pre></details>
5311
5312
  </div>
5312
- <p class="thm-remark">── BOUTON: a two-heap position is lost for the mover exactly when the heaps are equal — which is exactly when their XOR is zero. Decided over every position on the 8×8 board. ──</p>
5313
+ <p class="thm-remark">── BOUTON: a two-heap position is lost for the mover exactly when the heaps are equal — which is exactly when their XOR is zero. Decided over every position on the N×N board, N = 6. ──</p>
5313
5314
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5314
5315
 
5315
5316
  <div class="thm" id="thm-nim-bouton_lost_iff_heaps_equal">
@@ -5389,6 +5390,112 @@ Nat's bitwise operations are well-founded and would drag `propext` into every th
5389
5390
  </div>
5390
5391
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 49 cases. <span class="qed">□</span></p>
5391
5392
 
5393
+ <div class="thm" id="thm-nim-the_xor_of_two_bits_is_their_sum_mod_two">
5394
+ <p class="thm-label"><strong>Theorem 531</strong> (<code>the_xor_of_two_bits_is_their_sum_mod_two</code>)<a class="thm-cite" href="/theorem/lean_nim_the_xor_of_two_bits_is_their_sum_mod_two">sealed</a>.</p>
5395
+ <pre class="thm-statement"><code>∀ x y : Nat, (if x % 2 == y % 2 then 0 else 1) = (x + y) % 2</code></pre>
5396
+ </div>
5397
+ <p class="thm-remark">── XOR's algebra for every a, b, c — no bound ─────────────────────────────────────────────────────────────── xor_is_its_own_inverse and xor_is_commutative (a, b &lt; 16), xor_zero_is_identity (a &lt; 32) and the_nim_sum_is_a_gf2_vector_addition (a, b, c &lt; 16) were decided over a range; these prove them for every value. The fold's fuel is a + b + 1, which always suffices: once it exceeds either argument, more fuel changes nothing, so xorN reads the same at any sufficient fuel. Everything follows from one step — the low bit of a XOR is the sum of the low bits mod 2, and the rest is twice the XOR of the halves — by induction. Bouton's theorem itself is still decided over the N×N board above; a proof of it for every heap is a game-tree induction not done here.</p>
5398
+ <p class="thm-proof"><em>Proof.</em> <code>by
5399
+ intro</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5400
+
5401
+ <div class="thm" id="thm-nim-xor_commutes_at_every_fuel">
5402
+ <p class="thm-label"><strong>Theorem 532</strong> (<code>xor_commutes_at_every_fuel</code>)<a class="thm-cite" href="/theorem/lean_nim_xor_commutes_at_every_fuel">sealed</a>.</p>
5403
+ <pre class="thm-statement"><code>∀ f a b : Nat, xorF f a b = xorF f b a</code></pre>
5404
+ </div>
5405
+ <p class="thm-proof"><em>Proof.</em> <code>by
5406
+ intro</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5407
+
5408
+ <div class="thm" id="thm-nim-one_more_step_of_fuel_changes_nothing_once_it_exceeds_an_argument">
5409
+ <p class="thm-label"><strong>Theorem 533</strong> (<code>one_more_step_of_fuel_changes_nothing_once_it_exceeds_an_argument</code>)<a class="thm-cite" href="/theorem/lean_nim_one_more_step_of_fuel_changes_nothing_once_it_exceeds_an_argument">sealed</a>.</p>
5410
+ <pre class="thm-statement"><code>∀ f a b : Nat, (a &lt; f ∨ b &lt; f) → xorF (f + 1) a b = xorF f a b</code></pre>
5411
+ </div>
5412
+ <p class="thm-proof"><em>Proof.</em> <code>by
5413
+ intro</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5414
+
5415
+ <div class="thm" id="thm-nim-more_fuel_changes_nothing_once_it_exceeds_an_argument">
5416
+ <p class="thm-label"><strong>Theorem 534</strong> (<code>more_fuel_changes_nothing_once_it_exceeds_an_argument</code>)<a class="thm-cite" href="/theorem/lean_nim_more_fuel_changes_nothing_once_it_exceeds_an_argument">sealed</a>.</p>
5417
+ <pre class="thm-statement"><code>∀ k f a b : Nat, (a &lt; f ∨ b &lt; f) → xorF (f + k) a b = xorF f a b</code></pre>
5418
+ </div>
5419
+ <p class="thm-proof"><em>Proof.</em> <code>by
5420
+ intro</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5421
+
5422
+ <div class="thm" id="thm-nim-xor_reads_the_same_at_every_sufficient_fuel">
5423
+ <p class="thm-label"><strong>Theorem 535</strong> (<code>xor_reads_the_same_at_every_sufficient_fuel</code>)<a class="thm-cite" href="/theorem/lean_nim_xor_reads_the_same_at_every_sufficient_fuel">sealed</a>.</p>
5424
+ <pre class="thm-statement"><code>∀ g a b : Nat, (a &lt; g ∨ b &lt; g) → xorN a b = xorF g a b</code></pre>
5425
+ </div>
5426
+ <p class="thm-proof"><em>Proof.</em> <code>by
5427
+ intro</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5428
+
5429
+ <div class="thm" id="thm-nim-a_number_xored_with_itself_is_zero_at_every_fuel">
5430
+ <p class="thm-label"><strong>Theorem 536</strong> (<code>a_number_xored_with_itself_is_zero_at_every_fuel</code>)<a class="thm-cite" href="/theorem/lean_nim_a_number_xored_with_itself_is_zero_at_every_fuel">sealed</a>.</p>
5431
+ <pre class="thm-statement"><code>∀ f b : Nat, xorF f b b = 0</code></pre>
5432
+ </div>
5433
+ <p class="thm-proof"><em>Proof.</em> <code>by
5434
+ intro</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5435
+
5436
+ <div class="thm" id="thm-nim-xor_splits_off_its_lowest_bit">
5437
+ <p class="thm-label"><strong>Theorem 537</strong> (<code>xor_splits_off_its_lowest_bit</code>)<a class="thm-cite" href="/theorem/lean_nim_xor_splits_off_its_lowest_bit">sealed</a>.</p>
5438
+ <pre class="thm-statement"><code>∀ g x c : Nat, 1 ≤ g → xorF (g + 1) x c = (x + c) % 2 + 2 * xorF g (x / 2) (c / 2)</code></pre>
5439
+ </div>
5440
+ <p class="thm-proof"><em>Proof.</em> <code>by
5441
+ intro</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5442
+
5443
+ <div class="thm" id="thm-nim-xor_undoes_itself_when_the_fuel_suffices">
5444
+ <p class="thm-label"><strong>Theorem 538</strong> (<code>xor_undoes_itself_when_the_fuel_suffices</code>)<a class="thm-cite" href="/theorem/lean_nim_xor_undoes_itself_when_the_fuel_suffices">sealed</a>.</p>
5445
+ <pre class="thm-statement"><code>∀ f a b g : Nat, (a &lt; f ∨ b &lt; f) → b &lt; g → xorF g (xorF f a b) b = a</code></pre>
5446
+ </div>
5447
+ <p class="thm-proof"><em>Proof.</em> <code>by
5448
+ intro</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5449
+
5450
+ <div class="thm" id="thm-nim-xor_is_commutative_for_every_a_b">
5451
+ <p class="thm-label"><strong>Theorem 539</strong> (<code>xor_is_commutative_for_every_a_b</code>)<a class="thm-cite" href="/theorem/lean_nim_xor_is_commutative_for_every_a_b">sealed</a>.</p>
5452
+ <pre class="thm-statement"><code>∀ a b : Nat, xorN a b = xorN b a</code></pre>
5453
+ </div>
5454
+ <p class="thm-proof"><em>Proof.</em> <code>by
5455
+ intro</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5456
+
5457
+ <div class="thm" id="thm-nim-xor_zero_is_identity_for_every_a">
5458
+ <p class="thm-label"><strong>Theorem 540</strong> (<code>xor_zero_is_identity_for_every_a</code>)<a class="thm-cite" href="/theorem/lean_nim_xor_zero_is_identity_for_every_a">sealed</a>.</p>
5459
+ <pre class="thm-statement"><code>∀ a : Nat, xorN a 0 = a</code></pre>
5460
+ </div>
5461
+ <p class="thm-proof"><em>Proof.</em> <code>by
5462
+ intro</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5463
+
5464
+ <div class="thm" id="thm-nim-xor_is_its_own_inverse_for_every_a_b">
5465
+ <p class="thm-label"><strong>Theorem 541</strong> (<code>xor_is_its_own_inverse_for_every_a_b</code>)<a class="thm-cite" href="/theorem/lean_nim_xor_is_its_own_inverse_for_every_a_b">sealed</a>.</p>
5466
+ <pre class="thm-statement"><code>∀ a b : Nat, xorN (xorN a b) b = a</code></pre>
5467
+ </div>
5468
+ <p class="thm-proof"><em>Proof.</em> <code>by
5469
+ intro</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5470
+
5471
+ <div class="thm" id="thm-nim-xor_is_the_sum_of_the_bits_plus_twice_the_xor_of_the_halves">
5472
+ <p class="thm-label"><strong>Theorem 542</strong> (<code>xor_is_the_sum_of_the_bits_plus_twice_the_xor_of_the_halves</code>)<a class="thm-cite" href="/theorem/lean_nim_xor_is_the_sum_of_the_bits_plus_twice_the_xor_of_the_halves">sealed</a>.</p>
5473
+ <pre class="thm-statement"><code>∀ a b : Nat, xorN a b = (a + b) % 2 + 2 * xorN (a / 2) (b / 2)</code></pre>
5474
+ </div>
5475
+ <p class="thm-proof"><em>Proof.</em> <code>by
5476
+ intro</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5477
+
5478
+ <div class="thm" id="thm-nim-xor_is_associative_below_every_bound">
5479
+ <p class="thm-label"><strong>Theorem 543</strong> (<code>xor_is_associative_below_every_bound</code>)<a class="thm-cite" href="/theorem/lean_nim_xor_is_associative_below_every_bound">sealed</a>.</p>
5480
+ <pre class="thm-statement"><code>∀ n a b c : Nat, a + b + c ≤ n → xorN (xorN a b) c = xorN a (xorN b c)</code></pre>
5481
+ </div>
5482
+ <p class="thm-proof"><em>Proof.</em> <code>by
5483
+ intro</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5484
+
5485
+ <div class="thm" id="thm-nim-xor_is_associative_for_every_a_b_c">
5486
+ <p class="thm-label"><strong>Theorem 544</strong> (<code>xor_is_associative_for_every_a_b_c</code>)<a class="thm-cite" href="/theorem/lean_nim_xor_is_associative_for_every_a_b_c">sealed</a>.</p>
5487
+ <pre class="thm-statement"><code>∀ a b c : Nat, xorN (xorN a b) c = xorN a (xorN b c)</code></pre>
5488
+ </div>
5489
+ <p class="thm-proof"><em>Proof.</em> <code>by
5490
+ intro</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5491
+
5492
+ <div class="thm" id="thm-nim-the_nim_sum_is_a_gf2_vector_addition_for_every_a_b_c">
5493
+ <p class="thm-label"><strong>Theorem 545</strong> (<code>the_nim_sum_is_a_gf2_vector_addition_for_every_a_b_c</code>)<a class="thm-cite" href="/theorem/lean_nim_the_nim_sum_is_a_gf2_vector_addition_for_every_a_b_c">sealed</a>.</p>
5494
+ <pre class="thm-statement"><code>∀ a b c : Nat, xorN a b = xorN b a ∧ xorN (xorN a b) c = xorN a (xorN b c) ∧ xorN (xorN a b) b = a ∧ xorN a 0 = a</code></pre>
5495
+ </div>
5496
+ <p class="thm-proof"><em>Proof.</em> <code>by
5497
+ intro</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5498
+
5392
5499
 
5393
5500
  ### Digit reversal {#reversal}
5394
5501
 
@@ -5409,7 +5516,7 @@ No axioms, no Mathlib, no sorry.
5409
5516
  <pre class="thm-statement paper-defs"><code>settledHere := 8</code></pre>
5410
5517
 
5411
5518
  <div class="thm" id="thm-reversal-reversal_preserves_digit_sum">
5412
- <p class="thm-label"><strong>Theorem 531</strong> (<code>reversal_preserves_digit_sum</code>)<a class="thm-cite" href="/theorem/lean_reversal_reversal_preserves_digit_sum">sealed</a>.</p>
5519
+ <p class="thm-label"><strong>Theorem 546</strong> (<code>reversal_preserves_digit_sum</code>)<a class="thm-cite" href="/theorem/lean_reversal_reversal_preserves_digit_sum">sealed</a>.</p>
5413
5520
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>n</mi><mo>∈</mo><mrow><mo>{</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>300</mn><mo>}</mo></mrow><mo>,</mo><mrow><mrow><mi>digitSum</mi><mo>(</mo><mrow><mi>reverseNum</mi><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>)</mo></mrow><mo>=</mo><mrow><mi>digitSum</mi><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></mrow></math></div>
5414
5521
  <pre class="thm-statement"><code>(List.range' 1 300).all (fun n =&gt; digitSum (reverseNum n) == digitSum n)</code></pre>
5415
5522
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall n \in \{1,\dots,300\},\; \mathrm{digitSum}\mathopen{}\left(\mathrm{reverseNum}\mathopen{}\left(n\right)\right) = \mathrm{digitSum}\mathopen{}\left(n\right)</code></pre></details>
@@ -5418,7 +5525,7 @@ No axioms, no Mathlib, no sorry.
5418
5525
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 300 cases. <span class="qed">□</span></p>
5419
5526
 
5420
5527
  <div class="thm" id="thm-reversal-digital_root_is_invariant_under_reversal">
5421
- <p class="thm-label"><strong>Theorem 532</strong> (<code>digital_root_is_invariant_under_reversal</code>)<a class="thm-cite" href="/theorem/lean_reversal_digital_root_is_invariant_under_reversal">sealed</a>.</p>
5528
+ <p class="thm-label"><strong>Theorem 547</strong> (<code>digital_root_is_invariant_under_reversal</code>)<a class="thm-cite" href="/theorem/lean_reversal_digital_root_is_invariant_under_reversal">sealed</a>.</p>
5422
5529
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>n</mi><mo>∈</mo><mrow><mo>{</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>300</mn><mo>}</mo></mrow><mo>,</mo><mrow><mrow><mrow><mi>reverseNum</mi><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>mod</mo><mn>9</mn></mrow><mo>=</mo><mrow><mi>n</mi><mo>mod</mo><mn>9</mn></mrow></mrow></mrow></math></div>
5423
5530
  <pre class="thm-statement"><code>(List.range' 1 300).all (fun n =&gt; (reverseNum n) % 9 == n % 9)</code></pre>
5424
5531
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall n \in \{1,\dots,300\},\; \mathrm{reverseNum}\mathopen{}\left(n\right) \bmod 9 = n \bmod 9</code></pre></details>
@@ -5427,7 +5534,7 @@ No axioms, no Mathlib, no sorry.
5427
5534
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 300 cases. <span class="qed">□</span></p>
5428
5535
 
5429
5536
  <div class="thm" id="thm-reversal-the_ledger_reversal_cases">
5430
- <p class="thm-label"><strong>Theorem 533</strong> (<code>the_ledger_reversal_cases</code>)<a class="thm-cite" href="/theorem/lean_reversal_the_ledger_reversal_cases">sealed</a>.</p>
5537
+ <p class="thm-label"><strong>Theorem 548</strong> (<code>the_ledger_reversal_cases</code>)<a class="thm-cite" href="/theorem/lean_reversal_the_ledger_reversal_cases">sealed</a>.</p>
5431
5538
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mrow><mrow><mrow><mrow><mrow><mrow><mi>reverseNum</mi><mo>(</mo><mn>12</mn><mo>)</mo></mrow><mo>mod</mo><mn>9</mn></mrow><mo>=</mo><mrow><mn>12</mn><mo>mod</mo><mn>9</mn></mrow></mrow><mo>∧</mo><mrow><mrow><mrow><mi>reverseNum</mi><mo>(</mo><mn>45</mn><mo>)</mo></mrow><mo>mod</mo><mn>9</mn></mrow><mo>=</mo><mrow><mn>45</mn><mo>mod</mo><mn>9</mn></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mrow><mi>reverseNum</mi><mo>(</mo><mn>123</mn><mo>)</mo></mrow><mo>mod</mo><mn>9</mn></mrow><mo>=</mo><mrow><mn>123</mn><mo>mod</mo><mn>9</mn></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mrow><mi>reverseNum</mi><mo>(</mo><mn>1234</mn><mo>)</mo></mrow><mo>mod</mo><mn>9</mn></mrow><mo>=</mo><mrow><mn>1234</mn><mo>mod</mo><mn>9</mn></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mrow><mi>reverseNum</mi><mo>(</mo><mn>4321</mn><mo>)</mo></mrow><mo>mod</mo><mn>9</mn></mrow><mo>=</mo><mrow><mn>4321</mn><mo>mod</mo><mn>9</mn></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mrow><mi>reverseNum</mi><mo>(</mo><mn>9080</mn><mo>)</mo></mrow><mo>mod</mo><mn>9</mn></mrow><mo>=</mo><mrow><mn>9080</mn><mo>mod</mo><mn>9</mn></mrow></mrow></mrow></math></div>
5432
5539
  <pre class="thm-statement"><code>(reverseNum 12) % 9 == 12 % 9 ∧ (reverseNum 45) % 9 == 45 % 9 ∧ (reverseNum 123) % 9 == 123 % 9 ∧ (reverseNum 1234) % 9 == 1234 % 9 ∧ (reverseNum 4321) % 9 == 4321 % 9 ∧ (reverseNum 9080) % 9 == 9080 % 9</code></pre>
5433
5540
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\mathrm{reverseNum}\mathopen{}\left(12\right) \bmod 9 = 12 \bmod 9 \land \mathrm{reverseNum}\mathopen{}\left(45\right) \bmod 9 = 45 \bmod 9 \land \mathrm{reverseNum}\mathopen{}\left(123\right) \bmod 9 = 123 \bmod 9 \land \mathrm{reverseNum}\mathopen{}\left(1234\right) \bmod 9 = 1234 \bmod 9 \land \mathrm{reverseNum}\mathopen{}\left(4321\right) \bmod 9 = 4321 \bmod 9 \land \mathrm{reverseNum}\mathopen{}\left(9080\right) \bmod 9 = 9080 \bmod 9</code></pre></details>
@@ -5436,7 +5543,7 @@ No axioms, no Mathlib, no sorry.
5436
5543
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5437
5544
 
5438
5545
  <div class="thm" id="thm-reversal-reversal_is_not_the_identity">
5439
- <p class="thm-label"><strong>Theorem 534</strong> (<code>reversal_is_not_the_identity</code>)<a class="thm-cite" href="/theorem/lean_reversal_reversal_is_not_the_identity">sealed</a>.</p>
5546
+ <p class="thm-label"><strong>Theorem 549</strong> (<code>reversal_is_not_the_identity</code>)<a class="thm-cite" href="/theorem/lean_reversal_reversal_is_not_the_identity">sealed</a>.</p>
5440
5547
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>¬</mo><mrow><mo>∀</mo><mi>n</mi><mo>∈</mo><mrow><mo>{</mo><mn>10</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>99</mn><mo>}</mo></mrow><mo>,</mo><mrow><mrow><mi>reverseNum</mi><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>=</mo><mi>n</mi></mrow></mrow></mrow></math></div>
5441
5548
  <pre class="thm-statement"><code>¬ ((List.range' 10 90).all (fun n =&gt; reverseNum n == n))</code></pre>
5442
5549
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\lnot \forall n \in \{10,\dots,99\},\; \mathrm{reverseNum}\mathopen{}\left(n\right) = n</code></pre></details>
@@ -5445,7 +5552,7 @@ No axioms, no Mathlib, no sorry.
5445
5552
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 90 cases. <span class="qed">□</span></p>
5446
5553
 
5447
5554
  <div class="thm" id="thm-reversal-palindromes_are_the_fixed_points">
5448
- <p class="thm-label"><strong>Theorem 535</strong> (<code>palindromes_are_the_fixed_points</code>)<a class="thm-cite" href="/theorem/lean_reversal_palindromes_are_the_fixed_points">sealed</a>.</p>
5555
+ <p class="thm-label"><strong>Theorem 550</strong> (<code>palindromes_are_the_fixed_points</code>)<a class="thm-cite" href="/theorem/lean_reversal_palindromes_are_the_fixed_points">sealed</a>.</p>
5449
5556
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mo>{</mo><mi>n</mi><mo>∈</mo><mrow><mo>{</mo><mn>10</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>99</mn><mo>}</mo></mrow><mo>∣</mo><mrow><mrow><mi>reverseNum</mi><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>=</mo><mi>n</mi></mrow><mo>}</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>9</mn></mrow></math></div>
5450
5557
  <pre class="thm-statement"><code>((List.range' 10 90).filter (fun n =&gt; reverseNum n == n)).length = 9</code></pre>
5451
5558
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\{\, n \in \{10,\dots,99\} \mid \mathrm{reverseNum}\mathopen{}\left(n\right) = n \,\}\right| = 9</code></pre></details>
@@ -5454,7 +5561,7 @@ No axioms, no Mathlib, no sorry.
5454
5561
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 90 cases. <span class="qed">□</span></p>
5455
5562
 
5456
5563
  <div class="thm" id="thm-reversal-emirps_exist_below_one_hundred">
5457
- <p class="thm-label"><strong>Theorem 536</strong> (<code>emirps_exist_below_one_hundred</code>)<a class="thm-cite" href="/theorem/lean_reversal_emirps_exist_below_one_hundred">sealed</a>.</p>
5564
+ <p class="thm-label"><strong>Theorem 551</strong> (<code>emirps_exist_below_one_hundred</code>)<a class="thm-cite" href="/theorem/lean_reversal_emirps_exist_below_one_hundred">sealed</a>.</p>
5458
5565
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mo>{</mo><mi>n</mi><mo>∈</mo><mrow><mo>{</mo><mn>10</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>99</mn><mo>}</mo></mrow><mo>∣</mo><mrow><mrow><mrow><mi>isPrime</mi><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>∧</mo><mrow><mi>isPrime</mi><mo>(</mo><mrow><mi>reverseNum</mi><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>)</mo></mrow></mrow><mo>∧</mo><mrow><mrow><mi>reverseNum</mi><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>≠</mo><mi>n</mi></mrow></mrow><mo>}</mo></mrow><mo>|</mo></mrow><mo>&gt;</mo><mn>0</mn></mrow></math></div>
5459
5566
  <pre class="thm-statement"><code>((List.range' 10 90).filter (fun n =&gt; isPrime n &amp;&amp; isPrime (reverseNum n) &amp;&amp; reverseNum n != n)).length &gt; 0</code></pre>
5460
5567
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\{\, n \in \{10,\dots,99\} \mid \mathrm{isPrime}\mathopen{}\left(n\right) \land \mathrm{isPrime}\mathopen{}\left(\mathrm{reverseNum}\mathopen{}\left(n\right)\right) \land \mathrm{reverseNum}\mathopen{}\left(n\right) \neq n \,\}\right| &gt; 0</code></pre></details>
@@ -5462,7 +5569,7 @@ No axioms, no Mathlib, no sorry.
5462
5569
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 90 cases. <span class="qed">□</span></p>
5463
5570
 
5464
5571
  <div class="thm" id="thm-reversal-reversal_does_not_preserve_primality">
5465
- <p class="thm-label"><strong>Theorem 537</strong> (<code>reversal_does_not_preserve_primality</code>)<a class="thm-cite" href="/theorem/lean_reversal_reversal_does_not_preserve_primality">sealed</a>.</p>
5572
+ <p class="thm-label"><strong>Theorem 552</strong> (<code>reversal_does_not_preserve_primality</code>)<a class="thm-cite" href="/theorem/lean_reversal_reversal_does_not_preserve_primality">sealed</a>.</p>
5466
5573
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>¬</mo><mrow><mo>∀</mo><mi>n</mi><mo>∈</mo><mrow><mo>{</mo><mn>10</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>99</mn><mo>}</mo></mrow><mo>,</mo><mrow><mrow><mi>isPrime</mi><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>=</mo><mrow><mi>isPrime</mi><mo>(</mo><mrow><mi>reverseNum</mi><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>)</mo></mrow></mrow></mrow></mrow></math></div>
5467
5574
  <pre class="thm-statement"><code>¬ ((List.range' 10 90).all (fun n =&gt; isPrime n == isPrime (reverseNum n)))</code></pre>
5468
5575
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\lnot \forall n \in \{10,\dots,99\},\; \mathrm{isPrime}\mathopen{}\left(n\right) = \mathrm{isPrime}\mathopen{}\left(\mathrm{reverseNum}\mathopen{}\left(n\right)\right)</code></pre></details>
@@ -5471,7 +5578,7 @@ No axioms, no Mathlib, no sorry.
5471
5578
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 90 cases. <span class="qed">□</span></p>
5472
5579
 
5473
5580
  <div class="thm" id="thm-reversal-reversal_is_involutive_exactly_off_the_trailing_zeros">
5474
- <p class="thm-label"><strong>Theorem 538</strong> (<code>reversal_is_involutive_exactly_off_the_trailing_zeros</code>)<a class="thm-cite" href="/theorem/lean_reversal_reversal_is_involutive_exactly_off_the_trailing_zeros">sealed</a>.</p>
5581
+ <p class="thm-label"><strong>Theorem 553</strong> (<code>reversal_is_involutive_exactly_off_the_trailing_zeros</code>)<a class="thm-cite" href="/theorem/lean_reversal_reversal_is_involutive_exactly_off_the_trailing_zeros">sealed</a>.</p>
5475
5582
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>n</mi><mo>∈</mo><mrow><mo>{</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>300</mn><mo>}</mo></mrow><mo>,</mo><mrow><mrow><mrow><mi>reverseNum</mi><mo>(</mo><mrow><mi>reverseNum</mi><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>)</mo></mrow><mo>=</mo><mi>n</mi></mrow><mo>=</mo><mrow><mrow><mi>n</mi><mo>mod</mo><mn>10</mn></mrow><mo>≠</mo><mn>0</mn></mrow></mrow></mrow></math></div>
5476
5583
  <pre class="thm-statement"><code>(List.range' 1 300).all (fun n =&gt; (reverseNum (reverseNum n) == n) == (n % 10 != 0))</code></pre>
5477
5584
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall n \in \{1,\dots,300\},\; \mathrm{reverseNum}\mathopen{}\left(\mathrm{reverseNum}\mathopen{}\left(n\right)\right) = n = n \bmod 10 \neq 0</code></pre></details>
@@ -5480,7 +5587,7 @@ No axioms, no Mathlib, no sorry.
5480
5587
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 300 cases. <span class="qed">□</span></p>
5481
5588
 
5482
5589
  <div class="thm" id="thm-reversal-reversal_settles_its_range">
5483
- <p class="thm-label"><strong>Theorem 539</strong> (<code>reversal_settles_its_range</code>)<span class="thm-uncited">not sealed — settled by <code>rfl</code>, not exhausted</span>.</p>
5590
+ <p class="thm-label"><strong>Theorem 554</strong> (<code>reversal_settles_its_range</code>)<span class="thm-uncited">not sealed — settled by <code>rfl</code>, not exhausted</span>.</p>
5484
5591
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mi>settledHere</mi><mo>=</mo><mn>8</mn></mrow></math></div>
5485
5592
  <pre class="thm-statement"><code>settledHere = 8</code></pre>
5486
5593
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\mathrm{settledHere} = 8</code></pre></details>
@@ -5488,7 +5595,7 @@ No axioms, no Mathlib, no sorry.
5488
5595
  <p class="thm-proof"><em>Proof.</em> <code>rfl</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5489
5596
 
5490
5597
  <div class="thm" id="thm-reversal-foldl_add_start">
5491
- <p class="thm-label"><strong>Theorem 540</strong> (<code>foldl_add_start</code>)<a class="thm-cite" href="/theorem/lean_reversal_foldl_add_start">sealed</a>.</p>
5598
+ <p class="thm-label"><strong>Theorem 555</strong> (<code>foldl_add_start</code>)<a class="thm-cite" href="/theorem/lean_reversal_foldl_add_start">sealed</a>.</p>
5492
5599
  <pre class="thm-statement"><code>∀ (l : List Nat) (a : Nat), l.foldl (· + ·) a = a + l.foldl (· + ·) 0</code></pre>
5493
5600
  </div>
5494
5601
  <p class="thm-remark">── the capped rows above, proved for every value by induction — no bound ──────────────────────────────────── casting out nines, in general: a number, its digit sum and its reversal share their residue mod 9.</p>
@@ -5496,35 +5603,35 @@ No axioms, no Mathlib, no sorry.
5496
5603
  intro</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5497
5604
 
5498
5605
  <div class="thm" id="thm-reversal-the_digits_sum_to_the_number_mod_nine_when_the_fuel_covers_them">
5499
- <p class="thm-label"><strong>Theorem 541</strong> (<code>the_digits_sum_to_the_number_mod_nine_when_the_fuel_covers_them</code>)<a class="thm-cite" href="/theorem/lean_reversal_the_digits_sum_to_the_number_mod_nine_when_the_fuel_covers_them">sealed</a>.</p>
5606
+ <p class="thm-label"><strong>Theorem 556</strong> (<code>the_digits_sum_to_the_number_mod_nine_when_the_fuel_covers_them</code>)<a class="thm-cite" href="/theorem/lean_reversal_the_digits_sum_to_the_number_mod_nine_when_the_fuel_covers_them">sealed</a>.</p>
5500
5607
  <pre class="thm-statement"><code>∀ f n : Nat, n &lt; 10 ^ f → (digitsF f n).foldl (· + ·) 0 % 9 = n % 9</code></pre>
5501
5608
  </div>
5502
5609
  <p class="thm-proof"><em>Proof.</em> <code>by
5503
5610
  intro</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5504
5611
 
5505
5612
  <div class="thm" id="thm-reversal-a_number_is_below_ten_to_its_own_successor">
5506
- <p class="thm-label"><strong>Theorem 542</strong> (<code>a_number_is_below_ten_to_its_own_successor</code>)<a class="thm-cite" href="/theorem/lean_reversal_a_number_is_below_ten_to_its_own_successor">sealed</a>.</p>
5613
+ <p class="thm-label"><strong>Theorem 557</strong> (<code>a_number_is_below_ten_to_its_own_successor</code>)<a class="thm-cite" href="/theorem/lean_reversal_a_number_is_below_ten_to_its_own_successor">sealed</a>.</p>
5507
5614
  <pre class="thm-statement"><code>∀ n : Nat, n &lt; 10 ^ (n + 1)</code></pre>
5508
5615
  </div>
5509
5616
  <p class="thm-proof"><em>Proof.</em> <code>by
5510
5617
  intro</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5511
5618
 
5512
5619
  <div class="thm" id="thm-reversal-the_digit_sum_has_the_residue_of_the_number_mod_nine_for_every_n">
5513
- <p class="thm-label"><strong>Theorem 543</strong> (<code>the_digit_sum_has_the_residue_of_the_number_mod_nine_for_every_n</code>)<a class="thm-cite" href="/theorem/lean_reversal_the_digit_sum_has_the_residue_of_the_number_mod_nine_for_every_n">sealed</a>.</p>
5620
+ <p class="thm-label"><strong>Theorem 558</strong> (<code>the_digit_sum_has_the_residue_of_the_number_mod_nine_for_every_n</code>)<a class="thm-cite" href="/theorem/lean_reversal_the_digit_sum_has_the_residue_of_the_number_mod_nine_for_every_n">sealed</a>.</p>
5514
5621
  <pre class="thm-statement"><code>∀ n : Nat, digitSum n % 9 = n % 9</code></pre>
5515
5622
  </div>
5516
5623
  <p class="thm-proof"><em>Proof.</em> <code>by
5517
5624
  intro</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5518
5625
 
5519
5626
  <div class="thm" id="thm-reversal-folding_by_ten_keeps_the_residue_of_the_digit_sum">
5520
- <p class="thm-label"><strong>Theorem 544</strong> (<code>folding_by_ten_keeps_the_residue_of_the_digit_sum</code>)<a class="thm-cite" href="/theorem/lean_reversal_folding_by_ten_keeps_the_residue_of_the_digit_sum">sealed</a>.</p>
5627
+ <p class="thm-label"><strong>Theorem 559</strong> (<code>folding_by_ten_keeps_the_residue_of_the_digit_sum</code>)<a class="thm-cite" href="/theorem/lean_reversal_folding_by_ten_keeps_the_residue_of_the_digit_sum">sealed</a>.</p>
5521
5628
  <pre class="thm-statement"><code>∀ (l : List Nat) (a : Nat), (l.foldl (fun a d =&gt; a * 10 + d) a) % 9 = (a + l.foldl (· + ·) 0) % 9</code></pre>
5522
5629
  </div>
5523
5630
  <p class="thm-proof"><em>Proof.</em> <code>by
5524
5631
  intro</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
5525
5632
 
5526
5633
  <div class="thm" id="thm-reversal-reversal_keeps_the_residue_mod_nine_for_every_n">
5527
- <p class="thm-label"><strong>Theorem 545</strong> (<code>reversal_keeps_the_residue_mod_nine_for_every_n</code>)<a class="thm-cite" href="/theorem/lean_reversal_reversal_keeps_the_residue_mod_nine_for_every_n">sealed</a>.</p>
5634
+ <p class="thm-label"><strong>Theorem 560</strong> (<code>reversal_keeps_the_residue_mod_nine_for_every_n</code>)<a class="thm-cite" href="/theorem/lean_reversal_reversal_keeps_the_residue_mod_nine_for_every_n">sealed</a>.</p>
5528
5635
  <pre class="thm-statement"><code>∀ n : Nat, reverseNum n % 9 = n % 9</code></pre>
5529
5636
  </div>
5530
5637
  <p class="thm-remark">digital_root_is_invariant_under_reversal checked 1 ≤ n ≤ 300; this proves it for every n.</p>
@@ -5545,7 +5652,7 @@ centre (the heart). That shared structure is real; it is still not a proof of an
5545
5652
  axioms, every proof `by decide`, no Mathlib.
5546
5653
 
5547
5654
  <div class="thm" id="thm-theorems-universal_reflection_involution">
5548
- <p class="thm-label"><strong>Theorem 546</strong> (<code>universal_reflection_involution</code>)<a class="thm-cite" href="/theorem/lean_millenniumfloor.universal_universal_reflection_involution">sealed</a>.</p>
5655
+ <p class="thm-label"><strong>Theorem 561</strong> (<code>universal_reflection_involution</code>)<a class="thm-cite" href="/theorem/lean_millenniumfloor.universal_universal_reflection_involution">sealed</a>.</p>
5549
5656
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>10</mn><mo>}</mo></mrow><mo>,</mo><mrow><mrow><mi>refl</mi><mo>(</mo><mrow><mi>refl</mi><mo>(</mo><mi>d</mi><mo>)</mo></mrow><mo>)</mo></mrow><mo>=</mo><mi>d</mi></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mo>{</mo><mi>d</mi><mo>∈</mo><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>9</mn><mo>}</mo></mrow><mo>∣</mo><mrow><mrow><mi>refl</mi><mo>(</mo><mi>d</mi><mo>)</mo></mrow><mo>=</mo><mi>d</mi></mrow><mo>}</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>1</mn></mrow></mrow></math></div>
5550
5657
  <pre class="thm-statement"><code>(List.range 11).all (fun d =&gt; refl (refl d) == d) ∧ ((List.range 10).filter (fun d =&gt; refl d == d)).length = 1</code></pre>
5551
5658
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in \{0,\dots,10\},\; \mathrm{refl}\mathopen{}\left(\mathrm{refl}\mathopen{}\left(d\right)\right) = d \land \left|\{\, d \in \{0,\dots,9\} \mid \mathrm{refl}\mathopen{}\left(d\right) = d \,\}\right| = 1</code></pre></details>
@@ -5554,7 +5661,7 @@ axioms, every proof `by decide`, no Mathlib.
5554
5661
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 110 cases. <span class="qed">□</span></p>
5555
5662
 
5556
5663
  <div class="thm" id="thm-theorems-universal_centre_is_five">
5557
- <p class="thm-label"><strong>Theorem 547</strong> (<code>universal_centre_is_five</code>)<a class="thm-cite" href="/theorem/lean_millenniumfloor.universal_universal_centre_is_five">sealed</a>.</p>
5664
+ <p class="thm-label"><strong>Theorem 562</strong> (<code>universal_centre_is_five</code>)<a class="thm-cite" href="/theorem/lean_millenniumfloor.universal_universal_centre_is_five">sealed</a>.</p>
5558
5665
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>{</mo><mi>d</mi><mo>∈</mo><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>9</mn><mo>}</mo></mrow><mo>∣</mo><mrow><mrow><mi>refl</mi><mo>(</mo><mi>d</mi><mo>)</mo></mrow><mo>=</mo><mi>d</mi></mrow><mo>}</mo></mrow><mo>=</mo><mrow><mo>[</mo><mn>5</mn><mo>]</mo></mrow></mrow></math></div>
5559
5666
  <pre class="thm-statement"><code>((List.range 10).filter (fun d =&gt; refl d == d)) = [5]</code></pre>
5560
5667
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\{\, d \in \{0,\dots,9\} \mid \mathrm{refl}\mathopen{}\left(d\right) = d \,\} = [5]</code></pre></details>
@@ -5563,7 +5670,7 @@ axioms, every proof `by decide`, no Mathlib.
5563
5670
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 10 cases. <span class="qed">□</span></p>
5564
5671
 
5565
5672
  <div class="thm" id="thm-theorems-universal_pairs_sum_to_ten">
5566
- <p class="thm-label"><strong>Theorem 548</strong> (<code>universal_pairs_sum_to_ten</code>)<a class="thm-cite" href="/theorem/lean_millenniumfloor.universal_universal_pairs_sum_to_ten">sealed</a>.</p>
5673
+ <p class="thm-label"><strong>Theorem 563</strong> (<code>universal_pairs_sum_to_ten</code>)<a class="thm-cite" href="/theorem/lean_millenniumfloor.universal_universal_pairs_sum_to_ten">sealed</a>.</p>
5567
5674
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>10</mn><mo>}</mo></mrow><mo>,</mo><mrow><mrow><mi>d</mi><mo>+</mo><mrow><mi>refl</mi><mo>(</mo><mi>d</mi><mo>)</mo></mrow></mrow><mo>=</mo><mn>10</mn></mrow></mrow></math></div>
5568
5675
  <pre class="thm-statement"><code>(List.range 11).all (fun d =&gt; d + refl d == 10)</code></pre>
5569
5676
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in \{0,\dots,10\},\; d + \mathrm{refl}\mathopen{}\left(d\right) = 10</code></pre></details>
@@ -5572,7 +5679,7 @@ axioms, every proof `by decide`, no Mathlib.
5572
5679
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 11 cases. <span class="qed">□</span></p>
5573
5680
 
5574
5681
  <div class="thm" id="thm-theorems-universal_reflection_reverses_the_domain">
5575
- <p class="thm-label"><strong>Theorem 549</strong> (<code>universal_reflection_reverses_the_domain</code>)<a class="thm-cite" href="/theorem/lean_millenniumfloor.universal_universal_reflection_reverses_the_domain">sealed</a>.</p>
5682
+ <p class="thm-label"><strong>Theorem 564</strong> (<code>universal_reflection_reverses_the_domain</code>)<a class="thm-cite" href="/theorem/lean_millenniumfloor.universal_universal_reflection_reverses_the_domain">sealed</a>.</p>
5576
5683
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mi>refl</mi><mo>[</mo><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>10</mn><mo>}</mo></mrow><mo>]</mo></mrow><mo>=</mo><mrow><mi>reverse</mi><mo>(</mo><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>10</mn><mo>}</mo></mrow><mo>)</mo></mrow></mrow></math></div>
5577
5684
  <pre class="thm-statement"><code>(List.range 11).map refl = (List.range 11).reverse</code></pre>
5578
5685
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\mathrm{refl}[\{0,\dots,10\}] = \operatorname{reverse}\left(\{0,\dots,10\}\right)</code></pre></details>
@@ -5581,7 +5688,7 @@ axioms, every proof `by decide`, no Mathlib.
5581
5688
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 121 cases. <span class="qed">□</span></p>
5582
5689
 
5583
5690
  <div class="thm" id="thm-theorems-universal_reflection_is_not_an_involution_above_ten">
5584
- <p class="thm-label"><strong>Theorem 550</strong> (<code>universal_reflection_is_not_an_involution_above_ten</code>)<a class="thm-cite" href="/theorem/lean_millenniumfloor.universal_universal_reflection_is_not_an_involution_above_ten">sealed</a>.</p>
5691
+ <p class="thm-label"><strong>Theorem 565</strong> (<code>universal_reflection_is_not_an_involution_above_ten</code>)<a class="thm-cite" href="/theorem/lean_millenniumfloor.universal_universal_reflection_is_not_an_involution_above_ten">sealed</a>.</p>
5585
5692
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>{</mo><mrow><mi>k</mi><mo>+</mo><mn>11</mn></mrow><mo>∣</mo><mi>k</mi><mo>∈</mo><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>9</mn><mo>}</mo></mrow><mo>}</mo></mrow><mo>,</mo><mrow><mo>¬</mo><mrow><mrow><mi>refl</mi><mo>(</mo><mrow><mi>refl</mi><mo>(</mo><mi>d</mi><mo>)</mo></mrow><mo>)</mo></mrow><mo>=</mo><mi>d</mi></mrow></mrow></mrow></math></div>
5586
5693
  <pre class="thm-statement"><code>((List.range 10).map (fun k =&gt; k + 11)).all (fun d =&gt; ¬ (refl (refl d) == d))</code></pre>
5587
5694
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in \{\, k + 11 \mid k \in \{0,\dots,9\} \,\},\; \lnot \mathrm{refl}\mathopen{}\left(\mathrm{refl}\mathopen{}\left(d\right)\right) = d</code></pre></details>
@@ -5590,7 +5697,7 @@ axioms, every proof `by decide`, no Mathlib.
5590
5697
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 10 cases. <span class="qed">□</span></p>
5591
5698
 
5592
5699
  <div class="thm" id="thm-theorems-universal_z9_reflection_permutes_the_units">
5593
- <p class="thm-label"><strong>Theorem 551</strong> (<code>universal_z9_reflection_permutes_the_units</code>)<a class="thm-cite" href="/theorem/lean_millenniumfloor.universal_universal_z9_reflection_permutes_the_units">sealed</a>.</p>
5700
+ <p class="thm-label"><strong>Theorem 566</strong> (<code>universal_z9_reflection_permutes_the_units</code>)<a class="thm-cite" href="/theorem/lean_millenniumfloor.universal_universal_z9_reflection_permutes_the_units">sealed</a>.</p>
5594
5701
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>{</mo><mrow><mrow><mn>9</mn><mo>-</mo><mi>d</mi></mrow><mo>mod</mo><mn>9</mn></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>=</mo><mrow><mo>[</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>1</mn><mo>]</mo></mrow></mrow></math></div>
5595
5702
  <pre class="thm-statement"><code>([1, 2, 4, 5, 7, 8].map (fun d =&gt; (9 - d) % 9)) = [8, 7, 5, 4, 2, 1]</code></pre>
5596
5703
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\{\, 9 - d \bmod 9 \mid d \in [1,\,2,\,4,\,5,\,7,\,8] \,\} = [8,\,7,\,5,\,4,\,2,\,1]</code></pre></details>
@@ -5599,7 +5706,7 @@ axioms, every proof `by decide`, no Mathlib.
5599
5706
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 36 cases. <span class="qed">□</span></p>
5600
5707
 
5601
5708
  <div class="thm" id="thm-theorems-universal_millennium_reflection_escapes_the_units">
5602
- <p class="thm-label"><strong>Theorem 552</strong> (<code>universal_millennium_reflection_escapes_the_units</code>)<a class="thm-cite" href="/theorem/lean_millenniumfloor.universal_universal_millennium_reflection_escapes_the_units">sealed</a>.</p>
5709
+ <p class="thm-label"><strong>Theorem 567</strong> (<code>universal_millennium_reflection_escapes_the_units</code>)<a class="thm-cite" href="/theorem/lean_millenniumfloor.universal_universal_millennium_reflection_escapes_the_units">sealed</a>.</p>
5603
5710
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>¬</mo><mrow><mo>∀</mo><mi>u</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>refl</mi><mo>(</mo><mi>u</mi><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></mrow></math></div>
5604
5711
  <pre class="thm-statement"><code>¬ ([1, 2, 4, 5, 7, 8].all (fun u =&gt; [1, 2, 4, 5, 7, 8].contains (refl u)))</code></pre>
5605
5712
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\lnot \forall u \in [1,\,2,\,4,\,5,\,7,\,8],\; \mathrm{refl}\mathopen{}\left(u\right) \in [1,\,2,\,4,\,5,\,7,\,8]</code></pre></details>
@@ -5607,7 +5714,7 @@ axioms, every proof `by decide`, no Mathlib.
5607
5714
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 36 cases. <span class="qed">□</span></p>
5608
5715
 
5609
5716
  <div class="thm" id="thm-theorems-universal_reflection_is_the_vortex_reflection_shifted">
5610
- <p class="thm-label"><strong>Theorem 553</strong> (<code>universal_reflection_is_the_vortex_reflection_shifted</code>)<a class="thm-cite" href="/theorem/lean_millenniumfloor.universal_universal_reflection_is_the_vortex_reflection_shifted">sealed</a>.</p>
5717
+ <p class="thm-label"><strong>Theorem 568</strong> (<code>universal_reflection_is_the_vortex_reflection_shifted</code>)<a class="thm-cite" href="/theorem/lean_millenniumfloor.universal_universal_reflection_is_the_vortex_reflection_shifted">sealed</a>.</p>
5611
5718
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>9</mn><mo>}</mo></mrow><mo>,</mo><mrow><mrow><mrow><mn>10</mn><mo>-</mo><mi>d</mi></mrow><mo>mod</mo><mn>9</mn></mrow><mo>=</mo><mrow><mrow><mrow><mrow><mn>9</mn><mo>-</mo><mi>d</mi></mrow><mo>mod</mo><mn>9</mn></mrow><mo>+</mo><mn>1</mn></mrow><mo>mod</mo><mn>9</mn></mrow></mrow></mrow></math></div>
5612
5719
  <pre class="thm-statement"><code>(List.range 10).all (fun d =&gt; (10 - d) % 9 == ((9 - d) % 9 + 1) % 9)</code></pre>
5613
5720
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in \{0,\dots,9\},\; 10 - d \bmod 9 = 9 - d \bmod 9 + 1 \bmod 9</code></pre></details>
@@ -5629,7 +5736,7 @@ also holds for all its siblings. A property true of everything names nothing. Wh
5629
5736
  kernel accepted; whatever it refused is reported by the generator and is not in this file.
5630
5737
 
5631
5738
  <div class="thm" id="thm-imagined-units_is_closed_under_double">
5632
- <p class="thm-label"><strong>Theorem 554</strong> (<code>units_is_closed_under_double</code>)<a class="thm-cite" href="/theorem/lean_imagined_units_is_closed_under_double">sealed</a>.</p>
5739
+ <p class="thm-label"><strong>Theorem 569</strong> (<code>units_is_closed_under_double</code>)<a class="thm-cite" href="/theorem/lean_imagined_units_is_closed_under_double">sealed</a>.</p>
5633
5740
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>2</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5634
5741
  <pre class="thm-statement"><code>[1, 2, 4, 5, 7, 8].all (fun d =&gt; [1, 2, 4, 5, 7, 8].contains (m9 (2 * d)))</code></pre>
5635
5742
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,5,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(2 \cdot d\right) \in [1,\,2,\,4,\,5,\,7,\,8]</code></pre></details>
@@ -5638,7 +5745,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5638
5745
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 36 cases. <span class="qed">□</span></p>
5639
5746
 
5640
5747
  <div class="thm" id="thm-imagined-triad_is_closed_under_double">
5641
- <p class="thm-label"><strong>Theorem 555</strong> (<code>triad_is_closed_under_double</code>)<a class="thm-cite" href="/theorem/lean_imagined_triad_is_closed_under_double">sealed</a>.</p>
5748
+ <p class="thm-label"><strong>Theorem 570</strong> (<code>triad_is_closed_under_double</code>)<a class="thm-cite" href="/theorem/lean_imagined_triad_is_closed_under_double">sealed</a>.</p>
5642
5749
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>2</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5643
5750
  <pre class="thm-statement"><code>[3, 6, 0].all (fun d =&gt; [3, 6, 0].contains (m9 (2 * d)))</code></pre>
5644
5751
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [3,\,6,\,0],\; \mathrm{m9}\mathopen{}\left(2 \cdot d\right) \in [3,\,6,\,0]</code></pre></details>
@@ -5647,7 +5754,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5647
5754
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
5648
5755
 
5649
5756
  <div class="thm" id="thm-imagined-orbit_is_closed_under_double">
5650
- <p class="thm-label"><strong>Theorem 556</strong> (<code>orbit_is_closed_under_double</code>)<a class="thm-cite" href="/theorem/lean_imagined_orbit_is_closed_under_double">sealed</a>.</p>
5757
+ <p class="thm-label"><strong>Theorem 571</strong> (<code>orbit_is_closed_under_double</code>)<a class="thm-cite" href="/theorem/lean_imagined_orbit_is_closed_under_double">sealed</a>.</p>
5651
5758
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>2</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5652
5759
  <pre class="thm-statement"><code>[1, 2, 4, 8, 7, 5].all (fun d =&gt; [1, 2, 4, 8, 7, 5].contains (m9 (2 * d)))</code></pre>
5653
5760
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,8,\,7,\,5],\; \mathrm{m9}\mathopen{}\left(2 \cdot d\right) \in [1,\,2,\,4,\,8,\,7,\,5]</code></pre></details>
@@ -5656,7 +5763,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5656
5763
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 36 cases. <span class="qed">□</span></p>
5657
5764
 
5658
5765
  <div class="thm" id="thm-imagined-all_is_closed_under_double">
5659
- <p class="thm-label"><strong>Theorem 557</strong> (<code>all_is_closed_under_double</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_double">sealed</a>.</p>
5766
+ <p class="thm-label"><strong>Theorem 572</strong> (<code>all_is_closed_under_double</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_double">sealed</a>.</p>
5660
5767
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>2</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5661
5768
  <pre class="thm-statement"><code>[0,1,2,3,4,5,6,7,8].all (fun d =&gt; [0,1,2,3,4,5,6,7,8].contains (m9 (2 * d)))</code></pre>
5662
5769
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(2 \cdot d\right) \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8]</code></pre></details>
@@ -5665,7 +5772,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5665
5772
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 81 cases. <span class="qed">□</span></p>
5666
5773
 
5667
5774
  <div class="thm" id="thm-imagined-triad_is_closed_under_triple">
5668
- <p class="thm-label"><strong>Theorem 558</strong> (<code>triad_is_closed_under_triple</code>)<a class="thm-cite" href="/theorem/lean_imagined_triad_is_closed_under_triple">sealed</a>.</p>
5775
+ <p class="thm-label"><strong>Theorem 573</strong> (<code>triad_is_closed_under_triple</code>)<a class="thm-cite" href="/theorem/lean_imagined_triad_is_closed_under_triple">sealed</a>.</p>
5669
5776
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>3</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5670
5777
  <pre class="thm-statement"><code>[3, 6, 0].all (fun d =&gt; [3, 6, 0].contains (m9 (3 * d)))</code></pre>
5671
5778
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [3,\,6,\,0],\; \mathrm{m9}\mathopen{}\left(3 \cdot d\right) \in [3,\,6,\,0]</code></pre></details>
@@ -5674,7 +5781,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5674
5781
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
5675
5782
 
5676
5783
  <div class="thm" id="thm-imagined-all_is_closed_under_triple">
5677
- <p class="thm-label"><strong>Theorem 559</strong> (<code>all_is_closed_under_triple</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_triple">sealed</a>.</p>
5784
+ <p class="thm-label"><strong>Theorem 574</strong> (<code>all_is_closed_under_triple</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_triple">sealed</a>.</p>
5678
5785
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>3</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5679
5786
  <pre class="thm-statement"><code>[0,1,2,3,4,5,6,7,8].all (fun d =&gt; [0,1,2,3,4,5,6,7,8].contains (m9 (3 * d)))</code></pre>
5680
5787
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(3 \cdot d\right) \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8]</code></pre></details>
@@ -5683,7 +5790,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5683
5790
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 81 cases. <span class="qed">□</span></p>
5684
5791
 
5685
5792
  <div class="thm" id="thm-imagined-units_is_closed_under_quadruple">
5686
- <p class="thm-label"><strong>Theorem 560</strong> (<code>units_is_closed_under_quadruple</code>)<a class="thm-cite" href="/theorem/lean_imagined_units_is_closed_under_quadruple">sealed</a>.</p>
5793
+ <p class="thm-label"><strong>Theorem 575</strong> (<code>units_is_closed_under_quadruple</code>)<a class="thm-cite" href="/theorem/lean_imagined_units_is_closed_under_quadruple">sealed</a>.</p>
5687
5794
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>4</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5688
5795
  <pre class="thm-statement"><code>[1, 2, 4, 5, 7, 8].all (fun d =&gt; [1, 2, 4, 5, 7, 8].contains (m9 (4 * d)))</code></pre>
5689
5796
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,5,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(4 \cdot d\right) \in [1,\,2,\,4,\,5,\,7,\,8]</code></pre></details>
@@ -5692,7 +5799,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5692
5799
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 36 cases. <span class="qed">□</span></p>
5693
5800
 
5694
5801
  <div class="thm" id="thm-imagined-triad_is_closed_under_quadruple">
5695
- <p class="thm-label"><strong>Theorem 561</strong> (<code>triad_is_closed_under_quadruple</code>)<a class="thm-cite" href="/theorem/lean_imagined_triad_is_closed_under_quadruple">sealed</a>.</p>
5802
+ <p class="thm-label"><strong>Theorem 576</strong> (<code>triad_is_closed_under_quadruple</code>)<a class="thm-cite" href="/theorem/lean_imagined_triad_is_closed_under_quadruple">sealed</a>.</p>
5696
5803
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>4</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5697
5804
  <pre class="thm-statement"><code>[3, 6, 0].all (fun d =&gt; [3, 6, 0].contains (m9 (4 * d)))</code></pre>
5698
5805
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [3,\,6,\,0],\; \mathrm{m9}\mathopen{}\left(4 \cdot d\right) \in [3,\,6,\,0]</code></pre></details>
@@ -5701,7 +5808,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5701
5808
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
5702
5809
 
5703
5810
  <div class="thm" id="thm-imagined-orbit_is_closed_under_quadruple">
5704
- <p class="thm-label"><strong>Theorem 562</strong> (<code>orbit_is_closed_under_quadruple</code>)<a class="thm-cite" href="/theorem/lean_imagined_orbit_is_closed_under_quadruple">sealed</a>.</p>
5811
+ <p class="thm-label"><strong>Theorem 577</strong> (<code>orbit_is_closed_under_quadruple</code>)<a class="thm-cite" href="/theorem/lean_imagined_orbit_is_closed_under_quadruple">sealed</a>.</p>
5705
5812
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>4</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5706
5813
  <pre class="thm-statement"><code>[1, 2, 4, 8, 7, 5].all (fun d =&gt; [1, 2, 4, 8, 7, 5].contains (m9 (4 * d)))</code></pre>
5707
5814
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,8,\,7,\,5],\; \mathrm{m9}\mathopen{}\left(4 \cdot d\right) \in [1,\,2,\,4,\,8,\,7,\,5]</code></pre></details>
@@ -5710,7 +5817,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5710
5817
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 36 cases. <span class="qed">□</span></p>
5711
5818
 
5712
5819
  <div class="thm" id="thm-imagined-tetA_is_closed_under_quadruple">
5713
- <p class="thm-label"><strong>Theorem 563</strong> (<code>tetA_is_closed_under_quadruple</code>)<a class="thm-cite" href="/theorem/lean_imagined_tetA_is_closed_under_quadruple">sealed</a>.</p>
5820
+ <p class="thm-label"><strong>Theorem 578</strong> (<code>tetA_is_closed_under_quadruple</code>)<a class="thm-cite" href="/theorem/lean_imagined_tetA_is_closed_under_quadruple">sealed</a>.</p>
5714
5821
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>4</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5715
5822
  <pre class="thm-statement"><code>[1, 4, 7].all (fun d =&gt; [1, 4, 7].contains (m9 (4 * d)))</code></pre>
5716
5823
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,4,\,7],\; \mathrm{m9}\mathopen{}\left(4 \cdot d\right) \in [1,\,4,\,7]</code></pre></details>
@@ -5719,7 +5826,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5719
5826
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
5720
5827
 
5721
5828
  <div class="thm" id="thm-imagined-tetB_is_closed_under_quadruple">
5722
- <p class="thm-label"><strong>Theorem 564</strong> (<code>tetB_is_closed_under_quadruple</code>)<a class="thm-cite" href="/theorem/lean_imagined_tetB_is_closed_under_quadruple">sealed</a>.</p>
5829
+ <p class="thm-label"><strong>Theorem 579</strong> (<code>tetB_is_closed_under_quadruple</code>)<a class="thm-cite" href="/theorem/lean_imagined_tetB_is_closed_under_quadruple">sealed</a>.</p>
5723
5830
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>4</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5724
5831
  <pre class="thm-statement"><code>[2, 5, 8].all (fun d =&gt; [2, 5, 8].contains (m9 (4 * d)))</code></pre>
5725
5832
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [2,\,5,\,8],\; \mathrm{m9}\mathopen{}\left(4 \cdot d\right) \in [2,\,5,\,8]</code></pre></details>
@@ -5728,7 +5835,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5728
5835
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
5729
5836
 
5730
5837
  <div class="thm" id="thm-imagined-all_is_closed_under_quadruple">
5731
- <p class="thm-label"><strong>Theorem 565</strong> (<code>all_is_closed_under_quadruple</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_quadruple">sealed</a>.</p>
5838
+ <p class="thm-label"><strong>Theorem 580</strong> (<code>all_is_closed_under_quadruple</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_quadruple">sealed</a>.</p>
5732
5839
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>4</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5733
5840
  <pre class="thm-statement"><code>[0,1,2,3,4,5,6,7,8].all (fun d =&gt; [0,1,2,3,4,5,6,7,8].contains (m9 (4 * d)))</code></pre>
5734
5841
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(4 \cdot d\right) \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8]</code></pre></details>
@@ -5737,7 +5844,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5737
5844
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 81 cases. <span class="qed">□</span></p>
5738
5845
 
5739
5846
  <div class="thm" id="thm-imagined-squares_is_closed_under_quadruple">
5740
- <p class="thm-label"><strong>Theorem 566</strong> (<code>squares_is_closed_under_quadruple</code>)<a class="thm-cite" href="/theorem/lean_imagined_squares_is_closed_under_quadruple">sealed</a>.</p>
5847
+ <p class="thm-label"><strong>Theorem 581</strong> (<code>squares_is_closed_under_quadruple</code>)<a class="thm-cite" href="/theorem/lean_imagined_squares_is_closed_under_quadruple">sealed</a>.</p>
5741
5848
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>4</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5742
5849
  <pre class="thm-statement"><code>[0, 1, 4, 7].all (fun d =&gt; [0, 1, 4, 7].contains (m9 (4 * d)))</code></pre>
5743
5850
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,4,\,7],\; \mathrm{m9}\mathopen{}\left(4 \cdot d\right) \in [0,\,1,\,4,\,7]</code></pre></details>
@@ -5746,7 +5853,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5746
5853
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 16 cases. <span class="qed">□</span></p>
5747
5854
 
5748
5855
  <div class="thm" id="thm-imagined-triad_is_closed_under_negate">
5749
- <p class="thm-label"><strong>Theorem 567</strong> (<code>triad_is_closed_under_negate</code>)<a class="thm-cite" href="/theorem/lean_imagined_triad_is_closed_under_negate">sealed</a>.</p>
5856
+ <p class="thm-label"><strong>Theorem 582</strong> (<code>triad_is_closed_under_negate</code>)<a class="thm-cite" href="/theorem/lean_imagined_triad_is_closed_under_negate">sealed</a>.</p>
5750
5857
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>9</mn><mo>-</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5751
5858
  <pre class="thm-statement"><code>[3, 6, 0].all (fun d =&gt; [3, 6, 0].contains (m9 (9 - d)))</code></pre>
5752
5859
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [3,\,6,\,0],\; \mathrm{m9}\mathopen{}\left(9 - d\right) \in [3,\,6,\,0]</code></pre></details>
@@ -5755,7 +5862,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5755
5862
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
5756
5863
 
5757
5864
  <div class="thm" id="thm-imagined-orbit_is_closed_under_negate">
5758
- <p class="thm-label"><strong>Theorem 568</strong> (<code>orbit_is_closed_under_negate</code>)<a class="thm-cite" href="/theorem/lean_imagined_orbit_is_closed_under_negate">sealed</a>.</p>
5865
+ <p class="thm-label"><strong>Theorem 583</strong> (<code>orbit_is_closed_under_negate</code>)<a class="thm-cite" href="/theorem/lean_imagined_orbit_is_closed_under_negate">sealed</a>.</p>
5759
5866
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>9</mn><mo>-</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5760
5867
  <pre class="thm-statement"><code>[1, 2, 4, 8, 7, 5].all (fun d =&gt; [1, 2, 4, 8, 7, 5].contains (m9 (9 - d)))</code></pre>
5761
5868
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,8,\,7,\,5],\; \mathrm{m9}\mathopen{}\left(9 - d\right) \in [1,\,2,\,4,\,8,\,7,\,5]</code></pre></details>
@@ -5764,7 +5871,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5764
5871
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 36 cases. <span class="qed">□</span></p>
5765
5872
 
5766
5873
  <div class="thm" id="thm-imagined-all_is_closed_under_negate">
5767
- <p class="thm-label"><strong>Theorem 569</strong> (<code>all_is_closed_under_negate</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_negate">sealed</a>.</p>
5874
+ <p class="thm-label"><strong>Theorem 584</strong> (<code>all_is_closed_under_negate</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_negate">sealed</a>.</p>
5768
5875
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>9</mn><mo>-</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5769
5876
  <pre class="thm-statement"><code>[0,1,2,3,4,5,6,7,8].all (fun d =&gt; [0,1,2,3,4,5,6,7,8].contains (m9 (9 - d)))</code></pre>
5770
5877
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(9 - d\right) \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8]</code></pre></details>
@@ -5773,7 +5880,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5773
5880
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 81 cases. <span class="qed">□</span></p>
5774
5881
 
5775
5882
  <div class="thm" id="thm-imagined-cubes_is_closed_under_negate">
5776
- <p class="thm-label"><strong>Theorem 570</strong> (<code>cubes_is_closed_under_negate</code>)<a class="thm-cite" href="/theorem/lean_imagined_cubes_is_closed_under_negate">sealed</a>.</p>
5883
+ <p class="thm-label"><strong>Theorem 585</strong> (<code>cubes_is_closed_under_negate</code>)<a class="thm-cite" href="/theorem/lean_imagined_cubes_is_closed_under_negate">sealed</a>.</p>
5777
5884
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>9</mn><mo>-</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5778
5885
  <pre class="thm-statement"><code>[0, 1, 8].all (fun d =&gt; [0, 1, 8].contains (m9 (9 - d)))</code></pre>
5779
5886
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,8],\; \mathrm{m9}\mathopen{}\left(9 - d\right) \in [0,\,1,\,8]</code></pre></details>
@@ -5782,7 +5889,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5782
5889
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
5783
5890
 
5784
5891
  <div class="thm" id="thm-imagined-units_is_closed_under_square">
5785
- <p class="thm-label"><strong>Theorem 571</strong> (<code>units_is_closed_under_square</code>)<a class="thm-cite" href="/theorem/lean_imagined_units_is_closed_under_square">sealed</a>.</p>
5892
+ <p class="thm-label"><strong>Theorem 586</strong> (<code>units_is_closed_under_square</code>)<a class="thm-cite" href="/theorem/lean_imagined_units_is_closed_under_square">sealed</a>.</p>
5786
5893
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5787
5894
  <pre class="thm-statement"><code>[1, 2, 4, 5, 7, 8].all (fun d =&gt; [1, 2, 4, 5, 7, 8].contains (m9 (d * d)))</code></pre>
5788
5895
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,5,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(d \cdot d\right) \in [1,\,2,\,4,\,5,\,7,\,8]</code></pre></details>
@@ -5791,7 +5898,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5791
5898
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 36 cases. <span class="qed">□</span></p>
5792
5899
 
5793
5900
  <div class="thm" id="thm-imagined-orbit_is_closed_under_square">
5794
- <p class="thm-label"><strong>Theorem 572</strong> (<code>orbit_is_closed_under_square</code>)<a class="thm-cite" href="/theorem/lean_imagined_orbit_is_closed_under_square">sealed</a>.</p>
5901
+ <p class="thm-label"><strong>Theorem 587</strong> (<code>orbit_is_closed_under_square</code>)<a class="thm-cite" href="/theorem/lean_imagined_orbit_is_closed_under_square">sealed</a>.</p>
5795
5902
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5796
5903
  <pre class="thm-statement"><code>[1, 2, 4, 8, 7, 5].all (fun d =&gt; [1, 2, 4, 8, 7, 5].contains (m9 (d * d)))</code></pre>
5797
5904
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,8,\,7,\,5],\; \mathrm{m9}\mathopen{}\left(d \cdot d\right) \in [1,\,2,\,4,\,8,\,7,\,5]</code></pre></details>
@@ -5800,7 +5907,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5800
5907
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 36 cases. <span class="qed">□</span></p>
5801
5908
 
5802
5909
  <div class="thm" id="thm-imagined-tetA_is_closed_under_square">
5803
- <p class="thm-label"><strong>Theorem 573</strong> (<code>tetA_is_closed_under_square</code>)<a class="thm-cite" href="/theorem/lean_imagined_tetA_is_closed_under_square">sealed</a>.</p>
5910
+ <p class="thm-label"><strong>Theorem 588</strong> (<code>tetA_is_closed_under_square</code>)<a class="thm-cite" href="/theorem/lean_imagined_tetA_is_closed_under_square">sealed</a>.</p>
5804
5911
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5805
5912
  <pre class="thm-statement"><code>[1, 4, 7].all (fun d =&gt; [1, 4, 7].contains (m9 (d * d)))</code></pre>
5806
5913
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,4,\,7],\; \mathrm{m9}\mathopen{}\left(d \cdot d\right) \in [1,\,4,\,7]</code></pre></details>
@@ -5809,7 +5916,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5809
5916
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
5810
5917
 
5811
5918
  <div class="thm" id="thm-imagined-all_is_closed_under_square">
5812
- <p class="thm-label"><strong>Theorem 574</strong> (<code>all_is_closed_under_square</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_square">sealed</a>.</p>
5919
+ <p class="thm-label"><strong>Theorem 589</strong> (<code>all_is_closed_under_square</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_square">sealed</a>.</p>
5813
5920
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5814
5921
  <pre class="thm-statement"><code>[0,1,2,3,4,5,6,7,8].all (fun d =&gt; [0,1,2,3,4,5,6,7,8].contains (m9 (d * d)))</code></pre>
5815
5922
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(d \cdot d\right) \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8]</code></pre></details>
@@ -5818,7 +5925,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5818
5925
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 81 cases. <span class="qed">□</span></p>
5819
5926
 
5820
5927
  <div class="thm" id="thm-imagined-squares_is_closed_under_square">
5821
- <p class="thm-label"><strong>Theorem 575</strong> (<code>squares_is_closed_under_square</code>)<a class="thm-cite" href="/theorem/lean_imagined_squares_is_closed_under_square">sealed</a>.</p>
5928
+ <p class="thm-label"><strong>Theorem 590</strong> (<code>squares_is_closed_under_square</code>)<a class="thm-cite" href="/theorem/lean_imagined_squares_is_closed_under_square">sealed</a>.</p>
5822
5929
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5823
5930
  <pre class="thm-statement"><code>[0, 1, 4, 7].all (fun d =&gt; [0, 1, 4, 7].contains (m9 (d * d)))</code></pre>
5824
5931
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,4,\,7],\; \mathrm{m9}\mathopen{}\left(d \cdot d\right) \in [0,\,1,\,4,\,7]</code></pre></details>
@@ -5827,7 +5934,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5827
5934
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 16 cases. <span class="qed">□</span></p>
5828
5935
 
5829
5936
  <div class="thm" id="thm-imagined-cubes_is_closed_under_square">
5830
- <p class="thm-label"><strong>Theorem 576</strong> (<code>cubes_is_closed_under_square</code>)<a class="thm-cite" href="/theorem/lean_imagined_cubes_is_closed_under_square">sealed</a>.</p>
5937
+ <p class="thm-label"><strong>Theorem 591</strong> (<code>cubes_is_closed_under_square</code>)<a class="thm-cite" href="/theorem/lean_imagined_cubes_is_closed_under_square">sealed</a>.</p>
5831
5938
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5832
5939
  <pre class="thm-statement"><code>[0, 1, 8].all (fun d =&gt; [0, 1, 8].contains (m9 (d * d)))</code></pre>
5833
5940
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,8],\; \mathrm{m9}\mathopen{}\left(d \cdot d\right) \in [0,\,1,\,8]</code></pre></details>
@@ -5836,7 +5943,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5836
5943
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
5837
5944
 
5838
5945
  <div class="thm" id="thm-imagined-units_is_closed_under_fourth">
5839
- <p class="thm-label"><strong>Theorem 577</strong> (<code>units_is_closed_under_fourth</code>)<a class="thm-cite" href="/theorem/lean_imagined_units_is_closed_under_fourth">sealed</a>.</p>
5946
+ <p class="thm-label"><strong>Theorem 592</strong> (<code>units_is_closed_under_fourth</code>)<a class="thm-cite" href="/theorem/lean_imagined_units_is_closed_under_fourth">sealed</a>.</p>
5840
5947
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>4</mn></msup><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5841
5948
  <pre class="thm-statement"><code>[1, 2, 4, 5, 7, 8].all (fun d =&gt; [1, 2, 4, 5, 7, 8].contains (m9 (d ^ 4)))</code></pre>
5842
5949
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,5,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(d^{4}\right) \in [1,\,2,\,4,\,5,\,7,\,8]</code></pre></details>
@@ -5845,7 +5952,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5845
5952
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 36 cases. <span class="qed">□</span></p>
5846
5953
 
5847
5954
  <div class="thm" id="thm-imagined-triad_is_closed_under_fourth">
5848
- <p class="thm-label"><strong>Theorem 578</strong> (<code>triad_is_closed_under_fourth</code>)<a class="thm-cite" href="/theorem/lean_imagined_triad_is_closed_under_fourth">sealed</a>.</p>
5955
+ <p class="thm-label"><strong>Theorem 593</strong> (<code>triad_is_closed_under_fourth</code>)<a class="thm-cite" href="/theorem/lean_imagined_triad_is_closed_under_fourth">sealed</a>.</p>
5849
5956
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>4</mn></msup><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5850
5957
  <pre class="thm-statement"><code>[3, 6, 0].all (fun d =&gt; [3, 6, 0].contains (m9 (d ^ 4)))</code></pre>
5851
5958
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [3,\,6,\,0],\; \mathrm{m9}\mathopen{}\left(d^{4}\right) \in [3,\,6,\,0]</code></pre></details>
@@ -5854,7 +5961,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5854
5961
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
5855
5962
 
5856
5963
  <div class="thm" id="thm-imagined-orbit_is_closed_under_fourth">
5857
- <p class="thm-label"><strong>Theorem 579</strong> (<code>orbit_is_closed_under_fourth</code>)<a class="thm-cite" href="/theorem/lean_imagined_orbit_is_closed_under_fourth">sealed</a>.</p>
5964
+ <p class="thm-label"><strong>Theorem 594</strong> (<code>orbit_is_closed_under_fourth</code>)<a class="thm-cite" href="/theorem/lean_imagined_orbit_is_closed_under_fourth">sealed</a>.</p>
5858
5965
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>4</mn></msup><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5859
5966
  <pre class="thm-statement"><code>[1, 2, 4, 8, 7, 5].all (fun d =&gt; [1, 2, 4, 8, 7, 5].contains (m9 (d ^ 4)))</code></pre>
5860
5967
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,8,\,7,\,5],\; \mathrm{m9}\mathopen{}\left(d^{4}\right) \in [1,\,2,\,4,\,8,\,7,\,5]</code></pre></details>
@@ -5863,7 +5970,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5863
5970
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 36 cases. <span class="qed">□</span></p>
5864
5971
 
5865
5972
  <div class="thm" id="thm-imagined-tetA_is_closed_under_fourth">
5866
- <p class="thm-label"><strong>Theorem 580</strong> (<code>tetA_is_closed_under_fourth</code>)<a class="thm-cite" href="/theorem/lean_imagined_tetA_is_closed_under_fourth">sealed</a>.</p>
5973
+ <p class="thm-label"><strong>Theorem 595</strong> (<code>tetA_is_closed_under_fourth</code>)<a class="thm-cite" href="/theorem/lean_imagined_tetA_is_closed_under_fourth">sealed</a>.</p>
5867
5974
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>4</mn></msup><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5868
5975
  <pre class="thm-statement"><code>[1, 4, 7].all (fun d =&gt; [1, 4, 7].contains (m9 (d ^ 4)))</code></pre>
5869
5976
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,4,\,7],\; \mathrm{m9}\mathopen{}\left(d^{4}\right) \in [1,\,4,\,7]</code></pre></details>
@@ -5872,7 +5979,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5872
5979
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
5873
5980
 
5874
5981
  <div class="thm" id="thm-imagined-all_is_closed_under_fourth">
5875
- <p class="thm-label"><strong>Theorem 581</strong> (<code>all_is_closed_under_fourth</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_fourth">sealed</a>.</p>
5982
+ <p class="thm-label"><strong>Theorem 596</strong> (<code>all_is_closed_under_fourth</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_fourth">sealed</a>.</p>
5876
5983
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>4</mn></msup><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5877
5984
  <pre class="thm-statement"><code>[0,1,2,3,4,5,6,7,8].all (fun d =&gt; [0,1,2,3,4,5,6,7,8].contains (m9 (d ^ 4)))</code></pre>
5878
5985
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(d^{4}\right) \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8]</code></pre></details>
@@ -5881,7 +5988,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5881
5988
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 81 cases. <span class="qed">□</span></p>
5882
5989
 
5883
5990
  <div class="thm" id="thm-imagined-squares_is_closed_under_fourth">
5884
- <p class="thm-label"><strong>Theorem 582</strong> (<code>squares_is_closed_under_fourth</code>)<a class="thm-cite" href="/theorem/lean_imagined_squares_is_closed_under_fourth">sealed</a>.</p>
5991
+ <p class="thm-label"><strong>Theorem 597</strong> (<code>squares_is_closed_under_fourth</code>)<a class="thm-cite" href="/theorem/lean_imagined_squares_is_closed_under_fourth">sealed</a>.</p>
5885
5992
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>4</mn></msup><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5886
5993
  <pre class="thm-statement"><code>[0, 1, 4, 7].all (fun d =&gt; [0, 1, 4, 7].contains (m9 (d ^ 4)))</code></pre>
5887
5994
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,4,\,7],\; \mathrm{m9}\mathopen{}\left(d^{4}\right) \in [0,\,1,\,4,\,7]</code></pre></details>
@@ -5890,7 +5997,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5890
5997
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 16 cases. <span class="qed">□</span></p>
5891
5998
 
5892
5999
  <div class="thm" id="thm-imagined-cubes_is_closed_under_fourth">
5893
- <p class="thm-label"><strong>Theorem 583</strong> (<code>cubes_is_closed_under_fourth</code>)<a class="thm-cite" href="/theorem/lean_imagined_cubes_is_closed_under_fourth">sealed</a>.</p>
6000
+ <p class="thm-label"><strong>Theorem 598</strong> (<code>cubes_is_closed_under_fourth</code>)<a class="thm-cite" href="/theorem/lean_imagined_cubes_is_closed_under_fourth">sealed</a>.</p>
5894
6001
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>4</mn></msup><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5895
6002
  <pre class="thm-statement"><code>[0, 1, 8].all (fun d =&gt; [0, 1, 8].contains (m9 (d ^ 4)))</code></pre>
5896
6003
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,8],\; \mathrm{m9}\mathopen{}\left(d^{4}\right) \in [0,\,1,\,8]</code></pre></details>
@@ -5899,7 +6006,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5899
6006
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
5900
6007
 
5901
6008
  <div class="thm" id="thm-imagined-units_is_closed_under_sixth">
5902
- <p class="thm-label"><strong>Theorem 584</strong> (<code>units_is_closed_under_sixth</code>)<a class="thm-cite" href="/theorem/lean_imagined_units_is_closed_under_sixth">sealed</a>.</p>
6009
+ <p class="thm-label"><strong>Theorem 599</strong> (<code>units_is_closed_under_sixth</code>)<a class="thm-cite" href="/theorem/lean_imagined_units_is_closed_under_sixth">sealed</a>.</p>
5903
6010
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>6</mn></msup><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5904
6011
  <pre class="thm-statement"><code>[1, 2, 4, 5, 7, 8].all (fun d =&gt; [1, 2, 4, 5, 7, 8].contains (m9 (d ^ 6)))</code></pre>
5905
6012
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,5,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(d^{6}\right) \in [1,\,2,\,4,\,5,\,7,\,8]</code></pre></details>
@@ -5908,7 +6015,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5908
6015
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 36 cases. <span class="qed">□</span></p>
5909
6016
 
5910
6017
  <div class="thm" id="thm-imagined-triad_is_closed_under_sixth">
5911
- <p class="thm-label"><strong>Theorem 585</strong> (<code>triad_is_closed_under_sixth</code>)<a class="thm-cite" href="/theorem/lean_imagined_triad_is_closed_under_sixth">sealed</a>.</p>
6018
+ <p class="thm-label"><strong>Theorem 600</strong> (<code>triad_is_closed_under_sixth</code>)<a class="thm-cite" href="/theorem/lean_imagined_triad_is_closed_under_sixth">sealed</a>.</p>
5912
6019
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>6</mn></msup><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5913
6020
  <pre class="thm-statement"><code>[3, 6, 0].all (fun d =&gt; [3, 6, 0].contains (m9 (d ^ 6)))</code></pre>
5914
6021
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [3,\,6,\,0],\; \mathrm{m9}\mathopen{}\left(d^{6}\right) \in [3,\,6,\,0]</code></pre></details>
@@ -5917,7 +6024,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5917
6024
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
5918
6025
 
5919
6026
  <div class="thm" id="thm-imagined-orbit_is_closed_under_sixth">
5920
- <p class="thm-label"><strong>Theorem 586</strong> (<code>orbit_is_closed_under_sixth</code>)<a class="thm-cite" href="/theorem/lean_imagined_orbit_is_closed_under_sixth">sealed</a>.</p>
6027
+ <p class="thm-label"><strong>Theorem 601</strong> (<code>orbit_is_closed_under_sixth</code>)<a class="thm-cite" href="/theorem/lean_imagined_orbit_is_closed_under_sixth">sealed</a>.</p>
5921
6028
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>6</mn></msup><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5922
6029
  <pre class="thm-statement"><code>[1, 2, 4, 8, 7, 5].all (fun d =&gt; [1, 2, 4, 8, 7, 5].contains (m9 (d ^ 6)))</code></pre>
5923
6030
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,8,\,7,\,5],\; \mathrm{m9}\mathopen{}\left(d^{6}\right) \in [1,\,2,\,4,\,8,\,7,\,5]</code></pre></details>
@@ -5926,7 +6033,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5926
6033
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 36 cases. <span class="qed">□</span></p>
5927
6034
 
5928
6035
  <div class="thm" id="thm-imagined-tetA_is_closed_under_sixth">
5929
- <p class="thm-label"><strong>Theorem 587</strong> (<code>tetA_is_closed_under_sixth</code>)<a class="thm-cite" href="/theorem/lean_imagined_tetA_is_closed_under_sixth">sealed</a>.</p>
6036
+ <p class="thm-label"><strong>Theorem 602</strong> (<code>tetA_is_closed_under_sixth</code>)<a class="thm-cite" href="/theorem/lean_imagined_tetA_is_closed_under_sixth">sealed</a>.</p>
5930
6037
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>6</mn></msup><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5931
6038
  <pre class="thm-statement"><code>[1, 4, 7].all (fun d =&gt; [1, 4, 7].contains (m9 (d ^ 6)))</code></pre>
5932
6039
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,4,\,7],\; \mathrm{m9}\mathopen{}\left(d^{6}\right) \in [1,\,4,\,7]</code></pre></details>
@@ -5935,7 +6042,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5935
6042
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
5936
6043
 
5937
6044
  <div class="thm" id="thm-imagined-all_is_closed_under_sixth">
5938
- <p class="thm-label"><strong>Theorem 588</strong> (<code>all_is_closed_under_sixth</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_sixth">sealed</a>.</p>
6045
+ <p class="thm-label"><strong>Theorem 603</strong> (<code>all_is_closed_under_sixth</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_sixth">sealed</a>.</p>
5939
6046
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>6</mn></msup><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5940
6047
  <pre class="thm-statement"><code>[0,1,2,3,4,5,6,7,8].all (fun d =&gt; [0,1,2,3,4,5,6,7,8].contains (m9 (d ^ 6)))</code></pre>
5941
6048
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(d^{6}\right) \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8]</code></pre></details>
@@ -5944,7 +6051,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5944
6051
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 81 cases. <span class="qed">□</span></p>
5945
6052
 
5946
6053
  <div class="thm" id="thm-imagined-squares_is_closed_under_sixth">
5947
- <p class="thm-label"><strong>Theorem 589</strong> (<code>squares_is_closed_under_sixth</code>)<a class="thm-cite" href="/theorem/lean_imagined_squares_is_closed_under_sixth">sealed</a>.</p>
6054
+ <p class="thm-label"><strong>Theorem 604</strong> (<code>squares_is_closed_under_sixth</code>)<a class="thm-cite" href="/theorem/lean_imagined_squares_is_closed_under_sixth">sealed</a>.</p>
5948
6055
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>6</mn></msup><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5949
6056
  <pre class="thm-statement"><code>[0, 1, 4, 7].all (fun d =&gt; [0, 1, 4, 7].contains (m9 (d ^ 6)))</code></pre>
5950
6057
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,4,\,7],\; \mathrm{m9}\mathopen{}\left(d^{6}\right) \in [0,\,1,\,4,\,7]</code></pre></details>
@@ -5953,7 +6060,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5953
6060
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 16 cases. <span class="qed">□</span></p>
5954
6061
 
5955
6062
  <div class="thm" id="thm-imagined-cubes_is_closed_under_sixth">
5956
- <p class="thm-label"><strong>Theorem 590</strong> (<code>cubes_is_closed_under_sixth</code>)<a class="thm-cite" href="/theorem/lean_imagined_cubes_is_closed_under_sixth">sealed</a>.</p>
6063
+ <p class="thm-label"><strong>Theorem 605</strong> (<code>cubes_is_closed_under_sixth</code>)<a class="thm-cite" href="/theorem/lean_imagined_cubes_is_closed_under_sixth">sealed</a>.</p>
5957
6064
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>6</mn></msup><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5958
6065
  <pre class="thm-statement"><code>[0, 1, 8].all (fun d =&gt; [0, 1, 8].contains (m9 (d ^ 6)))</code></pre>
5959
6066
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,8],\; \mathrm{m9}\mathopen{}\left(d^{6}\right) \in [0,\,1,\,8]</code></pre></details>
@@ -5962,7 +6069,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5962
6069
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
5963
6070
 
5964
6071
  <div class="thm" id="thm-imagined-units_is_closed_under_quintuple">
5965
- <p class="thm-label"><strong>Theorem 591</strong> (<code>units_is_closed_under_quintuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_units_is_closed_under_quintuple">sealed</a>.</p>
6072
+ <p class="thm-label"><strong>Theorem 606</strong> (<code>units_is_closed_under_quintuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_units_is_closed_under_quintuple">sealed</a>.</p>
5966
6073
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>5</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5967
6074
  <pre class="thm-statement"><code>[1, 2, 4, 5, 7, 8].all (fun d =&gt; [1, 2, 4, 5, 7, 8].contains (m9 (5 * d)))</code></pre>
5968
6075
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,5,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(5 \cdot d\right) \in [1,\,2,\,4,\,5,\,7,\,8]</code></pre></details>
@@ -5971,7 +6078,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5971
6078
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 36 cases. <span class="qed">□</span></p>
5972
6079
 
5973
6080
  <div class="thm" id="thm-imagined-triad_is_closed_under_quintuple">
5974
- <p class="thm-label"><strong>Theorem 592</strong> (<code>triad_is_closed_under_quintuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_triad_is_closed_under_quintuple">sealed</a>.</p>
6081
+ <p class="thm-label"><strong>Theorem 607</strong> (<code>triad_is_closed_under_quintuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_triad_is_closed_under_quintuple">sealed</a>.</p>
5975
6082
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>5</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5976
6083
  <pre class="thm-statement"><code>[3, 6, 0].all (fun d =&gt; [3, 6, 0].contains (m9 (5 * d)))</code></pre>
5977
6084
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [3,\,6,\,0],\; \mathrm{m9}\mathopen{}\left(5 \cdot d\right) \in [3,\,6,\,0]</code></pre></details>
@@ -5980,7 +6087,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5980
6087
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
5981
6088
 
5982
6089
  <div class="thm" id="thm-imagined-orbit_is_closed_under_quintuple">
5983
- <p class="thm-label"><strong>Theorem 593</strong> (<code>orbit_is_closed_under_quintuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_orbit_is_closed_under_quintuple">sealed</a>.</p>
6090
+ <p class="thm-label"><strong>Theorem 608</strong> (<code>orbit_is_closed_under_quintuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_orbit_is_closed_under_quintuple">sealed</a>.</p>
5984
6091
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>5</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5985
6092
  <pre class="thm-statement"><code>[1, 2, 4, 8, 7, 5].all (fun d =&gt; [1, 2, 4, 8, 7, 5].contains (m9 (5 * d)))</code></pre>
5986
6093
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,8,\,7,\,5],\; \mathrm{m9}\mathopen{}\left(5 \cdot d\right) \in [1,\,2,\,4,\,8,\,7,\,5]</code></pre></details>
@@ -5989,7 +6096,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5989
6096
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 36 cases. <span class="qed">□</span></p>
5990
6097
 
5991
6098
  <div class="thm" id="thm-imagined-all_is_closed_under_quintuple">
5992
- <p class="thm-label"><strong>Theorem 594</strong> (<code>all_is_closed_under_quintuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_quintuple">sealed</a>.</p>
6099
+ <p class="thm-label"><strong>Theorem 609</strong> (<code>all_is_closed_under_quintuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_quintuple">sealed</a>.</p>
5993
6100
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>5</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
5994
6101
  <pre class="thm-statement"><code>[0,1,2,3,4,5,6,7,8].all (fun d =&gt; [0,1,2,3,4,5,6,7,8].contains (m9 (5 * d)))</code></pre>
5995
6102
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(5 \cdot d\right) \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8]</code></pre></details>
@@ -5998,7 +6105,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
5998
6105
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 81 cases. <span class="qed">□</span></p>
5999
6106
 
6000
6107
  <div class="thm" id="thm-imagined-triad_is_closed_under_sextuple">
6001
- <p class="thm-label"><strong>Theorem 595</strong> (<code>triad_is_closed_under_sextuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_triad_is_closed_under_sextuple">sealed</a>.</p>
6108
+ <p class="thm-label"><strong>Theorem 610</strong> (<code>triad_is_closed_under_sextuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_triad_is_closed_under_sextuple">sealed</a>.</p>
6002
6109
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>6</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow></mrow></mrow></math></div>
6003
6110
  <pre class="thm-statement"><code>[3, 6, 0].all (fun d =&gt; [3, 6, 0].contains (m9 (6 * d)))</code></pre>
6004
6111
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [3,\,6,\,0],\; \mathrm{m9}\mathopen{}\left(6 \cdot d\right) \in [3,\,6,\,0]</code></pre></details>
@@ -6007,7 +6114,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6007
6114
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
6008
6115
 
6009
6116
  <div class="thm" id="thm-imagined-all_is_closed_under_sextuple">
6010
- <p class="thm-label"><strong>Theorem 596</strong> (<code>all_is_closed_under_sextuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_sextuple">sealed</a>.</p>
6117
+ <p class="thm-label"><strong>Theorem 611</strong> (<code>all_is_closed_under_sextuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_sextuple">sealed</a>.</p>
6011
6118
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>6</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
6012
6119
  <pre class="thm-statement"><code>[0,1,2,3,4,5,6,7,8].all (fun d =&gt; [0,1,2,3,4,5,6,7,8].contains (m9 (6 * d)))</code></pre>
6013
6120
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(6 \cdot d\right) \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8]</code></pre></details>
@@ -6016,7 +6123,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6016
6123
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 81 cases. <span class="qed">□</span></p>
6017
6124
 
6018
6125
  <div class="thm" id="thm-imagined-units_is_closed_under_septuple">
6019
- <p class="thm-label"><strong>Theorem 597</strong> (<code>units_is_closed_under_septuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_units_is_closed_under_septuple">sealed</a>.</p>
6126
+ <p class="thm-label"><strong>Theorem 612</strong> (<code>units_is_closed_under_septuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_units_is_closed_under_septuple">sealed</a>.</p>
6020
6127
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>7</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
6021
6128
  <pre class="thm-statement"><code>[1, 2, 4, 5, 7, 8].all (fun d =&gt; [1, 2, 4, 5, 7, 8].contains (m9 (7 * d)))</code></pre>
6022
6129
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,5,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(7 \cdot d\right) \in [1,\,2,\,4,\,5,\,7,\,8]</code></pre></details>
@@ -6025,7 +6132,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6025
6132
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 36 cases. <span class="qed">□</span></p>
6026
6133
 
6027
6134
  <div class="thm" id="thm-imagined-triad_is_closed_under_septuple">
6028
- <p class="thm-label"><strong>Theorem 598</strong> (<code>triad_is_closed_under_septuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_triad_is_closed_under_septuple">sealed</a>.</p>
6135
+ <p class="thm-label"><strong>Theorem 613</strong> (<code>triad_is_closed_under_septuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_triad_is_closed_under_septuple">sealed</a>.</p>
6029
6136
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>7</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow></mrow></mrow></math></div>
6030
6137
  <pre class="thm-statement"><code>[3, 6, 0].all (fun d =&gt; [3, 6, 0].contains (m9 (7 * d)))</code></pre>
6031
6138
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [3,\,6,\,0],\; \mathrm{m9}\mathopen{}\left(7 \cdot d\right) \in [3,\,6,\,0]</code></pre></details>
@@ -6034,7 +6141,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6034
6141
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
6035
6142
 
6036
6143
  <div class="thm" id="thm-imagined-orbit_is_closed_under_septuple">
6037
- <p class="thm-label"><strong>Theorem 599</strong> (<code>orbit_is_closed_under_septuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_orbit_is_closed_under_septuple">sealed</a>.</p>
6144
+ <p class="thm-label"><strong>Theorem 614</strong> (<code>orbit_is_closed_under_septuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_orbit_is_closed_under_septuple">sealed</a>.</p>
6038
6145
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>7</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow></mrow></mrow></math></div>
6039
6146
  <pre class="thm-statement"><code>[1, 2, 4, 8, 7, 5].all (fun d =&gt; [1, 2, 4, 8, 7, 5].contains (m9 (7 * d)))</code></pre>
6040
6147
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,8,\,7,\,5],\; \mathrm{m9}\mathopen{}\left(7 \cdot d\right) \in [1,\,2,\,4,\,8,\,7,\,5]</code></pre></details>
@@ -6043,7 +6150,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6043
6150
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 36 cases. <span class="qed">□</span></p>
6044
6151
 
6045
6152
  <div class="thm" id="thm-imagined-tetA_is_closed_under_septuple">
6046
- <p class="thm-label"><strong>Theorem 600</strong> (<code>tetA_is_closed_under_septuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_tetA_is_closed_under_septuple">sealed</a>.</p>
6153
+ <p class="thm-label"><strong>Theorem 615</strong> (<code>tetA_is_closed_under_septuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_tetA_is_closed_under_septuple">sealed</a>.</p>
6047
6154
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>7</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow></math></div>
6048
6155
  <pre class="thm-statement"><code>[1, 4, 7].all (fun d =&gt; [1, 4, 7].contains (m9 (7 * d)))</code></pre>
6049
6156
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,4,\,7],\; \mathrm{m9}\mathopen{}\left(7 \cdot d\right) \in [1,\,4,\,7]</code></pre></details>
@@ -6052,7 +6159,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6052
6159
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
6053
6160
 
6054
6161
  <div class="thm" id="thm-imagined-tetB_is_closed_under_septuple">
6055
- <p class="thm-label"><strong>Theorem 601</strong> (<code>tetB_is_closed_under_septuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_tetB_is_closed_under_septuple">sealed</a>.</p>
6162
+ <p class="thm-label"><strong>Theorem 616</strong> (<code>tetB_is_closed_under_septuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_tetB_is_closed_under_septuple">sealed</a>.</p>
6056
6163
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>7</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
6057
6164
  <pre class="thm-statement"><code>[2, 5, 8].all (fun d =&gt; [2, 5, 8].contains (m9 (7 * d)))</code></pre>
6058
6165
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [2,\,5,\,8],\; \mathrm{m9}\mathopen{}\left(7 \cdot d\right) \in [2,\,5,\,8]</code></pre></details>
@@ -6061,7 +6168,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6061
6168
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
6062
6169
 
6063
6170
  <div class="thm" id="thm-imagined-all_is_closed_under_septuple">
6064
- <p class="thm-label"><strong>Theorem 602</strong> (<code>all_is_closed_under_septuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_septuple">sealed</a>.</p>
6171
+ <p class="thm-label"><strong>Theorem 617</strong> (<code>all_is_closed_under_septuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_septuple">sealed</a>.</p>
6065
6172
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>7</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
6066
6173
  <pre class="thm-statement"><code>[0,1,2,3,4,5,6,7,8].all (fun d =&gt; [0,1,2,3,4,5,6,7,8].contains (m9 (7 * d)))</code></pre>
6067
6174
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(7 \cdot d\right) \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8]</code></pre></details>
@@ -6070,7 +6177,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6070
6177
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 81 cases. <span class="qed">□</span></p>
6071
6178
 
6072
6179
  <div class="thm" id="thm-imagined-squares_is_closed_under_septuple">
6073
- <p class="thm-label"><strong>Theorem 603</strong> (<code>squares_is_closed_under_septuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_squares_is_closed_under_septuple">sealed</a>.</p>
6180
+ <p class="thm-label"><strong>Theorem 618</strong> (<code>squares_is_closed_under_septuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_squares_is_closed_under_septuple">sealed</a>.</p>
6074
6181
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>7</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow></math></div>
6075
6182
  <pre class="thm-statement"><code>[0, 1, 4, 7].all (fun d =&gt; [0, 1, 4, 7].contains (m9 (7 * d)))</code></pre>
6076
6183
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,4,\,7],\; \mathrm{m9}\mathopen{}\left(7 \cdot d\right) \in [0,\,1,\,4,\,7]</code></pre></details>
@@ -6079,7 +6186,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6079
6186
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 16 cases. <span class="qed">□</span></p>
6080
6187
 
6081
6188
  <div class="thm" id="thm-imagined-units_is_closed_under_octuple">
6082
- <p class="thm-label"><strong>Theorem 604</strong> (<code>units_is_closed_under_octuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_units_is_closed_under_octuple">sealed</a>.</p>
6189
+ <p class="thm-label"><strong>Theorem 619</strong> (<code>units_is_closed_under_octuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_units_is_closed_under_octuple">sealed</a>.</p>
6083
6190
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>8</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
6084
6191
  <pre class="thm-statement"><code>[1, 2, 4, 5, 7, 8].all (fun d =&gt; [1, 2, 4, 5, 7, 8].contains (m9 (8 * d)))</code></pre>
6085
6192
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,5,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(8 \cdot d\right) \in [1,\,2,\,4,\,5,\,7,\,8]</code></pre></details>
@@ -6088,7 +6195,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6088
6195
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 36 cases. <span class="qed">□</span></p>
6089
6196
 
6090
6197
  <div class="thm" id="thm-imagined-triad_is_closed_under_octuple">
6091
- <p class="thm-label"><strong>Theorem 605</strong> (<code>triad_is_closed_under_octuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_triad_is_closed_under_octuple">sealed</a>.</p>
6198
+ <p class="thm-label"><strong>Theorem 620</strong> (<code>triad_is_closed_under_octuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_triad_is_closed_under_octuple">sealed</a>.</p>
6092
6199
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>8</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow></mrow></mrow></math></div>
6093
6200
  <pre class="thm-statement"><code>[3, 6, 0].all (fun d =&gt; [3, 6, 0].contains (m9 (8 * d)))</code></pre>
6094
6201
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [3,\,6,\,0],\; \mathrm{m9}\mathopen{}\left(8 \cdot d\right) \in [3,\,6,\,0]</code></pre></details>
@@ -6097,7 +6204,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6097
6204
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
6098
6205
 
6099
6206
  <div class="thm" id="thm-imagined-orbit_is_closed_under_octuple">
6100
- <p class="thm-label"><strong>Theorem 606</strong> (<code>orbit_is_closed_under_octuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_orbit_is_closed_under_octuple">sealed</a>.</p>
6207
+ <p class="thm-label"><strong>Theorem 621</strong> (<code>orbit_is_closed_under_octuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_orbit_is_closed_under_octuple">sealed</a>.</p>
6101
6208
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>8</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow></mrow></mrow></math></div>
6102
6209
  <pre class="thm-statement"><code>[1, 2, 4, 8, 7, 5].all (fun d =&gt; [1, 2, 4, 8, 7, 5].contains (m9 (8 * d)))</code></pre>
6103
6210
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,8,\,7,\,5],\; \mathrm{m9}\mathopen{}\left(8 \cdot d\right) \in [1,\,2,\,4,\,8,\,7,\,5]</code></pre></details>
@@ -6106,7 +6213,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6106
6213
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 36 cases. <span class="qed">□</span></p>
6107
6214
 
6108
6215
  <div class="thm" id="thm-imagined-all_is_closed_under_octuple">
6109
- <p class="thm-label"><strong>Theorem 607</strong> (<code>all_is_closed_under_octuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_octuple">sealed</a>.</p>
6216
+ <p class="thm-label"><strong>Theorem 622</strong> (<code>all_is_closed_under_octuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_all_is_closed_under_octuple">sealed</a>.</p>
6110
6217
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>8</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
6111
6218
  <pre class="thm-statement"><code>[0,1,2,3,4,5,6,7,8].all (fun d =&gt; [0,1,2,3,4,5,6,7,8].contains (m9 (8 * d)))</code></pre>
6112
6219
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(8 \cdot d\right) \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8]</code></pre></details>
@@ -6115,7 +6222,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6115
6222
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 81 cases. <span class="qed">□</span></p>
6116
6223
 
6117
6224
  <div class="thm" id="thm-imagined-cubes_is_closed_under_octuple">
6118
- <p class="thm-label"><strong>Theorem 608</strong> (<code>cubes_is_closed_under_octuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_cubes_is_closed_under_octuple">sealed</a>.</p>
6225
+ <p class="thm-label"><strong>Theorem 623</strong> (<code>cubes_is_closed_under_octuple</code>)<a class="thm-cite" href="/theorem/lean_imagined_cubes_is_closed_under_octuple">sealed</a>.</p>
6119
6226
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>8</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow></math></div>
6120
6227
  <pre class="thm-statement"><code>[0, 1, 8].all (fun d =&gt; [0, 1, 8].contains (m9 (8 * d)))</code></pre>
6121
6228
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,8],\; \mathrm{m9}\mathopen{}\left(8 \cdot d\right) \in [0,\,1,\,8]</code></pre></details>
@@ -6124,7 +6231,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6124
6231
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
6125
6232
 
6126
6233
  <div class="thm" id="thm-imagined-double_is_involutive_on_triad">
6127
- <p class="thm-label"><strong>Theorem 609</strong> (<code>double_is_involutive_on_triad</code>)<a class="thm-cite" href="/theorem/lean_imagined_double_is_involutive_on_triad">sealed</a>.</p>
6234
+ <p class="thm-label"><strong>Theorem 624</strong> (<code>double_is_involutive_on_triad</code>)<a class="thm-cite" href="/theorem/lean_imagined_double_is_involutive_on_triad">sealed</a>.</p>
6128
6235
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mrow><mi>x</mi><mo>↦</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>2</mn><mo>⋅</mo><mi>x</mi></mrow><mo>)</mo></mrow></mrow><mo>(</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>2</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>)</mo></mrow><mo>=</mo><mi>d</mi></mrow></mrow></math></div>
6129
6236
  <pre class="thm-statement"><code>[3, 6, 0].all (fun d =&gt; (fun x =&gt; m9 (2 * x)) (m9 (2 * d)) == d)</code></pre>
6130
6237
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [3,\,6,\,0],\; x \mapsto \mathrm{m9}\mathopen{}\left(2 \cdot x\right)\mathopen{}\left(\mathrm{m9}\mathopen{}\left(2 \cdot d\right)\right) = d</code></pre></details>
@@ -6133,7 +6240,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6133
6240
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6134
6241
 
6135
6242
  <div class="thm" id="thm-imagined-quadruple_is_involutive_on_triad">
6136
- <p class="thm-label"><strong>Theorem 610</strong> (<code>quadruple_is_involutive_on_triad</code>)<a class="thm-cite" href="/theorem/lean_imagined_quadruple_is_involutive_on_triad">sealed</a>.</p>
6243
+ <p class="thm-label"><strong>Theorem 625</strong> (<code>quadruple_is_involutive_on_triad</code>)<a class="thm-cite" href="/theorem/lean_imagined_quadruple_is_involutive_on_triad">sealed</a>.</p>
6137
6244
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mrow><mi>x</mi><mo>↦</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>4</mn><mo>⋅</mo><mi>x</mi></mrow><mo>)</mo></mrow></mrow><mo>(</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>4</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>)</mo></mrow><mo>=</mo><mi>d</mi></mrow></mrow></math></div>
6138
6245
  <pre class="thm-statement"><code>[3, 6, 0].all (fun d =&gt; (fun x =&gt; m9 (4 * x)) (m9 (4 * d)) == d)</code></pre>
6139
6246
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [3,\,6,\,0],\; x \mapsto \mathrm{m9}\mathopen{}\left(4 \cdot x\right)\mathopen{}\left(\mathrm{m9}\mathopen{}\left(4 \cdot d\right)\right) = d</code></pre></details>
@@ -6142,7 +6249,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6142
6249
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6143
6250
 
6144
6251
  <div class="thm" id="thm-imagined-square_is_involutive_on_tetA">
6145
- <p class="thm-label"><strong>Theorem 611</strong> (<code>square_is_involutive_on_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_square_is_involutive_on_tetA">sealed</a>.</p>
6252
+ <p class="thm-label"><strong>Theorem 626</strong> (<code>square_is_involutive_on_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_square_is_involutive_on_tetA">sealed</a>.</p>
6146
6253
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mrow><mi>x</mi><mo>↦</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mi>x</mi><mo>⋅</mo><mi>x</mi></mrow><mo>)</mo></mrow></mrow><mo>(</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>)</mo></mrow><mo>=</mo><mi>d</mi></mrow></mrow></math></div>
6147
6254
  <pre class="thm-statement"><code>[1, 4, 7].all (fun d =&gt; (fun x =&gt; m9 (x * x)) (m9 (d * d)) == d)</code></pre>
6148
6255
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,4,\,7],\; x \mapsto \mathrm{m9}\mathopen{}\left(x \cdot x\right)\mathopen{}\left(\mathrm{m9}\mathopen{}\left(d \cdot d\right)\right) = d</code></pre></details>
@@ -6151,7 +6258,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6151
6258
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6152
6259
 
6153
6260
  <div class="thm" id="thm-imagined-square_is_involutive_on_squares">
6154
- <p class="thm-label"><strong>Theorem 612</strong> (<code>square_is_involutive_on_squares</code>)<a class="thm-cite" href="/theorem/lean_imagined_square_is_involutive_on_squares">sealed</a>.</p>
6261
+ <p class="thm-label"><strong>Theorem 627</strong> (<code>square_is_involutive_on_squares</code>)<a class="thm-cite" href="/theorem/lean_imagined_square_is_involutive_on_squares">sealed</a>.</p>
6155
6262
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mrow><mi>x</mi><mo>↦</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mi>x</mi><mo>⋅</mo><mi>x</mi></mrow><mo>)</mo></mrow></mrow><mo>(</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>)</mo></mrow><mo>=</mo><mi>d</mi></mrow></mrow></math></div>
6156
6263
  <pre class="thm-statement"><code>[0, 1, 4, 7].all (fun d =&gt; (fun x =&gt; m9 (x * x)) (m9 (d * d)) == d)</code></pre>
6157
6264
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,4,\,7],\; x \mapsto \mathrm{m9}\mathopen{}\left(x \cdot x\right)\mathopen{}\left(\mathrm{m9}\mathopen{}\left(d \cdot d\right)\right) = d</code></pre></details>
@@ -6160,7 +6267,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6160
6267
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 4 cases. <span class="qed">□</span></p>
6161
6268
 
6162
6269
  <div class="thm" id="thm-imagined-cube_is_involutive_on_cubes">
6163
- <p class="thm-label"><strong>Theorem 613</strong> (<code>cube_is_involutive_on_cubes</code>)<a class="thm-cite" href="/theorem/lean_imagined_cube_is_involutive_on_cubes">sealed</a>.</p>
6270
+ <p class="thm-label"><strong>Theorem 628</strong> (<code>cube_is_involutive_on_cubes</code>)<a class="thm-cite" href="/theorem/lean_imagined_cube_is_involutive_on_cubes">sealed</a>.</p>
6164
6271
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mrow><mi>x</mi><mo>↦</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mrow><mi>x</mi><mo>⋅</mo><mi>x</mi></mrow><mo>⋅</mo><mi>x</mi></mrow><mo>)</mo></mrow></mrow><mo>(</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>)</mo></mrow><mo>=</mo><mi>d</mi></mrow></mrow></math></div>
6165
6272
  <pre class="thm-statement"><code>[0, 1, 8].all (fun d =&gt; (fun x =&gt; m9 (x * x * x)) (m9 (d * d * d)) == d)</code></pre>
6166
6273
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,8],\; x \mapsto \mathrm{m9}\mathopen{}\left(x \cdot x \cdot x\right)\mathopen{}\left(\mathrm{m9}\mathopen{}\left(d \cdot d \cdot d\right)\right) = d</code></pre></details>
@@ -6169,7 +6276,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6169
6276
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6170
6277
 
6171
6278
  <div class="thm" id="thm-imagined-fourth_is_involutive_on_tetA">
6172
- <p class="thm-label"><strong>Theorem 614</strong> (<code>fourth_is_involutive_on_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_fourth_is_involutive_on_tetA">sealed</a>.</p>
6279
+ <p class="thm-label"><strong>Theorem 629</strong> (<code>fourth_is_involutive_on_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_fourth_is_involutive_on_tetA">sealed</a>.</p>
6173
6280
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mrow><mi>x</mi><mo>↦</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>x</mi><mn>4</mn></msup><mo>)</mo></mrow></mrow><mo>(</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>4</mn></msup><mo>)</mo></mrow><mo>)</mo></mrow><mo>=</mo><mi>d</mi></mrow></mrow></math></div>
6174
6281
  <pre class="thm-statement"><code>[1, 4, 7].all (fun d =&gt; (fun x =&gt; m9 (x ^ 4)) (m9 (d ^ 4)) == d)</code></pre>
6175
6282
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,4,\,7],\; x \mapsto \mathrm{m9}\mathopen{}\left(x^{4}\right)\mathopen{}\left(\mathrm{m9}\mathopen{}\left(d^{4}\right)\right) = d</code></pre></details>
@@ -6178,7 +6285,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6178
6285
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6179
6286
 
6180
6287
  <div class="thm" id="thm-imagined-fourth_is_involutive_on_squares">
6181
- <p class="thm-label"><strong>Theorem 615</strong> (<code>fourth_is_involutive_on_squares</code>)<a class="thm-cite" href="/theorem/lean_imagined_fourth_is_involutive_on_squares">sealed</a>.</p>
6288
+ <p class="thm-label"><strong>Theorem 630</strong> (<code>fourth_is_involutive_on_squares</code>)<a class="thm-cite" href="/theorem/lean_imagined_fourth_is_involutive_on_squares">sealed</a>.</p>
6182
6289
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mrow><mi>x</mi><mo>↦</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>x</mi><mn>4</mn></msup><mo>)</mo></mrow></mrow><mo>(</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>4</mn></msup><mo>)</mo></mrow><mo>)</mo></mrow><mo>=</mo><mi>d</mi></mrow></mrow></math></div>
6183
6290
  <pre class="thm-statement"><code>[0, 1, 4, 7].all (fun d =&gt; (fun x =&gt; m9 (x ^ 4)) (m9 (d ^ 4)) == d)</code></pre>
6184
6291
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,4,\,7],\; x \mapsto \mathrm{m9}\mathopen{}\left(x^{4}\right)\mathopen{}\left(\mathrm{m9}\mathopen{}\left(d^{4}\right)\right) = d</code></pre></details>
@@ -6187,7 +6294,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6187
6294
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 4 cases. <span class="qed">□</span></p>
6188
6295
 
6189
6296
  <div class="thm" id="thm-imagined-fifth_is_involutive_on_units">
6190
- <p class="thm-label"><strong>Theorem 616</strong> (<code>fifth_is_involutive_on_units</code>)<a class="thm-cite" href="/theorem/lean_imagined_fifth_is_involutive_on_units">sealed</a>.</p>
6297
+ <p class="thm-label"><strong>Theorem 631</strong> (<code>fifth_is_involutive_on_units</code>)<a class="thm-cite" href="/theorem/lean_imagined_fifth_is_involutive_on_units">sealed</a>.</p>
6191
6298
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mrow><mi>x</mi><mo>↦</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>x</mi><mn>5</mn></msup><mo>)</mo></mrow></mrow><mo>(</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>5</mn></msup><mo>)</mo></mrow><mo>)</mo></mrow><mo>=</mo><mi>d</mi></mrow></mrow></math></div>
6192
6299
  <pre class="thm-statement"><code>[1, 2, 4, 5, 7, 8].all (fun d =&gt; (fun x =&gt; m9 (x ^ 5)) (m9 (d ^ 5)) == d)</code></pre>
6193
6300
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,5,\,7,\,8],\; x \mapsto \mathrm{m9}\mathopen{}\left(x^{5}\right)\mathopen{}\left(\mathrm{m9}\mathopen{}\left(d^{5}\right)\right) = d</code></pre></details>
@@ -6196,7 +6303,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6196
6303
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 6 cases. <span class="qed">□</span></p>
6197
6304
 
6198
6305
  <div class="thm" id="thm-imagined-fifth_is_involutive_on_orbit">
6199
- <p class="thm-label"><strong>Theorem 617</strong> (<code>fifth_is_involutive_on_orbit</code>)<a class="thm-cite" href="/theorem/lean_imagined_fifth_is_involutive_on_orbit">sealed</a>.</p>
6306
+ <p class="thm-label"><strong>Theorem 632</strong> (<code>fifth_is_involutive_on_orbit</code>)<a class="thm-cite" href="/theorem/lean_imagined_fifth_is_involutive_on_orbit">sealed</a>.</p>
6200
6307
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mrow><mi>x</mi><mo>↦</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>x</mi><mn>5</mn></msup><mo>)</mo></mrow></mrow><mo>(</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>5</mn></msup><mo>)</mo></mrow><mo>)</mo></mrow><mo>=</mo><mi>d</mi></mrow></mrow></math></div>
6201
6308
  <pre class="thm-statement"><code>[1, 2, 4, 8, 7, 5].all (fun d =&gt; (fun x =&gt; m9 (x ^ 5)) (m9 (d ^ 5)) == d)</code></pre>
6202
6309
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,8,\,7,\,5],\; x \mapsto \mathrm{m9}\mathopen{}\left(x^{5}\right)\mathopen{}\left(\mathrm{m9}\mathopen{}\left(d^{5}\right)\right) = d</code></pre></details>
@@ -6205,7 +6312,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6205
6312
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 6 cases. <span class="qed">□</span></p>
6206
6313
 
6207
6314
  <div class="thm" id="thm-imagined-fifth_is_involutive_on_tetA">
6208
- <p class="thm-label"><strong>Theorem 618</strong> (<code>fifth_is_involutive_on_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_fifth_is_involutive_on_tetA">sealed</a>.</p>
6315
+ <p class="thm-label"><strong>Theorem 633</strong> (<code>fifth_is_involutive_on_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_fifth_is_involutive_on_tetA">sealed</a>.</p>
6209
6316
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mrow><mi>x</mi><mo>↦</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>x</mi><mn>5</mn></msup><mo>)</mo></mrow></mrow><mo>(</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>5</mn></msup><mo>)</mo></mrow><mo>)</mo></mrow><mo>=</mo><mi>d</mi></mrow></mrow></math></div>
6210
6317
  <pre class="thm-statement"><code>[1, 4, 7].all (fun d =&gt; (fun x =&gt; m9 (x ^ 5)) (m9 (d ^ 5)) == d)</code></pre>
6211
6318
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,4,\,7],\; x \mapsto \mathrm{m9}\mathopen{}\left(x^{5}\right)\mathopen{}\left(\mathrm{m9}\mathopen{}\left(d^{5}\right)\right) = d</code></pre></details>
@@ -6214,7 +6321,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6214
6321
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6215
6322
 
6216
6323
  <div class="thm" id="thm-imagined-fifth_is_involutive_on_tetB">
6217
- <p class="thm-label"><strong>Theorem 619</strong> (<code>fifth_is_involutive_on_tetB</code>)<a class="thm-cite" href="/theorem/lean_imagined_fifth_is_involutive_on_tetB">sealed</a>.</p>
6324
+ <p class="thm-label"><strong>Theorem 634</strong> (<code>fifth_is_involutive_on_tetB</code>)<a class="thm-cite" href="/theorem/lean_imagined_fifth_is_involutive_on_tetB">sealed</a>.</p>
6218
6325
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mrow><mi>x</mi><mo>↦</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>x</mi><mn>5</mn></msup><mo>)</mo></mrow></mrow><mo>(</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>5</mn></msup><mo>)</mo></mrow><mo>)</mo></mrow><mo>=</mo><mi>d</mi></mrow></mrow></math></div>
6219
6326
  <pre class="thm-statement"><code>[2, 5, 8].all (fun d =&gt; (fun x =&gt; m9 (x ^ 5)) (m9 (d ^ 5)) == d)</code></pre>
6220
6327
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [2,\,5,\,8],\; x \mapsto \mathrm{m9}\mathopen{}\left(x^{5}\right)\mathopen{}\left(\mathrm{m9}\mathopen{}\left(d^{5}\right)\right) = d</code></pre></details>
@@ -6223,7 +6330,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6223
6330
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6224
6331
 
6225
6332
  <div class="thm" id="thm-imagined-fifth_is_involutive_on_squares">
6226
- <p class="thm-label"><strong>Theorem 620</strong> (<code>fifth_is_involutive_on_squares</code>)<a class="thm-cite" href="/theorem/lean_imagined_fifth_is_involutive_on_squares">sealed</a>.</p>
6333
+ <p class="thm-label"><strong>Theorem 635</strong> (<code>fifth_is_involutive_on_squares</code>)<a class="thm-cite" href="/theorem/lean_imagined_fifth_is_involutive_on_squares">sealed</a>.</p>
6227
6334
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mrow><mi>x</mi><mo>↦</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>x</mi><mn>5</mn></msup><mo>)</mo></mrow></mrow><mo>(</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>5</mn></msup><mo>)</mo></mrow><mo>)</mo></mrow><mo>=</mo><mi>d</mi></mrow></mrow></math></div>
6228
6335
  <pre class="thm-statement"><code>[0, 1, 4, 7].all (fun d =&gt; (fun x =&gt; m9 (x ^ 5)) (m9 (d ^ 5)) == d)</code></pre>
6229
6336
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,4,\,7],\; x \mapsto \mathrm{m9}\mathopen{}\left(x^{5}\right)\mathopen{}\left(\mathrm{m9}\mathopen{}\left(d^{5}\right)\right) = d</code></pre></details>
@@ -6232,7 +6339,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6232
6339
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 4 cases. <span class="qed">□</span></p>
6233
6340
 
6234
6341
  <div class="thm" id="thm-imagined-fifth_is_involutive_on_cubes">
6235
- <p class="thm-label"><strong>Theorem 621</strong> (<code>fifth_is_involutive_on_cubes</code>)<a class="thm-cite" href="/theorem/lean_imagined_fifth_is_involutive_on_cubes">sealed</a>.</p>
6342
+ <p class="thm-label"><strong>Theorem 636</strong> (<code>fifth_is_involutive_on_cubes</code>)<a class="thm-cite" href="/theorem/lean_imagined_fifth_is_involutive_on_cubes">sealed</a>.</p>
6236
6343
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mrow><mi>x</mi><mo>↦</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>x</mi><mn>5</mn></msup><mo>)</mo></mrow></mrow><mo>(</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>5</mn></msup><mo>)</mo></mrow><mo>)</mo></mrow><mo>=</mo><mi>d</mi></mrow></mrow></math></div>
6237
6344
  <pre class="thm-statement"><code>[0, 1, 8].all (fun d =&gt; (fun x =&gt; m9 (x ^ 5)) (m9 (d ^ 5)) == d)</code></pre>
6238
6345
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,8],\; x \mapsto \mathrm{m9}\mathopen{}\left(x^{5}\right)\mathopen{}\left(\mathrm{m9}\mathopen{}\left(d^{5}\right)\right) = d</code></pre></details>
@@ -6241,7 +6348,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6241
6348
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6242
6349
 
6243
6350
  <div class="thm" id="thm-imagined-quintuple_is_involutive_on_triad">
6244
- <p class="thm-label"><strong>Theorem 622</strong> (<code>quintuple_is_involutive_on_triad</code>)<a class="thm-cite" href="/theorem/lean_imagined_quintuple_is_involutive_on_triad">sealed</a>.</p>
6351
+ <p class="thm-label"><strong>Theorem 637</strong> (<code>quintuple_is_involutive_on_triad</code>)<a class="thm-cite" href="/theorem/lean_imagined_quintuple_is_involutive_on_triad">sealed</a>.</p>
6245
6352
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mrow><mi>x</mi><mo>↦</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>5</mn><mo>⋅</mo><mi>x</mi></mrow><mo>)</mo></mrow></mrow><mo>(</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>5</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>)</mo></mrow><mo>=</mo><mi>d</mi></mrow></mrow></math></div>
6246
6353
  <pre class="thm-statement"><code>[3, 6, 0].all (fun d =&gt; (fun x =&gt; m9 (5 * x)) (m9 (5 * d)) == d)</code></pre>
6247
6354
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [3,\,6,\,0],\; x \mapsto \mathrm{m9}\mathopen{}\left(5 \cdot x\right)\mathopen{}\left(\mathrm{m9}\mathopen{}\left(5 \cdot d\right)\right) = d</code></pre></details>
@@ -6250,7 +6357,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6250
6357
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6251
6358
 
6252
6359
  <div class="thm" id="thm-imagined-septuple_is_involutive_on_triad">
6253
- <p class="thm-label"><strong>Theorem 623</strong> (<code>septuple_is_involutive_on_triad</code>)<a class="thm-cite" href="/theorem/lean_imagined_septuple_is_involutive_on_triad">sealed</a>.</p>
6360
+ <p class="thm-label"><strong>Theorem 638</strong> (<code>septuple_is_involutive_on_triad</code>)<a class="thm-cite" href="/theorem/lean_imagined_septuple_is_involutive_on_triad">sealed</a>.</p>
6254
6361
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mrow><mi>x</mi><mo>↦</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>7</mn><mo>⋅</mo><mi>x</mi></mrow><mo>)</mo></mrow></mrow><mo>(</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>7</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>)</mo></mrow><mo>=</mo><mi>d</mi></mrow></mrow></math></div>
6255
6362
  <pre class="thm-statement"><code>[3, 6, 0].all (fun d =&gt; (fun x =&gt; m9 (7 * x)) (m9 (7 * d)) == d)</code></pre>
6256
6363
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [3,\,6,\,0],\; x \mapsto \mathrm{m9}\mathopen{}\left(7 \cdot x\right)\mathopen{}\left(\mathrm{m9}\mathopen{}\left(7 \cdot d\right)\right) = d</code></pre></details>
@@ -6259,7 +6366,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6259
6366
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6260
6367
 
6261
6368
  <div class="thm" id="thm-imagined-double_carries_units_onto_orbit">
6262
- <p class="thm-label"><strong>Theorem 624</strong> (<code>double_carries_units_onto_orbit</code>)<a class="thm-cite" href="/theorem/lean_imagined_double_carries_units_onto_orbit">sealed</a>.</p>
6369
+ <p class="thm-label"><strong>Theorem 639</strong> (<code>double_carries_units_onto_orbit</code>)<a class="thm-cite" href="/theorem/lean_imagined_double_carries_units_onto_orbit">sealed</a>.</p>
6263
6370
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>2</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>2</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>6</mn></mrow></mrow></math></div>
6264
6371
  <pre class="thm-statement"><code>[1, 2, 4, 5, 7, 8].all (fun d =&gt; [1, 2, 4, 8, 7, 5].contains (m9 (2 * d))) ∧ ([1, 2, 4, 5, 7, 8].map (fun d =&gt; m9 (2 * d))).eraseDups.length = 6</code></pre>
6265
6372
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,5,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(2 \cdot d\right) \in [1,\,2,\,4,\,8,\,7,\,5] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(2 \cdot d\right) \mid d \in [1,\,2,\,4,\,5,\,7,\,8] \,\}\right)\right| = 6</code></pre></details>
@@ -6268,7 +6375,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6268
6375
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 216 cases. <span class="qed">□</span></p>
6269
6376
 
6270
6377
  <div class="thm" id="thm-imagined-double_carries_orbit_onto_units">
6271
- <p class="thm-label"><strong>Theorem 625</strong> (<code>double_carries_orbit_onto_units</code>)<a class="thm-cite" href="/theorem/lean_imagined_double_carries_orbit_onto_units">sealed</a>.</p>
6378
+ <p class="thm-label"><strong>Theorem 640</strong> (<code>double_carries_orbit_onto_units</code>)<a class="thm-cite" href="/theorem/lean_imagined_double_carries_orbit_onto_units">sealed</a>.</p>
6272
6379
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>2</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>2</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>6</mn></mrow></mrow></math></div>
6273
6380
  <pre class="thm-statement"><code>[1, 2, 4, 8, 7, 5].all (fun d =&gt; [1, 2, 4, 5, 7, 8].contains (m9 (2 * d))) ∧ ([1, 2, 4, 8, 7, 5].map (fun d =&gt; m9 (2 * d))).eraseDups.length = 6</code></pre>
6274
6381
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,8,\,7,\,5],\; \mathrm{m9}\mathopen{}\left(2 \cdot d\right) \in [1,\,2,\,4,\,5,\,7,\,8] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(2 \cdot d\right) \mid d \in [1,\,2,\,4,\,8,\,7,\,5] \,\}\right)\right| = 6</code></pre></details>
@@ -6277,7 +6384,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6277
6384
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 216 cases. <span class="qed">□</span></p>
6278
6385
 
6279
6386
  <div class="thm" id="thm-imagined-triple_carries_all_onto_triad">
6280
- <p class="thm-label"><strong>Theorem 626</strong> (<code>triple_carries_all_onto_triad</code>)<a class="thm-cite" href="/theorem/lean_imagined_triple_carries_all_onto_triad">sealed</a>.</p>
6387
+ <p class="thm-label"><strong>Theorem 641</strong> (<code>triple_carries_all_onto_triad</code>)<a class="thm-cite" href="/theorem/lean_imagined_triple_carries_all_onto_triad">sealed</a>.</p>
6281
6388
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>3</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>3</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>3</mn></mrow></mrow></math></div>
6282
6389
  <pre class="thm-statement"><code>[0,1,2,3,4,5,6,7,8].all (fun d =&gt; [3, 6, 0].contains (m9 (3 * d))) ∧ ([0,1,2,3,4,5,6,7,8].map (fun d =&gt; m9 (3 * d))).eraseDups.length = 3</code></pre>
6283
6390
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(3 \cdot d\right) \in [3,\,6,\,0] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(3 \cdot d\right) \mid d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8] \,\}\right)\right| = 3</code></pre></details>
@@ -6286,7 +6393,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6286
6393
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 243 cases. <span class="qed">□</span></p>
6287
6394
 
6288
6395
  <div class="thm" id="thm-imagined-triple_carries_cubes_onto_triad">
6289
- <p class="thm-label"><strong>Theorem 627</strong> (<code>triple_carries_cubes_onto_triad</code>)<a class="thm-cite" href="/theorem/lean_imagined_triple_carries_cubes_onto_triad">sealed</a>.</p>
6396
+ <p class="thm-label"><strong>Theorem 642</strong> (<code>triple_carries_cubes_onto_triad</code>)<a class="thm-cite" href="/theorem/lean_imagined_triple_carries_cubes_onto_triad">sealed</a>.</p>
6290
6397
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>3</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>3</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>3</mn></mrow></mrow></math></div>
6291
6398
  <pre class="thm-statement"><code>[0, 1, 8].all (fun d =&gt; [3, 6, 0].contains (m9 (3 * d))) ∧ ([0, 1, 8].map (fun d =&gt; m9 (3 * d))).eraseDups.length = 3</code></pre>
6292
6399
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,8],\; \mathrm{m9}\mathopen{}\left(3 \cdot d\right) \in [3,\,6,\,0] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(3 \cdot d\right) \mid d \in [0,\,1,\,8] \,\}\right)\right| = 3</code></pre></details>
@@ -6295,7 +6402,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6295
6402
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 27 cases. <span class="qed">□</span></p>
6296
6403
 
6297
6404
  <div class="thm" id="thm-imagined-quadruple_carries_units_onto_orbit">
6298
- <p class="thm-label"><strong>Theorem 628</strong> (<code>quadruple_carries_units_onto_orbit</code>)<a class="thm-cite" href="/theorem/lean_imagined_quadruple_carries_units_onto_orbit">sealed</a>.</p>
6405
+ <p class="thm-label"><strong>Theorem 643</strong> (<code>quadruple_carries_units_onto_orbit</code>)<a class="thm-cite" href="/theorem/lean_imagined_quadruple_carries_units_onto_orbit">sealed</a>.</p>
6299
6406
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>4</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>4</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>6</mn></mrow></mrow></math></div>
6300
6407
  <pre class="thm-statement"><code>[1, 2, 4, 5, 7, 8].all (fun d =&gt; [1, 2, 4, 8, 7, 5].contains (m9 (4 * d))) ∧ ([1, 2, 4, 5, 7, 8].map (fun d =&gt; m9 (4 * d))).eraseDups.length = 6</code></pre>
6301
6408
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,5,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(4 \cdot d\right) \in [1,\,2,\,4,\,8,\,7,\,5] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(4 \cdot d\right) \mid d \in [1,\,2,\,4,\,5,\,7,\,8] \,\}\right)\right| = 6</code></pre></details>
@@ -6304,7 +6411,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6304
6411
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 216 cases. <span class="qed">□</span></p>
6305
6412
 
6306
6413
  <div class="thm" id="thm-imagined-quadruple_carries_orbit_onto_units">
6307
- <p class="thm-label"><strong>Theorem 629</strong> (<code>quadruple_carries_orbit_onto_units</code>)<a class="thm-cite" href="/theorem/lean_imagined_quadruple_carries_orbit_onto_units">sealed</a>.</p>
6414
+ <p class="thm-label"><strong>Theorem 644</strong> (<code>quadruple_carries_orbit_onto_units</code>)<a class="thm-cite" href="/theorem/lean_imagined_quadruple_carries_orbit_onto_units">sealed</a>.</p>
6308
6415
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>4</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>4</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>6</mn></mrow></mrow></math></div>
6309
6416
  <pre class="thm-statement"><code>[1, 2, 4, 8, 7, 5].all (fun d =&gt; [1, 2, 4, 5, 7, 8].contains (m9 (4 * d))) ∧ ([1, 2, 4, 8, 7, 5].map (fun d =&gt; m9 (4 * d))).eraseDups.length = 6</code></pre>
6310
6417
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,8,\,7,\,5],\; \mathrm{m9}\mathopen{}\left(4 \cdot d\right) \in [1,\,2,\,4,\,5,\,7,\,8] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(4 \cdot d\right) \mid d \in [1,\,2,\,4,\,8,\,7,\,5] \,\}\right)\right| = 6</code></pre></details>
@@ -6313,7 +6420,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6313
6420
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 216 cases. <span class="qed">□</span></p>
6314
6421
 
6315
6422
  <div class="thm" id="thm-imagined-negate_carries_orbit_onto_units">
6316
- <p class="thm-label"><strong>Theorem 630</strong> (<code>negate_carries_orbit_onto_units</code>)<a class="thm-cite" href="/theorem/lean_imagined_negate_carries_orbit_onto_units">sealed</a>.</p>
6423
+ <p class="thm-label"><strong>Theorem 645</strong> (<code>negate_carries_orbit_onto_units</code>)<a class="thm-cite" href="/theorem/lean_imagined_negate_carries_orbit_onto_units">sealed</a>.</p>
6317
6424
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>9</mn><mo>-</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>9</mn><mo>-</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>6</mn></mrow></mrow></math></div>
6318
6425
  <pre class="thm-statement"><code>[1, 2, 4, 8, 7, 5].all (fun d =&gt; [1, 2, 4, 5, 7, 8].contains (m9 (9 - d))) ∧ ([1, 2, 4, 8, 7, 5].map (fun d =&gt; m9 (9 - d))).eraseDups.length = 6</code></pre>
6319
6426
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,8,\,7,\,5],\; \mathrm{m9}\mathopen{}\left(9 - d\right) \in [1,\,2,\,4,\,5,\,7,\,8] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(9 - d\right) \mid d \in [1,\,2,\,4,\,8,\,7,\,5] \,\}\right)\right| = 6</code></pre></details>
@@ -6322,7 +6429,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6322
6429
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 216 cases. <span class="qed">□</span></p>
6323
6430
 
6324
6431
  <div class="thm" id="thm-imagined-negate_carries_tetA_onto_tetB">
6325
- <p class="thm-label"><strong>Theorem 631</strong> (<code>negate_carries_tetA_onto_tetB</code>)<a class="thm-cite" href="/theorem/lean_imagined_negate_carries_tetA_onto_tetB">sealed</a>.</p>
6432
+ <p class="thm-label"><strong>Theorem 646</strong> (<code>negate_carries_tetA_onto_tetB</code>)<a class="thm-cite" href="/theorem/lean_imagined_negate_carries_tetA_onto_tetB">sealed</a>.</p>
6326
6433
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>9</mn><mo>-</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>9</mn><mo>-</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>3</mn></mrow></mrow></math></div>
6327
6434
  <pre class="thm-statement"><code>[1, 4, 7].all (fun d =&gt; [2, 5, 8].contains (m9 (9 - d))) ∧ ([1, 4, 7].map (fun d =&gt; m9 (9 - d))).eraseDups.length = 3</code></pre>
6328
6435
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,4,\,7],\; \mathrm{m9}\mathopen{}\left(9 - d\right) \in [2,\,5,\,8] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(9 - d\right) \mid d \in [1,\,4,\,7] \,\}\right)\right| = 3</code></pre></details>
@@ -6331,7 +6438,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6331
6438
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 27 cases. <span class="qed">□</span></p>
6332
6439
 
6333
6440
  <div class="thm" id="thm-imagined-negate_carries_tetB_onto_tetA">
6334
- <p class="thm-label"><strong>Theorem 632</strong> (<code>negate_carries_tetB_onto_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_negate_carries_tetB_onto_tetA">sealed</a>.</p>
6441
+ <p class="thm-label"><strong>Theorem 647</strong> (<code>negate_carries_tetB_onto_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_negate_carries_tetB_onto_tetA">sealed</a>.</p>
6335
6442
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>9</mn><mo>-</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>9</mn><mo>-</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>3</mn></mrow></mrow></math></div>
6336
6443
  <pre class="thm-statement"><code>[2, 5, 8].all (fun d =&gt; [1, 4, 7].contains (m9 (9 - d))) ∧ ([2, 5, 8].map (fun d =&gt; m9 (9 - d))).eraseDups.length = 3</code></pre>
6337
6444
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [2,\,5,\,8],\; \mathrm{m9}\mathopen{}\left(9 - d\right) \in [1,\,4,\,7] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(9 - d\right) \mid d \in [2,\,5,\,8] \,\}\right)\right| = 3</code></pre></details>
@@ -6340,7 +6447,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6340
6447
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 27 cases. <span class="qed">□</span></p>
6341
6448
 
6342
6449
  <div class="thm" id="thm-imagined-square_carries_units_onto_tetA">
6343
- <p class="thm-label"><strong>Theorem 633</strong> (<code>square_carries_units_onto_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_square_carries_units_onto_tetA">sealed</a>.</p>
6450
+ <p class="thm-label"><strong>Theorem 648</strong> (<code>square_carries_units_onto_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_square_carries_units_onto_tetA">sealed</a>.</p>
6344
6451
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>3</mn></mrow></mrow></math></div>
6345
6452
  <pre class="thm-statement"><code>[1, 2, 4, 5, 7, 8].all (fun d =&gt; [1, 4, 7].contains (m9 (d * d))) ∧ ([1, 2, 4, 5, 7, 8].map (fun d =&gt; m9 (d * d))).eraseDups.length = 3</code></pre>
6346
6453
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,5,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(d \cdot d\right) \in [1,\,4,\,7] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d \cdot d\right) \mid d \in [1,\,2,\,4,\,5,\,7,\,8] \,\}\right)\right| = 3</code></pre></details>
@@ -6349,7 +6456,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6349
6456
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 108 cases. <span class="qed">□</span></p>
6350
6457
 
6351
6458
  <div class="thm" id="thm-imagined-square_carries_orbit_onto_tetA">
6352
- <p class="thm-label"><strong>Theorem 634</strong> (<code>square_carries_orbit_onto_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_square_carries_orbit_onto_tetA">sealed</a>.</p>
6459
+ <p class="thm-label"><strong>Theorem 649</strong> (<code>square_carries_orbit_onto_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_square_carries_orbit_onto_tetA">sealed</a>.</p>
6353
6460
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>3</mn></mrow></mrow></math></div>
6354
6461
  <pre class="thm-statement"><code>[1, 2, 4, 8, 7, 5].all (fun d =&gt; [1, 4, 7].contains (m9 (d * d))) ∧ ([1, 2, 4, 8, 7, 5].map (fun d =&gt; m9 (d * d))).eraseDups.length = 3</code></pre>
6355
6462
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,8,\,7,\,5],\; \mathrm{m9}\mathopen{}\left(d \cdot d\right) \in [1,\,4,\,7] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d \cdot d\right) \mid d \in [1,\,2,\,4,\,8,\,7,\,5] \,\}\right)\right| = 3</code></pre></details>
@@ -6358,7 +6465,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6358
6465
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 108 cases. <span class="qed">□</span></p>
6359
6466
 
6360
6467
  <div class="thm" id="thm-imagined-square_carries_tetB_onto_tetA">
6361
- <p class="thm-label"><strong>Theorem 635</strong> (<code>square_carries_tetB_onto_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_square_carries_tetB_onto_tetA">sealed</a>.</p>
6468
+ <p class="thm-label"><strong>Theorem 650</strong> (<code>square_carries_tetB_onto_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_square_carries_tetB_onto_tetA">sealed</a>.</p>
6362
6469
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>3</mn></mrow></mrow></math></div>
6363
6470
  <pre class="thm-statement"><code>[2, 5, 8].all (fun d =&gt; [1, 4, 7].contains (m9 (d * d))) ∧ ([2, 5, 8].map (fun d =&gt; m9 (d * d))).eraseDups.length = 3</code></pre>
6364
6471
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [2,\,5,\,8],\; \mathrm{m9}\mathopen{}\left(d \cdot d\right) \in [1,\,4,\,7] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d \cdot d\right) \mid d \in [2,\,5,\,8] \,\}\right)\right| = 3</code></pre></details>
@@ -6367,7 +6474,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6367
6474
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 27 cases. <span class="qed">□</span></p>
6368
6475
 
6369
6476
  <div class="thm" id="thm-imagined-square_carries_all_onto_squares">
6370
- <p class="thm-label"><strong>Theorem 636</strong> (<code>square_carries_all_onto_squares</code>)<a class="thm-cite" href="/theorem/lean_imagined_square_carries_all_onto_squares">sealed</a>.</p>
6477
+ <p class="thm-label"><strong>Theorem 651</strong> (<code>square_carries_all_onto_squares</code>)<a class="thm-cite" href="/theorem/lean_imagined_square_carries_all_onto_squares">sealed</a>.</p>
6371
6478
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>4</mn></mrow></mrow></math></div>
6372
6479
  <pre class="thm-statement"><code>[0,1,2,3,4,5,6,7,8].all (fun d =&gt; [0, 1, 4, 7].contains (m9 (d * d))) ∧ ([0,1,2,3,4,5,6,7,8].map (fun d =&gt; m9 (d * d))).eraseDups.length = 4</code></pre>
6373
6480
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(d \cdot d\right) \in [0,\,1,\,4,\,7] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d \cdot d\right) \mid d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8] \,\}\right)\right| = 4</code></pre></details>
@@ -6376,7 +6483,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6376
6483
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 324 cases. <span class="qed">□</span></p>
6377
6484
 
6378
6485
  <div class="thm" id="thm-imagined-cube_carries_all_onto_cubes">
6379
- <p class="thm-label"><strong>Theorem 637</strong> (<code>cube_carries_all_onto_cubes</code>)<a class="thm-cite" href="/theorem/lean_imagined_cube_carries_all_onto_cubes">sealed</a>.</p>
6486
+ <p class="thm-label"><strong>Theorem 652</strong> (<code>cube_carries_all_onto_cubes</code>)<a class="thm-cite" href="/theorem/lean_imagined_cube_carries_all_onto_cubes">sealed</a>.</p>
6380
6487
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>3</mn></mrow></mrow></math></div>
6381
6488
  <pre class="thm-statement"><code>[0,1,2,3,4,5,6,7,8].all (fun d =&gt; [0, 1, 8].contains (m9 (d * d * d))) ∧ ([0,1,2,3,4,5,6,7,8].map (fun d =&gt; m9 (d * d * d))).eraseDups.length = 3</code></pre>
6382
6489
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(d \cdot d \cdot d\right) \in [0,\,1,\,8] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d \cdot d \cdot d\right) \mid d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8] \,\}\right)\right| = 3</code></pre></details>
@@ -6385,7 +6492,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6385
6492
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 243 cases. <span class="qed">□</span></p>
6386
6493
 
6387
6494
  <div class="thm" id="thm-imagined-fourth_carries_units_onto_tetA">
6388
- <p class="thm-label"><strong>Theorem 638</strong> (<code>fourth_carries_units_onto_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_fourth_carries_units_onto_tetA">sealed</a>.</p>
6495
+ <p class="thm-label"><strong>Theorem 653</strong> (<code>fourth_carries_units_onto_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_fourth_carries_units_onto_tetA">sealed</a>.</p>
6389
6496
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>4</mn></msup><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>4</mn></msup><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>3</mn></mrow></mrow></math></div>
6390
6497
  <pre class="thm-statement"><code>[1, 2, 4, 5, 7, 8].all (fun d =&gt; [1, 4, 7].contains (m9 (d ^ 4))) ∧ ([1, 2, 4, 5, 7, 8].map (fun d =&gt; m9 (d ^ 4))).eraseDups.length = 3</code></pre>
6391
6498
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,5,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(d^{4}\right) \in [1,\,4,\,7] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d^{4}\right) \mid d \in [1,\,2,\,4,\,5,\,7,\,8] \,\}\right)\right| = 3</code></pre></details>
@@ -6394,7 +6501,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6394
6501
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 108 cases. <span class="qed">□</span></p>
6395
6502
 
6396
6503
  <div class="thm" id="thm-imagined-fourth_carries_orbit_onto_tetA">
6397
- <p class="thm-label"><strong>Theorem 639</strong> (<code>fourth_carries_orbit_onto_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_fourth_carries_orbit_onto_tetA">sealed</a>.</p>
6504
+ <p class="thm-label"><strong>Theorem 654</strong> (<code>fourth_carries_orbit_onto_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_fourth_carries_orbit_onto_tetA">sealed</a>.</p>
6398
6505
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>4</mn></msup><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>4</mn></msup><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>3</mn></mrow></mrow></math></div>
6399
6506
  <pre class="thm-statement"><code>[1, 2, 4, 8, 7, 5].all (fun d =&gt; [1, 4, 7].contains (m9 (d ^ 4))) ∧ ([1, 2, 4, 8, 7, 5].map (fun d =&gt; m9 (d ^ 4))).eraseDups.length = 3</code></pre>
6400
6507
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,8,\,7,\,5],\; \mathrm{m9}\mathopen{}\left(d^{4}\right) \in [1,\,4,\,7] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d^{4}\right) \mid d \in [1,\,2,\,4,\,8,\,7,\,5] \,\}\right)\right| = 3</code></pre></details>
@@ -6403,7 +6510,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6403
6510
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 108 cases. <span class="qed">□</span></p>
6404
6511
 
6405
6512
  <div class="thm" id="thm-imagined-fourth_carries_tetB_onto_tetA">
6406
- <p class="thm-label"><strong>Theorem 640</strong> (<code>fourth_carries_tetB_onto_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_fourth_carries_tetB_onto_tetA">sealed</a>.</p>
6513
+ <p class="thm-label"><strong>Theorem 655</strong> (<code>fourth_carries_tetB_onto_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_fourth_carries_tetB_onto_tetA">sealed</a>.</p>
6407
6514
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>4</mn></msup><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>4</mn></msup><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>3</mn></mrow></mrow></math></div>
6408
6515
  <pre class="thm-statement"><code>[2, 5, 8].all (fun d =&gt; [1, 4, 7].contains (m9 (d ^ 4))) ∧ ([2, 5, 8].map (fun d =&gt; m9 (d ^ 4))).eraseDups.length = 3</code></pre>
6409
6516
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [2,\,5,\,8],\; \mathrm{m9}\mathopen{}\left(d^{4}\right) \in [1,\,4,\,7] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d^{4}\right) \mid d \in [2,\,5,\,8] \,\}\right)\right| = 3</code></pre></details>
@@ -6412,7 +6519,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6412
6519
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 27 cases. <span class="qed">□</span></p>
6413
6520
 
6414
6521
  <div class="thm" id="thm-imagined-fourth_carries_all_onto_squares">
6415
- <p class="thm-label"><strong>Theorem 641</strong> (<code>fourth_carries_all_onto_squares</code>)<a class="thm-cite" href="/theorem/lean_imagined_fourth_carries_all_onto_squares">sealed</a>.</p>
6522
+ <p class="thm-label"><strong>Theorem 656</strong> (<code>fourth_carries_all_onto_squares</code>)<a class="thm-cite" href="/theorem/lean_imagined_fourth_carries_all_onto_squares">sealed</a>.</p>
6416
6523
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>4</mn></msup><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>4</mn></msup><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>4</mn></mrow></mrow></math></div>
6417
6524
  <pre class="thm-statement"><code>[0,1,2,3,4,5,6,7,8].all (fun d =&gt; [0, 1, 4, 7].contains (m9 (d ^ 4))) ∧ ([0,1,2,3,4,5,6,7,8].map (fun d =&gt; m9 (d ^ 4))).eraseDups.length = 4</code></pre>
6418
6525
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(d^{4}\right) \in [0,\,1,\,4,\,7] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d^{4}\right) \mid d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8] \,\}\right)\right| = 4</code></pre></details>
@@ -6421,7 +6528,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6421
6528
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 324 cases. <span class="qed">□</span></p>
6422
6529
 
6423
6530
  <div class="thm" id="thm-imagined-fifth_carries_units_onto_orbit">
6424
- <p class="thm-label"><strong>Theorem 642</strong> (<code>fifth_carries_units_onto_orbit</code>)<a class="thm-cite" href="/theorem/lean_imagined_fifth_carries_units_onto_orbit">sealed</a>.</p>
6531
+ <p class="thm-label"><strong>Theorem 657</strong> (<code>fifth_carries_units_onto_orbit</code>)<a class="thm-cite" href="/theorem/lean_imagined_fifth_carries_units_onto_orbit">sealed</a>.</p>
6425
6532
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>5</mn></msup><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>5</mn></msup><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>6</mn></mrow></mrow></math></div>
6426
6533
  <pre class="thm-statement"><code>[1, 2, 4, 5, 7, 8].all (fun d =&gt; [1, 2, 4, 8, 7, 5].contains (m9 (d ^ 5))) ∧ ([1, 2, 4, 5, 7, 8].map (fun d =&gt; m9 (d ^ 5))).eraseDups.length = 6</code></pre>
6427
6534
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,5,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(d^{5}\right) \in [1,\,2,\,4,\,8,\,7,\,5] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d^{5}\right) \mid d \in [1,\,2,\,4,\,5,\,7,\,8] \,\}\right)\right| = 6</code></pre></details>
@@ -6430,7 +6537,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6430
6537
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 216 cases. <span class="qed">□</span></p>
6431
6538
 
6432
6539
  <div class="thm" id="thm-imagined-fifth_carries_orbit_onto_units">
6433
- <p class="thm-label"><strong>Theorem 643</strong> (<code>fifth_carries_orbit_onto_units</code>)<a class="thm-cite" href="/theorem/lean_imagined_fifth_carries_orbit_onto_units">sealed</a>.</p>
6540
+ <p class="thm-label"><strong>Theorem 658</strong> (<code>fifth_carries_orbit_onto_units</code>)<a class="thm-cite" href="/theorem/lean_imagined_fifth_carries_orbit_onto_units">sealed</a>.</p>
6434
6541
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>5</mn></msup><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>5</mn></msup><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>6</mn></mrow></mrow></math></div>
6435
6542
  <pre class="thm-statement"><code>[1, 2, 4, 8, 7, 5].all (fun d =&gt; [1, 2, 4, 5, 7, 8].contains (m9 (d ^ 5))) ∧ ([1, 2, 4, 8, 7, 5].map (fun d =&gt; m9 (d ^ 5))).eraseDups.length = 6</code></pre>
6436
6543
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,8,\,7,\,5],\; \mathrm{m9}\mathopen{}\left(d^{5}\right) \in [1,\,2,\,4,\,5,\,7,\,8] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d^{5}\right) \mid d \in [1,\,2,\,4,\,8,\,7,\,5] \,\}\right)\right| = 6</code></pre></details>
@@ -6439,7 +6546,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6439
6546
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 216 cases. <span class="qed">□</span></p>
6440
6547
 
6441
6548
  <div class="thm" id="thm-imagined-quintuple_carries_units_onto_orbit">
6442
- <p class="thm-label"><strong>Theorem 644</strong> (<code>quintuple_carries_units_onto_orbit</code>)<a class="thm-cite" href="/theorem/lean_imagined_quintuple_carries_units_onto_orbit">sealed</a>.</p>
6549
+ <p class="thm-label"><strong>Theorem 659</strong> (<code>quintuple_carries_units_onto_orbit</code>)<a class="thm-cite" href="/theorem/lean_imagined_quintuple_carries_units_onto_orbit">sealed</a>.</p>
6443
6550
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>5</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>5</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>6</mn></mrow></mrow></math></div>
6444
6551
  <pre class="thm-statement"><code>[1, 2, 4, 5, 7, 8].all (fun d =&gt; [1, 2, 4, 8, 7, 5].contains (m9 (5 * d))) ∧ ([1, 2, 4, 5, 7, 8].map (fun d =&gt; m9 (5 * d))).eraseDups.length = 6</code></pre>
6445
6552
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,5,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(5 \cdot d\right) \in [1,\,2,\,4,\,8,\,7,\,5] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(5 \cdot d\right) \mid d \in [1,\,2,\,4,\,5,\,7,\,8] \,\}\right)\right| = 6</code></pre></details>
@@ -6448,7 +6555,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6448
6555
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 216 cases. <span class="qed">□</span></p>
6449
6556
 
6450
6557
  <div class="thm" id="thm-imagined-quintuple_carries_orbit_onto_units">
6451
- <p class="thm-label"><strong>Theorem 645</strong> (<code>quintuple_carries_orbit_onto_units</code>)<a class="thm-cite" href="/theorem/lean_imagined_quintuple_carries_orbit_onto_units">sealed</a>.</p>
6558
+ <p class="thm-label"><strong>Theorem 660</strong> (<code>quintuple_carries_orbit_onto_units</code>)<a class="thm-cite" href="/theorem/lean_imagined_quintuple_carries_orbit_onto_units">sealed</a>.</p>
6452
6559
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>5</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>5</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>6</mn></mrow></mrow></math></div>
6453
6560
  <pre class="thm-statement"><code>[1, 2, 4, 8, 7, 5].all (fun d =&gt; [1, 2, 4, 5, 7, 8].contains (m9 (5 * d))) ∧ ([1, 2, 4, 8, 7, 5].map (fun d =&gt; m9 (5 * d))).eraseDups.length = 6</code></pre>
6454
6561
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,8,\,7,\,5],\; \mathrm{m9}\mathopen{}\left(5 \cdot d\right) \in [1,\,2,\,4,\,5,\,7,\,8] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(5 \cdot d\right) \mid d \in [1,\,2,\,4,\,8,\,7,\,5] \,\}\right)\right| = 6</code></pre></details>
@@ -6457,7 +6564,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6457
6564
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 216 cases. <span class="qed">□</span></p>
6458
6565
 
6459
6566
  <div class="thm" id="thm-imagined-quintuple_carries_tetA_onto_tetB">
6460
- <p class="thm-label"><strong>Theorem 646</strong> (<code>quintuple_carries_tetA_onto_tetB</code>)<a class="thm-cite" href="/theorem/lean_imagined_quintuple_carries_tetA_onto_tetB">sealed</a>.</p>
6567
+ <p class="thm-label"><strong>Theorem 661</strong> (<code>quintuple_carries_tetA_onto_tetB</code>)<a class="thm-cite" href="/theorem/lean_imagined_quintuple_carries_tetA_onto_tetB">sealed</a>.</p>
6461
6568
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>5</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>5</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>3</mn></mrow></mrow></math></div>
6462
6569
  <pre class="thm-statement"><code>[1, 4, 7].all (fun d =&gt; [2, 5, 8].contains (m9 (5 * d))) ∧ ([1, 4, 7].map (fun d =&gt; m9 (5 * d))).eraseDups.length = 3</code></pre>
6463
6570
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,4,\,7],\; \mathrm{m9}\mathopen{}\left(5 \cdot d\right) \in [2,\,5,\,8] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(5 \cdot d\right) \mid d \in [1,\,4,\,7] \,\}\right)\right| = 3</code></pre></details>
@@ -6466,7 +6573,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6466
6573
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 27 cases. <span class="qed">□</span></p>
6467
6574
 
6468
6575
  <div class="thm" id="thm-imagined-quintuple_carries_tetB_onto_tetA">
6469
- <p class="thm-label"><strong>Theorem 647</strong> (<code>quintuple_carries_tetB_onto_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_quintuple_carries_tetB_onto_tetA">sealed</a>.</p>
6576
+ <p class="thm-label"><strong>Theorem 662</strong> (<code>quintuple_carries_tetB_onto_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_quintuple_carries_tetB_onto_tetA">sealed</a>.</p>
6470
6577
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>5</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>5</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>3</mn></mrow></mrow></math></div>
6471
6578
  <pre class="thm-statement"><code>[2, 5, 8].all (fun d =&gt; [1, 4, 7].contains (m9 (5 * d))) ∧ ([2, 5, 8].map (fun d =&gt; m9 (5 * d))).eraseDups.length = 3</code></pre>
6472
6579
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [2,\,5,\,8],\; \mathrm{m9}\mathopen{}\left(5 \cdot d\right) \in [1,\,4,\,7] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(5 \cdot d\right) \mid d \in [2,\,5,\,8] \,\}\right)\right| = 3</code></pre></details>
@@ -6475,7 +6582,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6475
6582
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 27 cases. <span class="qed">□</span></p>
6476
6583
 
6477
6584
  <div class="thm" id="thm-imagined-sextuple_carries_all_onto_triad">
6478
- <p class="thm-label"><strong>Theorem 648</strong> (<code>sextuple_carries_all_onto_triad</code>)<a class="thm-cite" href="/theorem/lean_imagined_sextuple_carries_all_onto_triad">sealed</a>.</p>
6585
+ <p class="thm-label"><strong>Theorem 663</strong> (<code>sextuple_carries_all_onto_triad</code>)<a class="thm-cite" href="/theorem/lean_imagined_sextuple_carries_all_onto_triad">sealed</a>.</p>
6479
6586
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>6</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>6</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>3</mn></mrow></mrow></math></div>
6480
6587
  <pre class="thm-statement"><code>[0,1,2,3,4,5,6,7,8].all (fun d =&gt; [3, 6, 0].contains (m9 (6 * d))) ∧ ([0,1,2,3,4,5,6,7,8].map (fun d =&gt; m9 (6 * d))).eraseDups.length = 3</code></pre>
6481
6588
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(6 \cdot d\right) \in [3,\,6,\,0] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(6 \cdot d\right) \mid d \in [0,\,1,\,2,\,3,\,4,\,5,\,6,\,7,\,8] \,\}\right)\right| = 3</code></pre></details>
@@ -6484,7 +6591,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6484
6591
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 243 cases. <span class="qed">□</span></p>
6485
6592
 
6486
6593
  <div class="thm" id="thm-imagined-sextuple_carries_cubes_onto_triad">
6487
- <p class="thm-label"><strong>Theorem 649</strong> (<code>sextuple_carries_cubes_onto_triad</code>)<a class="thm-cite" href="/theorem/lean_imagined_sextuple_carries_cubes_onto_triad">sealed</a>.</p>
6594
+ <p class="thm-label"><strong>Theorem 664</strong> (<code>sextuple_carries_cubes_onto_triad</code>)<a class="thm-cite" href="/theorem/lean_imagined_sextuple_carries_cubes_onto_triad">sealed</a>.</p>
6488
6595
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>6</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>6</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>3</mn></mrow></mrow></math></div>
6489
6596
  <pre class="thm-statement"><code>[0, 1, 8].all (fun d =&gt; [3, 6, 0].contains (m9 (6 * d))) ∧ ([0, 1, 8].map (fun d =&gt; m9 (6 * d))).eraseDups.length = 3</code></pre>
6490
6597
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [0,\,1,\,8],\; \mathrm{m9}\mathopen{}\left(6 \cdot d\right) \in [3,\,6,\,0] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(6 \cdot d\right) \mid d \in [0,\,1,\,8] \,\}\right)\right| = 3</code></pre></details>
@@ -6493,7 +6600,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6493
6600
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 27 cases. <span class="qed">□</span></p>
6494
6601
 
6495
6602
  <div class="thm" id="thm-imagined-septuple_carries_units_onto_orbit">
6496
- <p class="thm-label"><strong>Theorem 650</strong> (<code>septuple_carries_units_onto_orbit</code>)<a class="thm-cite" href="/theorem/lean_imagined_septuple_carries_units_onto_orbit">sealed</a>.</p>
6603
+ <p class="thm-label"><strong>Theorem 665</strong> (<code>septuple_carries_units_onto_orbit</code>)<a class="thm-cite" href="/theorem/lean_imagined_septuple_carries_units_onto_orbit">sealed</a>.</p>
6497
6604
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>7</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>7</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>6</mn></mrow></mrow></math></div>
6498
6605
  <pre class="thm-statement"><code>[1, 2, 4, 5, 7, 8].all (fun d =&gt; [1, 2, 4, 8, 7, 5].contains (m9 (7 * d))) ∧ ([1, 2, 4, 5, 7, 8].map (fun d =&gt; m9 (7 * d))).eraseDups.length = 6</code></pre>
6499
6606
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,5,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(7 \cdot d\right) \in [1,\,2,\,4,\,8,\,7,\,5] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(7 \cdot d\right) \mid d \in [1,\,2,\,4,\,5,\,7,\,8] \,\}\right)\right| = 6</code></pre></details>
@@ -6502,7 +6609,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6502
6609
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 216 cases. <span class="qed">□</span></p>
6503
6610
 
6504
6611
  <div class="thm" id="thm-imagined-septuple_carries_orbit_onto_units">
6505
- <p class="thm-label"><strong>Theorem 651</strong> (<code>septuple_carries_orbit_onto_units</code>)<a class="thm-cite" href="/theorem/lean_imagined_septuple_carries_orbit_onto_units">sealed</a>.</p>
6612
+ <p class="thm-label"><strong>Theorem 666</strong> (<code>septuple_carries_orbit_onto_units</code>)<a class="thm-cite" href="/theorem/lean_imagined_septuple_carries_orbit_onto_units">sealed</a>.</p>
6506
6613
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>7</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>7</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>6</mn></mrow></mrow></math></div>
6507
6614
  <pre class="thm-statement"><code>[1, 2, 4, 8, 7, 5].all (fun d =&gt; [1, 2, 4, 5, 7, 8].contains (m9 (7 * d))) ∧ ([1, 2, 4, 8, 7, 5].map (fun d =&gt; m9 (7 * d))).eraseDups.length = 6</code></pre>
6508
6615
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,8,\,7,\,5],\; \mathrm{m9}\mathopen{}\left(7 \cdot d\right) \in [1,\,2,\,4,\,5,\,7,\,8] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(7 \cdot d\right) \mid d \in [1,\,2,\,4,\,8,\,7,\,5] \,\}\right)\right| = 6</code></pre></details>
@@ -6511,7 +6618,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6511
6618
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 216 cases. <span class="qed">□</span></p>
6512
6619
 
6513
6620
  <div class="thm" id="thm-imagined-octuple_carries_units_onto_orbit">
6514
- <p class="thm-label"><strong>Theorem 652</strong> (<code>octuple_carries_units_onto_orbit</code>)<a class="thm-cite" href="/theorem/lean_imagined_octuple_carries_units_onto_orbit">sealed</a>.</p>
6621
+ <p class="thm-label"><strong>Theorem 667</strong> (<code>octuple_carries_units_onto_orbit</code>)<a class="thm-cite" href="/theorem/lean_imagined_octuple_carries_units_onto_orbit">sealed</a>.</p>
6515
6622
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>8</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>8</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>6</mn></mrow></mrow></math></div>
6516
6623
  <pre class="thm-statement"><code>[1, 2, 4, 5, 7, 8].all (fun d =&gt; [1, 2, 4, 8, 7, 5].contains (m9 (8 * d))) ∧ ([1, 2, 4, 5, 7, 8].map (fun d =&gt; m9 (8 * d))).eraseDups.length = 6</code></pre>
6517
6624
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,5,\,7,\,8],\; \mathrm{m9}\mathopen{}\left(8 \cdot d\right) \in [1,\,2,\,4,\,8,\,7,\,5] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(8 \cdot d\right) \mid d \in [1,\,2,\,4,\,5,\,7,\,8] \,\}\right)\right| = 6</code></pre></details>
@@ -6520,7 +6627,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6520
6627
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 216 cases. <span class="qed">□</span></p>
6521
6628
 
6522
6629
  <div class="thm" id="thm-imagined-octuple_carries_orbit_onto_units">
6523
- <p class="thm-label"><strong>Theorem 653</strong> (<code>octuple_carries_orbit_onto_units</code>)<a class="thm-cite" href="/theorem/lean_imagined_octuple_carries_orbit_onto_units">sealed</a>.</p>
6630
+ <p class="thm-label"><strong>Theorem 668</strong> (<code>octuple_carries_orbit_onto_units</code>)<a class="thm-cite" href="/theorem/lean_imagined_octuple_carries_orbit_onto_units">sealed</a>.</p>
6524
6631
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>8</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>8</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>6</mn></mrow></mrow></math></div>
6525
6632
  <pre class="thm-statement"><code>[1, 2, 4, 8, 7, 5].all (fun d =&gt; [1, 2, 4, 5, 7, 8].contains (m9 (8 * d))) ∧ ([1, 2, 4, 8, 7, 5].map (fun d =&gt; m9 (8 * d))).eraseDups.length = 6</code></pre>
6526
6633
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,2,\,4,\,8,\,7,\,5],\; \mathrm{m9}\mathopen{}\left(8 \cdot d\right) \in [1,\,2,\,4,\,5,\,7,\,8] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(8 \cdot d\right) \mid d \in [1,\,2,\,4,\,8,\,7,\,5] \,\}\right)\right| = 6</code></pre></details>
@@ -6529,7 +6636,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6529
6636
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 216 cases. <span class="qed">□</span></p>
6530
6637
 
6531
6638
  <div class="thm" id="thm-imagined-octuple_carries_tetA_onto_tetB">
6532
- <p class="thm-label"><strong>Theorem 654</strong> (<code>octuple_carries_tetA_onto_tetB</code>)<a class="thm-cite" href="/theorem/lean_imagined_octuple_carries_tetA_onto_tetB">sealed</a>.</p>
6639
+ <p class="thm-label"><strong>Theorem 669</strong> (<code>octuple_carries_tetA_onto_tetB</code>)<a class="thm-cite" href="/theorem/lean_imagined_octuple_carries_tetA_onto_tetB">sealed</a>.</p>
6533
6640
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>8</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>8</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>3</mn></mrow></mrow></math></div>
6534
6641
  <pre class="thm-statement"><code>[1, 4, 7].all (fun d =&gt; [2, 5, 8].contains (m9 (8 * d))) ∧ ([1, 4, 7].map (fun d =&gt; m9 (8 * d))).eraseDups.length = 3</code></pre>
6535
6642
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [1,\,4,\,7],\; \mathrm{m9}\mathopen{}\left(8 \cdot d\right) \in [2,\,5,\,8] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(8 \cdot d\right) \mid d \in [1,\,4,\,7] \,\}\right)\right| = 3</code></pre></details>
@@ -6538,7 +6645,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6538
6645
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 27 cases. <span class="qed">□</span></p>
6539
6646
 
6540
6647
  <div class="thm" id="thm-imagined-octuple_carries_tetB_onto_tetA">
6541
- <p class="thm-label"><strong>Theorem 655</strong> (<code>octuple_carries_tetB_onto_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_octuple_carries_tetB_onto_tetA">sealed</a>.</p>
6648
+ <p class="thm-label"><strong>Theorem 670</strong> (<code>octuple_carries_tetB_onto_tetA</code>)<a class="thm-cite" href="/theorem/lean_imagined_octuple_carries_tetB_onto_tetA">sealed</a>.</p>
6542
6649
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mrow><mi>m9</mi><mo>(</mo><mrow><mn>8</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>8</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>3</mn></mrow></mrow></math></div>
6543
6650
  <pre class="thm-statement"><code>[2, 5, 8].all (fun d =&gt; [1, 4, 7].contains (m9 (8 * d))) ∧ ([2, 5, 8].map (fun d =&gt; m9 (8 * d))).eraseDups.length = 3</code></pre>
6544
6651
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in [2,\,5,\,8],\; \mathrm{m9}\mathopen{}\left(8 \cdot d\right) \in [1,\,4,\,7] \land \left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(8 \cdot d\right) \mid d \in [2,\,5,\,8] \,\}\right)\right| = 3</code></pre></details>
@@ -6547,7 +6654,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6547
6654
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 27 cases. <span class="qed">□</span></p>
6548
6655
 
6549
6656
  <div class="thm" id="thm-imagined-triple_collapses_triad_to_one_value">
6550
- <p class="thm-label"><strong>Theorem 656</strong> (<code>triple_collapses_triad_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_triple_collapses_triad_to_one_value">sealed</a>.</p>
6657
+ <p class="thm-label"><strong>Theorem 671</strong> (<code>triple_collapses_triad_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_triple_collapses_triad_to_one_value">sealed</a>.</p>
6551
6658
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>3</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>1</mn></mrow></math></div>
6552
6659
  <pre class="thm-statement"><code>([3, 6, 0].map (fun d =&gt; m9 (3 * d))).eraseDups.length = 1</code></pre>
6553
6660
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(3 \cdot d\right) \mid d \in [3,\,6,\,0] \,\}\right)\right| = 1</code></pre></details>
@@ -6556,7 +6663,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6556
6663
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6557
6664
 
6558
6665
  <div class="thm" id="thm-imagined-triple_collapses_tetA_to_one_value">
6559
- <p class="thm-label"><strong>Theorem 657</strong> (<code>triple_collapses_tetA_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_triple_collapses_tetA_to_one_value">sealed</a>.</p>
6666
+ <p class="thm-label"><strong>Theorem 672</strong> (<code>triple_collapses_tetA_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_triple_collapses_tetA_to_one_value">sealed</a>.</p>
6560
6667
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>3</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>1</mn></mrow></math></div>
6561
6668
  <pre class="thm-statement"><code>([1, 4, 7].map (fun d =&gt; m9 (3 * d))).eraseDups.length = 1</code></pre>
6562
6669
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(3 \cdot d\right) \mid d \in [1,\,4,\,7] \,\}\right)\right| = 1</code></pre></details>
@@ -6565,7 +6672,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6565
6672
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6566
6673
 
6567
6674
  <div class="thm" id="thm-imagined-triple_collapses_tetB_to_one_value">
6568
- <p class="thm-label"><strong>Theorem 658</strong> (<code>triple_collapses_tetB_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_triple_collapses_tetB_to_one_value">sealed</a>.</p>
6675
+ <p class="thm-label"><strong>Theorem 673</strong> (<code>triple_collapses_tetB_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_triple_collapses_tetB_to_one_value">sealed</a>.</p>
6569
6676
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>3</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>1</mn></mrow></math></div>
6570
6677
  <pre class="thm-statement"><code>([2, 5, 8].map (fun d =&gt; m9 (3 * d))).eraseDups.length = 1</code></pre>
6571
6678
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(3 \cdot d\right) \mid d \in [2,\,5,\,8] \,\}\right)\right| = 1</code></pre></details>
@@ -6574,7 +6681,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6574
6681
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6575
6682
 
6576
6683
  <div class="thm" id="thm-imagined-cube_collapses_triad_to_one_value">
6577
- <p class="thm-label"><strong>Theorem 659</strong> (<code>cube_collapses_triad_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_cube_collapses_triad_to_one_value">sealed</a>.</p>
6684
+ <p class="thm-label"><strong>Theorem 674</strong> (<code>cube_collapses_triad_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_cube_collapses_triad_to_one_value">sealed</a>.</p>
6578
6685
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>1</mn></mrow></math></div>
6579
6686
  <pre class="thm-statement"><code>([3, 6, 0].map (fun d =&gt; m9 (d * d * d))).eraseDups.length = 1</code></pre>
6580
6687
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d \cdot d \cdot d\right) \mid d \in [3,\,6,\,0] \,\}\right)\right| = 1</code></pre></details>
@@ -6583,7 +6690,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6583
6690
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6584
6691
 
6585
6692
  <div class="thm" id="thm-imagined-cube_collapses_tetA_to_one_value">
6586
- <p class="thm-label"><strong>Theorem 660</strong> (<code>cube_collapses_tetA_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_cube_collapses_tetA_to_one_value">sealed</a>.</p>
6693
+ <p class="thm-label"><strong>Theorem 675</strong> (<code>cube_collapses_tetA_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_cube_collapses_tetA_to_one_value">sealed</a>.</p>
6587
6694
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>1</mn></mrow></math></div>
6588
6695
  <pre class="thm-statement"><code>([1, 4, 7].map (fun d =&gt; m9 (d * d * d))).eraseDups.length = 1</code></pre>
6589
6696
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d \cdot d \cdot d\right) \mid d \in [1,\,4,\,7] \,\}\right)\right| = 1</code></pre></details>
@@ -6592,7 +6699,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6592
6699
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6593
6700
 
6594
6701
  <div class="thm" id="thm-imagined-cube_collapses_tetB_to_one_value">
6595
- <p class="thm-label"><strong>Theorem 661</strong> (<code>cube_collapses_tetB_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_cube_collapses_tetB_to_one_value">sealed</a>.</p>
6702
+ <p class="thm-label"><strong>Theorem 676</strong> (<code>cube_collapses_tetB_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_cube_collapses_tetB_to_one_value">sealed</a>.</p>
6596
6703
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>1</mn></mrow></math></div>
6597
6704
  <pre class="thm-statement"><code>([2, 5, 8].map (fun d =&gt; m9 (d * d * d))).eraseDups.length = 1</code></pre>
6598
6705
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d \cdot d \cdot d\right) \mid d \in [2,\,5,\,8] \,\}\right)\right| = 1</code></pre></details>
@@ -6601,7 +6708,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6601
6708
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6602
6709
 
6603
6710
  <div class="thm" id="thm-imagined-fourth_collapses_triad_to_one_value">
6604
- <p class="thm-label"><strong>Theorem 662</strong> (<code>fourth_collapses_triad_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_fourth_collapses_triad_to_one_value">sealed</a>.</p>
6711
+ <p class="thm-label"><strong>Theorem 677</strong> (<code>fourth_collapses_triad_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_fourth_collapses_triad_to_one_value">sealed</a>.</p>
6605
6712
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>4</mn></msup><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>1</mn></mrow></math></div>
6606
6713
  <pre class="thm-statement"><code>([3, 6, 0].map (fun d =&gt; m9 (d ^ 4))).eraseDups.length = 1</code></pre>
6607
6714
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d^{4}\right) \mid d \in [3,\,6,\,0] \,\}\right)\right| = 1</code></pre></details>
@@ -6610,7 +6717,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6610
6717
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6611
6718
 
6612
6719
  <div class="thm" id="thm-imagined-fifth_collapses_triad_to_one_value">
6613
- <p class="thm-label"><strong>Theorem 663</strong> (<code>fifth_collapses_triad_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_fifth_collapses_triad_to_one_value">sealed</a>.</p>
6720
+ <p class="thm-label"><strong>Theorem 678</strong> (<code>fifth_collapses_triad_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_fifth_collapses_triad_to_one_value">sealed</a>.</p>
6614
6721
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>5</mn></msup><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>1</mn></mrow></math></div>
6615
6722
  <pre class="thm-statement"><code>([3, 6, 0].map (fun d =&gt; m9 (d ^ 5))).eraseDups.length = 1</code></pre>
6616
6723
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d^{5}\right) \mid d \in [3,\,6,\,0] \,\}\right)\right| = 1</code></pre></details>
@@ -6619,7 +6726,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6619
6726
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6620
6727
 
6621
6728
  <div class="thm" id="thm-imagined-sixth_collapses_units_to_one_value">
6622
- <p class="thm-label"><strong>Theorem 664</strong> (<code>sixth_collapses_units_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_sixth_collapses_units_to_one_value">sealed</a>.</p>
6729
+ <p class="thm-label"><strong>Theorem 679</strong> (<code>sixth_collapses_units_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_sixth_collapses_units_to_one_value">sealed</a>.</p>
6623
6730
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>6</mn></msup><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>1</mn></mrow></math></div>
6624
6731
  <pre class="thm-statement"><code>([1, 2, 4, 5, 7, 8].map (fun d =&gt; m9 (d ^ 6))).eraseDups.length = 1</code></pre>
6625
6732
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d^{6}\right) \mid d \in [1,\,2,\,4,\,5,\,7,\,8] \,\}\right)\right| = 1</code></pre></details>
@@ -6628,7 +6735,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6628
6735
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 6 cases. <span class="qed">□</span></p>
6629
6736
 
6630
6737
  <div class="thm" id="thm-imagined-sixth_collapses_triad_to_one_value">
6631
- <p class="thm-label"><strong>Theorem 665</strong> (<code>sixth_collapses_triad_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_sixth_collapses_triad_to_one_value">sealed</a>.</p>
6738
+ <p class="thm-label"><strong>Theorem 680</strong> (<code>sixth_collapses_triad_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_sixth_collapses_triad_to_one_value">sealed</a>.</p>
6632
6739
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>6</mn></msup><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>1</mn></mrow></math></div>
6633
6740
  <pre class="thm-statement"><code>([3, 6, 0].map (fun d =&gt; m9 (d ^ 6))).eraseDups.length = 1</code></pre>
6634
6741
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d^{6}\right) \mid d \in [3,\,6,\,0] \,\}\right)\right| = 1</code></pre></details>
@@ -6637,7 +6744,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6637
6744
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6638
6745
 
6639
6746
  <div class="thm" id="thm-imagined-sixth_collapses_orbit_to_one_value">
6640
- <p class="thm-label"><strong>Theorem 666</strong> (<code>sixth_collapses_orbit_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_sixth_collapses_orbit_to_one_value">sealed</a>.</p>
6747
+ <p class="thm-label"><strong>Theorem 681</strong> (<code>sixth_collapses_orbit_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_sixth_collapses_orbit_to_one_value">sealed</a>.</p>
6641
6748
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>6</mn></msup><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>1</mn></mrow></math></div>
6642
6749
  <pre class="thm-statement"><code>([1, 2, 4, 8, 7, 5].map (fun d =&gt; m9 (d ^ 6))).eraseDups.length = 1</code></pre>
6643
6750
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d^{6}\right) \mid d \in [1,\,2,\,4,\,8,\,7,\,5] \,\}\right)\right| = 1</code></pre></details>
@@ -6646,7 +6753,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6646
6753
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 6 cases. <span class="qed">□</span></p>
6647
6754
 
6648
6755
  <div class="thm" id="thm-imagined-sixth_collapses_tetA_to_one_value">
6649
- <p class="thm-label"><strong>Theorem 667</strong> (<code>sixth_collapses_tetA_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_sixth_collapses_tetA_to_one_value">sealed</a>.</p>
6756
+ <p class="thm-label"><strong>Theorem 682</strong> (<code>sixth_collapses_tetA_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_sixth_collapses_tetA_to_one_value">sealed</a>.</p>
6650
6757
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>6</mn></msup><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>1</mn></mrow></math></div>
6651
6758
  <pre class="thm-statement"><code>([1, 4, 7].map (fun d =&gt; m9 (d ^ 6))).eraseDups.length = 1</code></pre>
6652
6759
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d^{6}\right) \mid d \in [1,\,4,\,7] \,\}\right)\right| = 1</code></pre></details>
@@ -6655,7 +6762,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6655
6762
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6656
6763
 
6657
6764
  <div class="thm" id="thm-imagined-sixth_collapses_tetB_to_one_value">
6658
- <p class="thm-label"><strong>Theorem 668</strong> (<code>sixth_collapses_tetB_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_sixth_collapses_tetB_to_one_value">sealed</a>.</p>
6765
+ <p class="thm-label"><strong>Theorem 683</strong> (<code>sixth_collapses_tetB_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_sixth_collapses_tetB_to_one_value">sealed</a>.</p>
6659
6766
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><msup><mi>d</mi><mn>6</mn></msup><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>1</mn></mrow></math></div>
6660
6767
  <pre class="thm-statement"><code>([2, 5, 8].map (fun d =&gt; m9 (d ^ 6))).eraseDups.length = 1</code></pre>
6661
6768
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(d^{6}\right) \mid d \in [2,\,5,\,8] \,\}\right)\right| = 1</code></pre></details>
@@ -6664,7 +6771,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6664
6771
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6665
6772
 
6666
6773
  <div class="thm" id="thm-imagined-sextuple_collapses_triad_to_one_value">
6667
- <p class="thm-label"><strong>Theorem 669</strong> (<code>sextuple_collapses_triad_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_sextuple_collapses_triad_to_one_value">sealed</a>.</p>
6774
+ <p class="thm-label"><strong>Theorem 684</strong> (<code>sextuple_collapses_triad_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_sextuple_collapses_triad_to_one_value">sealed</a>.</p>
6668
6775
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>6</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>0</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>1</mn></mrow></math></div>
6669
6776
  <pre class="thm-statement"><code>([3, 6, 0].map (fun d =&gt; m9 (6 * d))).eraseDups.length = 1</code></pre>
6670
6777
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(6 \cdot d\right) \mid d \in [3,\,6,\,0] \,\}\right)\right| = 1</code></pre></details>
@@ -6673,7 +6780,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6673
6780
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6674
6781
 
6675
6782
  <div class="thm" id="thm-imagined-sextuple_collapses_tetA_to_one_value">
6676
- <p class="thm-label"><strong>Theorem 670</strong> (<code>sextuple_collapses_tetA_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_sextuple_collapses_tetA_to_one_value">sealed</a>.</p>
6783
+ <p class="thm-label"><strong>Theorem 685</strong> (<code>sextuple_collapses_tetA_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_sextuple_collapses_tetA_to_one_value">sealed</a>.</p>
6677
6784
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>6</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>1</mn></mrow></math></div>
6678
6785
  <pre class="thm-statement"><code>([1, 4, 7].map (fun d =&gt; m9 (6 * d))).eraseDups.length = 1</code></pre>
6679
6786
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(6 \cdot d\right) \mid d \in [1,\,4,\,7] \,\}\right)\right| = 1</code></pre></details>
@@ -6682,7 +6789,7 @@ kernel accepted; whatever it refused is reported by the generator and is not in
6682
6789
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6683
6790
 
6684
6791
  <div class="thm" id="thm-imagined-sextuple_collapses_tetB_to_one_value">
6685
- <p class="thm-label"><strong>Theorem 671</strong> (<code>sextuple_collapses_tetB_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_sextuple_collapses_tetB_to_one_value">sealed</a>.</p>
6792
+ <p class="thm-label"><strong>Theorem 686</strong> (<code>sextuple_collapses_tetB_to_one_value</code>)<a class="thm-cite" href="/theorem/lean_imagined_sextuple_collapses_tetB_to_one_value">sealed</a>.</p>
6686
6793
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>m9</mi><mo>(</mo><mrow><mn>6</mn><mo>⋅</mo><mi>d</mi></mrow><mo>)</mo></mrow><mo>∣</mo><mi>d</mi><mo>∈</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>1</mn></mrow></math></div>
6687
6794
  <pre class="thm-statement"><code>([2, 5, 8].map (fun d =&gt; m9 (6 * d))).eraseDups.length = 1</code></pre>
6688
6795
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\operatorname{dedup}\left(\{\, \mathrm{m9}\mathopen{}\left(6 \cdot d\right) \mid d \in [2,\,5,\,8] \,\}\right)\right| = 1</code></pre></details>
@@ -6763,7 +6870,7 @@ two cannot drift: a file that changes its declaration and not this table fails t
6763
6870
  <pre class="thm-statement paper-defs"><code>sources := [ (1, 0, false) -- address.lean — composes FNV-1a (Fowler, Noll, Vo, 1991) with the Merkle hash tree (Merkle, 1979)</code></pre>
6764
6871
 
6765
6872
  <div class="thm" id="thm-priorart-novelty_is_claimed_only_where_a_search_was_performed">
6766
- <p class="thm-label"><strong>Theorem 672</strong> (<code>novelty_is_claimed_only_where_a_search_was_performed</code>)<a class="thm-cite" href="/theorem/lean_priorart_novelty_is_claimed_only_where_a_search_was_performed">sealed</a>.</p>
6873
+ <p class="thm-label"><strong>Theorem 687</strong> (<code>novelty_is_claimed_only_where_a_search_was_performed</code>)<a class="thm-cite" href="/theorem/lean_priorart_novelty_is_claimed_only_where_a_search_was_performed">sealed</a>.</p>
6767
6874
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>s</mi><mo>∈</mo><mi>sources</mi><mo>,</mo><mrow><mrow><mrow><mi>novelty</mi><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>=</mo><mi>false</mi></mrow><mo>∨</mo><mrow><mrow><mi>kindOf</mi><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>=</mo><mn>2</mn></mrow></mrow></mrow></math></div>
6768
6875
  <pre class="thm-statement"><code>sources.all (fun s =&gt; novelty s == false || kindOf s == 2)</code></pre>
6769
6876
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall s \in \mathrm{sources},\; \mathrm{novelty}\mathopen{}\left(s\right) = \mathrm{false} \lor \mathrm{kindOf}\mathopen{}\left(s\right) = 2</code></pre></details>
@@ -6772,7 +6879,7 @@ two cannot drift: a file that changes its declaration and not this table fails t
6772
6879
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
6773
6880
 
6774
6881
  <div class="thm" id="thm-priorart-this_deposit_claims_no_novelty_today">
6775
- <p class="thm-label"><strong>Theorem 673</strong> (<code>this_deposit_claims_no_novelty_today</code>)<a class="thm-cite" href="/theorem/lean_priorart_this_deposit_claims_no_novelty_today">sealed</a>.</p>
6882
+ <p class="thm-label"><strong>Theorem 688</strong> (<code>this_deposit_claims_no_novelty_today</code>)<a class="thm-cite" href="/theorem/lean_priorart_this_deposit_claims_no_novelty_today">sealed</a>.</p>
6776
6883
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mo>{</mo><mi>x</mi><mo>∈</mo><mi>sources</mi><mo>∣</mo><mi>novelty</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>}</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>0</mn></mrow></math></div>
6777
6884
  <pre class="thm-statement"><code>(sources.filter novelty).length = 0</code></pre>
6778
6885
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\{\, x \in \mathrm{sources} \mid \mathrm{novelty}\mathopen{}\left(x\right) \,\}\right| = 0</code></pre></details>
@@ -6780,7 +6887,7 @@ two cannot drift: a file that changes its declaration and not this table fails t
6780
6887
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
6781
6888
 
6782
6889
  <div class="thm" id="thm-priorart-the_restated_sources_are_named_and_claim_nothing">
6783
- <p class="thm-label"><strong>Theorem 674</strong> (<code>the_restated_sources_are_named_and_claim_nothing</code>)<a class="thm-cite" href="/theorem/lean_priorart_the_restated_sources_are_named_and_claim_nothing">sealed</a>.</p>
6890
+ <p class="thm-label"><strong>Theorem 689</strong> (<code>the_restated_sources_are_named_and_claim_nothing</code>)<a class="thm-cite" href="/theorem/lean_priorart_the_restated_sources_are_named_and_claim_nothing">sealed</a>.</p>
6784
6891
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>s</mi><mo>∈</mo><mrow><mo>{</mo><mi>s</mi><mo>∈</mo><mi>sources</mi><mo>∣</mo><mrow><mrow><mi>kindOf</mi><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>=</mo><mn>0</mn></mrow><mo>}</mo></mrow><mo>,</mo><mrow><mrow><mi>novelty</mi><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>=</mo><mi>false</mi></mrow></mrow></math></div>
6785
6892
  <pre class="thm-statement"><code>(sources.filter (fun s =&gt; kindOf s == 0)).all (fun s =&gt; novelty s == false)</code></pre>
6786
6893
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall s \in \{\, s \in \mathrm{sources} \mid \mathrm{kindOf}\mathopen{}\left(s\right) = 0 \,\},\; \mathrm{novelty}\mathopen{}\left(s\right) = \mathrm{false}</code></pre></details>
@@ -6789,7 +6896,7 @@ two cannot drift: a file that changes its declaration and not this table fails t
6789
6896
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
6790
6897
 
6791
6898
  <div class="thm" id="thm-priorart-an_unsearched_source_claims_nothing">
6792
- <p class="thm-label"><strong>Theorem 675</strong> (<code>an_unsearched_source_claims_nothing</code>)<a class="thm-cite" href="/theorem/lean_priorart_an_unsearched_source_claims_nothing">sealed</a>.</p>
6899
+ <p class="thm-label"><strong>Theorem 690</strong> (<code>an_unsearched_source_claims_nothing</code>)<a class="thm-cite" href="/theorem/lean_priorart_an_unsearched_source_claims_nothing">sealed</a>.</p>
6793
6900
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>s</mi><mo>∈</mo><mrow><mo>{</mo><mi>s</mi><mo>∈</mo><mi>sources</mi><mo>∣</mo><mrow><mrow><mi>kindOf</mi><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>=</mo><mn>1</mn></mrow><mo>}</mo></mrow><mo>,</mo><mrow><mrow><mi>novelty</mi><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>=</mo><mi>false</mi></mrow></mrow></math></div>
6794
6901
  <pre class="thm-statement"><code>(sources.filter (fun s =&gt; kindOf s == 1)).all (fun s =&gt; novelty s == false)</code></pre>
6795
6902
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall s \in \{\, s \in \mathrm{sources} \mid \mathrm{kindOf}\mathopen{}\left(s\right) = 1 \,\},\; \mathrm{novelty}\mathopen{}\left(s\right) = \mathrm{false}</code></pre></details>
@@ -6797,7 +6904,7 @@ two cannot drift: a file that changes its declaration and not this table fails t
6797
6904
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
6798
6905
 
6799
6906
  <div class="thm" id="thm-priorart-every_source_is_classified">
6800
- <p class="thm-label"><strong>Theorem 676</strong> (<code>every_source_is_classified</code>)<a class="thm-cite" href="/theorem/lean_priorart_every_source_is_classified">sealed</a>.</p>
6907
+ <p class="thm-label"><strong>Theorem 691</strong> (<code>every_source_is_classified</code>)<a class="thm-cite" href="/theorem/lean_priorart_every_source_is_classified">sealed</a>.</p>
6801
6908
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>s</mi><mo>∈</mo><mi>sources</mi><mo>,</mo><mrow><mrow><mrow><mrow><mi>kindOf</mi><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>=</mo><mn>0</mn></mrow><mo>∨</mo><mrow><mrow><mi>kindOf</mi><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>=</mo><mn>1</mn></mrow></mrow><mo>∨</mo><mrow><mrow><mi>kindOf</mi><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>=</mo><mn>2</mn></mrow></mrow></mrow></math></div>
6802
6909
  <pre class="thm-statement"><code>sources.all (fun s =&gt; kindOf s == 0 || kindOf s == 1 || kindOf s == 2)</code></pre>
6803
6910
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall s \in \mathrm{sources},\; \mathrm{kindOf}\mathopen{}\left(s\right) = 0 \lor \mathrm{kindOf}\mathopen{}\left(s\right) = 1 \lor \mathrm{kindOf}\mathopen{}\left(s\right) = 2</code></pre></details>
@@ -6805,7 +6912,7 @@ two cannot drift: a file that changes its declaration and not this table fails t
6805
6912
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
6806
6913
 
6807
6914
  <div class="thm" id="thm-priorart-the_kinds_cover_every_source">
6808
- <p class="thm-label"><strong>Theorem 677</strong> (<code>the_kinds_cover_every_source</code>)<a class="thm-cite" href="/theorem/lean_priorart_the_kinds_cover_every_source">sealed</a>.</p>
6915
+ <p class="thm-label"><strong>Theorem 692</strong> (<code>the_kinds_cover_every_source</code>)<a class="thm-cite" href="/theorem/lean_priorart_the_kinds_cover_every_source">sealed</a>.</p>
6809
6916
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mrow><mrow><mo>|</mo><mrow><mo>{</mo><mi>s</mi><mo>∈</mo><mi>sources</mi><mo>∣</mo><mrow><mrow><mi>kindOf</mi><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>=</mo><mn>0</mn></mrow><mo>}</mo></mrow><mo>|</mo></mrow><mo>+</mo><mrow><mo>|</mo><mrow><mo>{</mo><mi>s</mi><mo>∈</mo><mi>sources</mi><mo>∣</mo><mrow><mrow><mi>kindOf</mi><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>=</mo><mn>1</mn></mrow><mo>}</mo></mrow><mo>|</mo></mrow></mrow><mo>+</mo><mrow><mo>|</mo><mrow><mo>{</mo><mi>s</mi><mo>∈</mo><mi>sources</mi><mo>∣</mo><mrow><mrow><mi>kindOf</mi><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>=</mo><mn>2</mn></mrow><mo>}</mo></mrow><mo>|</mo></mrow></mrow><mo>=</mo><mrow><mo>|</mo><mi>sources</mi><mo>|</mo></mrow></mrow></math></div>
6810
6917
  <pre class="thm-statement"><code>(sources.filter (fun s =&gt; kindOf s == 0)).length + (sources.filter (fun s =&gt; kindOf s == 1)).length + (sources.filter (fun s =&gt; kindOf s == 2)).length = sources.length</code></pre>
6811
6918
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\{\, s \in \mathrm{sources} \mid \mathrm{kindOf}\mathopen{}\left(s\right) = 0 \,\}\right| + \left|\{\, s \in \mathrm{sources} \mid \mathrm{kindOf}\mathopen{}\left(s\right) = 1 \,\}\right| + \left|\{\, s \in \mathrm{sources} \mid \mathrm{kindOf}\mathopen{}\left(s\right) = 2 \,\}\right| = \left|\mathrm{sources}\right|</code></pre></details>
@@ -6813,7 +6920,7 @@ two cannot drift: a file that changes its declaration and not this table fails t
6813
6920
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
6814
6921
 
6815
6922
  <div class="thm" id="thm-priorart-some_sources_are_unsearched">
6816
- <p class="thm-label"><strong>Theorem 678</strong> (<code>some_sources_are_unsearched</code>)<a class="thm-cite" href="/theorem/lean_priorart_some_sources_are_unsearched">sealed</a>.</p>
6923
+ <p class="thm-label"><strong>Theorem 693</strong> (<code>some_sources_are_unsearched</code>)<a class="thm-cite" href="/theorem/lean_priorart_some_sources_are_unsearched">sealed</a>.</p>
6817
6924
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mo>{</mo><mi>s</mi><mo>∈</mo><mi>sources</mi><mo>∣</mo><mrow><mrow><mi>kindOf</mi><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>=</mo><mn>1</mn></mrow><mo>}</mo></mrow><mo>|</mo></mrow><mo>&gt;</mo><mn>0</mn></mrow></math></div>
6818
6925
  <pre class="thm-statement"><code>(sources.filter (fun s =&gt; kindOf s == 1)).length &gt; 0</code></pre>
6819
6926
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\{\, s \in \mathrm{sources} \mid \mathrm{kindOf}\mathopen{}\left(s\right) = 1 \,\}\right| &gt; 0</code></pre></details>
@@ -6822,7 +6929,7 @@ two cannot drift: a file that changes its declaration and not this table fails t
6822
6929
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
6823
6930
 
6824
6931
  <div class="thm" id="thm-priorart-zero_claims_is_not_full_attribution">
6825
- <p class="thm-label"><strong>Theorem 679</strong> (<code>zero_claims_is_not_full_attribution</code>)<a class="thm-cite" href="/theorem/lean_priorart_zero_claims_is_not_full_attribution">sealed</a>.</p>
6932
+ <p class="thm-label"><strong>Theorem 694</strong> (<code>zero_claims_is_not_full_attribution</code>)<a class="thm-cite" href="/theorem/lean_priorart_zero_claims_is_not_full_attribution">sealed</a>.</p>
6826
6933
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mrow><mo>|</mo><mrow><mo>{</mo><mi>x</mi><mo>∈</mo><mi>sources</mi><mo>∣</mo><mi>novelty</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>}</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>0</mn></mrow><mo>∧</mo><mrow><mrow><mo>|</mo><mrow><mo>{</mo><mi>s</mi><mo>∈</mo><mi>sources</mi><mo>∣</mo><mrow><mrow><mi>kindOf</mi><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>=</mo><mn>1</mn></mrow><mo>}</mo></mrow><mo>|</mo></mrow><mo>&gt;</mo><mn>0</mn></mrow></mrow></math></div>
6827
6934
  <pre class="thm-statement"><code>(sources.filter novelty).length = 0 ∧ (sources.filter (fun s =&gt; kindOf s == 1)).length &gt; 0</code></pre>
6828
6935
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\{\, x \in \mathrm{sources} \mid \mathrm{novelty}\mathopen{}\left(x\right) \,\}\right| = 0 \land \left|\{\, s \in \mathrm{sources} \mid \mathrm{kindOf}\mathopen{}\left(s\right) = 1 \,\}\right| &gt; 0</code></pre></details>
@@ -6830,7 +6937,7 @@ two cannot drift: a file that changes its declaration and not this table fails t
6830
6937
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
6831
6938
 
6832
6939
  <div class="thm" id="thm-priorart-novelty_is_claimed_of_no_source">
6833
- <p class="thm-label"><strong>Theorem 680</strong> (<code>novelty_is_claimed_of_no_source</code>)<a class="thm-cite" href="/theorem/lean_priorart_novelty_is_claimed_of_no_source">sealed</a>.</p>
6940
+ <p class="thm-label"><strong>Theorem 695</strong> (<code>novelty_is_claimed_of_no_source</code>)<a class="thm-cite" href="/theorem/lean_priorart_novelty_is_claimed_of_no_source">sealed</a>.</p>
6834
6941
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mo>{</mo><mi>x</mi><mo>∈</mo><mi>sources</mi><mo>∣</mo><mi>novelty</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>}</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>0</mn></mrow></math></div>
6835
6942
  <pre class="thm-statement"><code>(sources.filter novelty).length = 0</code></pre>
6836
6943
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\{\, x \in \mathrm{sources} \mid \mathrm{novelty}\mathopen{}\left(x\right) \,\}\right| = 0</code></pre></details>
@@ -6911,7 +7018,7 @@ what the instruments say, drafted from their texts; it is not legal advice, and
6911
7018
  settledHere := 8</code></pre>
6912
7019
 
6913
7020
  <div class="thm" id="thm-rights-claims_exactly_what_arises_without_formality">
6914
- <p class="thm-label"><strong>Theorem 681</strong> (<code>claims_exactly_what_arises_without_formality</code>)<a class="thm-cite" href="/theorem/lean_rights_claims_exactly_what_arises_without_formality">sealed</a>.</p>
7021
+ <p class="thm-label"><strong>Theorem 696</strong> (<code>claims_exactly_what_arises_without_formality</code>)<a class="thm-cite" href="/theorem/lean_rights_claims_exactly_what_arises_without_formality">sealed</a>.</p>
6915
7022
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>r</mi><mo>∈</mo><mi>instruments</mi><mo>,</mo><mrow><mrow><mi>auto</mi><mo>(</mo><mi>r</mi><mo>)</mo></mrow><mo>=</mo><mrow><mi>claim</mi><mo>(</mo><mi>r</mi><mo>)</mo></mrow></mrow></mrow></math></div>
6916
7023
  <pre class="thm-statement"><code>instruments.all (fun r =&gt; auto r == claim r)</code></pre>
6917
7024
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall r \in \mathrm{instruments},\; \mathrm{auto}\mathopen{}\left(r\right) = \mathrm{claim}\mathopen{}\left(r\right)</code></pre></details>
@@ -6920,7 +7027,7 @@ settledHere := 8</code></pre>
6920
7027
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
6921
7028
 
6922
7029
  <div class="thm" id="thm-rights-the_claimed_are_copyright_moral_rights_and_the_database">
6923
- <p class="thm-label"><strong>Theorem 682</strong> (<code>the_claimed_are_copyright_moral_rights_and_the_database</code>)<a class="thm-cite" href="/theorem/lean_rights_the_claimed_are_copyright_moral_rights_and_the_database">sealed</a>.</p>
7030
+ <p class="thm-label"><strong>Theorem 697</strong> (<code>the_claimed_are_copyright_moral_rights_and_the_database</code>)<a class="thm-cite" href="/theorem/lean_rights_the_claimed_are_copyright_moral_rights_and_the_database">sealed</a>.</p>
6924
7031
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>i</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>]</mo></mrow><mo>,</mo><mrow><mi>i</mi><mo>∈</mo><mrow><mi>idOf</mi><mo>[</mo><mrow><mo>{</mo><mi>x</mi><mo>∈</mo><mi>instruments</mi><mo>∣</mo><mi>claim</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>}</mo></mrow><mo>]</mo></mrow></mrow></mrow></math></div>
6925
7032
  <pre class="thm-statement"><code>([1, 2, 3] : List Nat).all (fun i =&gt; ((instruments.filter claim).map idOf).contains i)</code></pre>
6926
7033
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall i \in [1,\,2,\,3],\; i \in \mathrm{idOf}[\{\, x \in \mathrm{instruments} \mid \mathrm{claim}\mathopen{}\left(x\right) \,\}]</code></pre></details>
@@ -6929,7 +7036,7 @@ settledHere := 8</code></pre>
6929
7036
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
6930
7037
 
6931
7038
  <div class="thm" id="thm-rights-the_claimed_set_is_exactly_those_three_and_the_unregistered_mark">
6932
- <p class="thm-label"><strong>Theorem 683</strong> (<code>the_claimed_set_is_exactly_those_three_and_the_unregistered_mark</code>)<a class="thm-cite" href="/theorem/lean_rights_the_claimed_set_is_exactly_those_three_and_the_unregistered_mark">sealed</a>.</p>
7039
+ <p class="thm-label"><strong>Theorem 698</strong> (<code>the_claimed_set_is_exactly_those_three_and_the_unregistered_mark</code>)<a class="thm-cite" href="/theorem/lean_rights_the_claimed_set_is_exactly_those_three_and_the_unregistered_mark">sealed</a>.</p>
6933
7040
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>i</mi><mo>∈</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow><mo>,</mo><mrow><mi>i</mi><mo>∈</mo><mrow><mi>idOf</mi><mo>[</mo><mrow><mo>{</mo><mi>x</mi><mo>∈</mo><mi>instruments</mi><mo>∣</mo><mi>claim</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>}</mo></mrow><mo>]</mo></mrow></mrow></mrow></math></div>
6934
7041
  <pre class="thm-statement"><code>([1, 2, 3, 8] : List Nat).all (fun i =&gt; ((instruments.filter claim).map idOf).contains i)</code></pre>
6935
7042
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall i \in [1,\,2,\,3,\,8],\; i \in \mathrm{idOf}[\{\, x \in \mathrm{instruments} \mid \mathrm{claim}\mathopen{}\left(x\right) \,\}]</code></pre></details>
@@ -6938,7 +7045,7 @@ settledHere := 8</code></pre>
6938
7045
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 4 cases. <span class="qed">□</span></p>
6939
7046
 
6940
7047
  <div class="thm" id="thm-rights-the_unclaimed_are_the_registry_the_excluded_and_the_unownable">
6941
- <p class="thm-label"><strong>Theorem 684</strong> (<code>the_unclaimed_are_the_registry_the_excluded_and_the_unownable</code>)<a class="thm-cite" href="/theorem/lean_rights_the_unclaimed_are_the_registry_the_excluded_and_the_unownable">sealed</a>.</p>
7048
+ <p class="thm-label"><strong>Theorem 699</strong> (<code>the_unclaimed_are_the_registry_the_excluded_and_the_unownable</code>)<a class="thm-cite" href="/theorem/lean_rights_the_unclaimed_are_the_registry_the_excluded_and_the_unownable">sealed</a>.</p>
6942
7049
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mi>idOf</mi><mo>[</mo><mrow><mo>{</mo><mi>r</mi><mo>∈</mo><mi>instruments</mi><mo>∣</mo><mrow><mo>¬</mo><mrow><mi>claim</mi><mo>(</mo><mi>r</mi><mo>)</mo></mrow></mrow><mo>}</mo></mrow><mo>]</mo></mrow><mo>=</mo><mrow><mo>[</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>]</mo></mrow></mrow></math></div>
6943
7050
  <pre class="thm-statement"><code>(instruments.filter (fun r =&gt; ¬ claim r)).map idOf = [4, 5, 6, 7]</code></pre>
6944
7051
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\mathrm{idOf}[\{\, r \in \mathrm{instruments} \mid \lnot \mathrm{claim}\mathopen{}\left(r\right) \,\}] = [4,\,5,\,6,\,7]</code></pre></details>
@@ -6946,7 +7053,7 @@ settledHere := 8</code></pre>
6946
7053
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 4 cases. <span class="qed">□</span></p>
6947
7054
 
6948
7055
  <div class="thm" id="thm-rights-no_right_that_needs_a_registry_act_is_claimed">
6949
- <p class="thm-label"><strong>Theorem 685</strong> (<code>no_right_that_needs_a_registry_act_is_claimed</code>)<a class="thm-cite" href="/theorem/lean_rights_no_right_that_needs_a_registry_act_is_claimed">sealed</a>.</p>
7056
+ <p class="thm-label"><strong>Theorem 700</strong> (<code>no_right_that_needs_a_registry_act_is_claimed</code>)<a class="thm-cite" href="/theorem/lean_rights_no_right_that_needs_a_registry_act_is_claimed">sealed</a>.</p>
6950
7057
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>r</mi><mo>∈</mo><mrow><mo>{</mo><mi>r</mi><mo>∈</mo><mi>instruments</mi><mo>∣</mo><mrow><mrow><mi>kindOf</mi><mo>(</mo><mi>r</mi><mo>)</mo></mrow><mo>=</mo><mn>1</mn></mrow><mo>}</mo></mrow><mo>,</mo><mrow><mrow><mi>claim</mi><mo>(</mo><mi>r</mi><mo>)</mo></mrow><mo>=</mo><mi>false</mi></mrow></mrow></math></div>
6951
7058
  <pre class="thm-statement"><code>(instruments.filter (fun r =&gt; kindOf r == 1)).all (fun r =&gt; claim r == false)</code></pre>
6952
7059
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall r \in \{\, r \in \mathrm{instruments} \mid \mathrm{kindOf}\mathopen{}\left(r\right) = 1 \,\},\; \mathrm{claim}\mathopen{}\left(r\right) = \mathrm{false}</code></pre></details>
@@ -6955,7 +7062,7 @@ settledHere := 8</code></pre>
6955
7062
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
6956
7063
 
6957
7064
  <div class="thm" id="thm-rights-no_excluded_subject_matter_is_claimed">
6958
- <p class="thm-label"><strong>Theorem 686</strong> (<code>no_excluded_subject_matter_is_claimed</code>)<a class="thm-cite" href="/theorem/lean_rights_no_excluded_subject_matter_is_claimed">sealed</a>.</p>
7065
+ <p class="thm-label"><strong>Theorem 701</strong> (<code>no_excluded_subject_matter_is_claimed</code>)<a class="thm-cite" href="/theorem/lean_rights_no_excluded_subject_matter_is_claimed">sealed</a>.</p>
6959
7066
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>r</mi><mo>∈</mo><mrow><mo>{</mo><mi>r</mi><mo>∈</mo><mi>instruments</mi><mo>∣</mo><mrow><mrow><mi>kindOf</mi><mo>(</mo><mi>r</mi><mo>)</mo></mrow><mo>=</mo><mn>2</mn></mrow><mo>}</mo></mrow><mo>,</mo><mrow><mrow><mi>claim</mi><mo>(</mo><mi>r</mi><mo>)</mo></mrow><mo>=</mo><mi>false</mi></mrow></mrow></math></div>
6960
7067
  <pre class="thm-statement"><code>(instruments.filter (fun r =&gt; kindOf r == 2)).all (fun r =&gt; claim r == false)</code></pre>
6961
7068
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall r \in \{\, r \in \mathrm{instruments} \mid \mathrm{kindOf}\mathopen{}\left(r\right) = 2 \,\},\; \mathrm{claim}\mathopen{}\left(r\right) = \mathrm{false}</code></pre></details>
@@ -6963,7 +7070,7 @@ settledHere := 8</code></pre>
6963
7070
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
6964
7071
 
6965
7072
  <div class="thm" id="thm-rights-nothing_incapable_of_ownership_is_claimed">
6966
- <p class="thm-label"><strong>Theorem 687</strong> (<code>nothing_incapable_of_ownership_is_claimed</code>)<a class="thm-cite" href="/theorem/lean_rights_nothing_incapable_of_ownership_is_claimed">sealed</a>.</p>
7073
+ <p class="thm-label"><strong>Theorem 702</strong> (<code>nothing_incapable_of_ownership_is_claimed</code>)<a class="thm-cite" href="/theorem/lean_rights_nothing_incapable_of_ownership_is_claimed">sealed</a>.</p>
6967
7074
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>r</mi><mo>∈</mo><mrow><mo>{</mo><mi>r</mi><mo>∈</mo><mi>instruments</mi><mo>∣</mo><mrow><mrow><mi>kindOf</mi><mo>(</mo><mi>r</mi><mo>)</mo></mrow><mo>=</mo><mn>3</mn></mrow><mo>}</mo></mrow><mo>,</mo><mrow><mrow><mi>claim</mi><mo>(</mo><mi>r</mi><mo>)</mo></mrow><mo>=</mo><mi>false</mi></mrow></mrow></math></div>
6968
7075
  <pre class="thm-statement"><code>(instruments.filter (fun r =&gt; kindOf r == 3)).all (fun r =&gt; claim r == false)</code></pre>
6969
7076
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall r \in \{\, r \in \mathrm{instruments} \mid \mathrm{kindOf}\mathopen{}\left(r\right) = 3 \,\},\; \mathrm{claim}\mathopen{}\left(r\right) = \mathrm{false}</code></pre></details>
@@ -6971,7 +7078,7 @@ settledHere := 8</code></pre>
6971
7078
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
6972
7079
 
6973
7080
  <div class="thm" id="thm-rights-the_enumeration_is_complete_and_unduplicated">
6974
- <p class="thm-label"><strong>Theorem 688</strong> (<code>the_enumeration_is_complete_and_unduplicated</code>)<a class="thm-cite" href="/theorem/lean_rights_the_enumeration_is_complete_and_unduplicated">sealed</a>.</p>
7081
+ <p class="thm-label"><strong>Theorem 703</strong> (<code>the_enumeration_is_complete_and_unduplicated</code>)<a class="thm-cite" href="/theorem/lean_rights_the_enumeration_is_complete_and_unduplicated">sealed</a>.</p>
6975
7082
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mi>idOf</mi><mo>[</mo><mi>instruments</mi><mo>]</mo></mrow><mo>=</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>9</mn><mo>]</mo></mrow></mrow></math></div>
6976
7083
  <pre class="thm-statement"><code>instruments.map idOf = [1, 2, 3, 4, 5, 6, 7, 8, 9]</code></pre>
6977
7084
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\mathrm{idOf}[\mathrm{instruments}] = [1,\,2,\,3,\,4,\,5,\,6,\,7,\,8,\,9]</code></pre></details>
@@ -6980,7 +7087,7 @@ settledHere := 8</code></pre>
6980
7087
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
6981
7088
 
6982
7089
  <div class="thm" id="thm-rights-rights_settles_its_range">
6983
- <p class="thm-label"><strong>Theorem 689</strong> (<code>rights_settles_its_range</code>)<span class="thm-uncited">not sealed — settled by <code>rfl</code>, not exhausted</span>.</p>
7090
+ <p class="thm-label"><strong>Theorem 704</strong> (<code>rights_settles_its_range</code>)<span class="thm-uncited">not sealed — settled by <code>rfl</code>, not exhausted</span>.</p>
6984
7091
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mi>settledHere</mi><mo>=</mo><mn>8</mn></mrow></math></div>
6985
7092
  <pre class="thm-statement"><code>settledHere = 8</code></pre>
6986
7093
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\mathrm{settledHere} = 8</code></pre></details>
@@ -7011,7 +7118,7 @@ whole stated domain. That was the gap, and closing it is arithmetic.
7011
7118
  triad := [3, 6, 9]</code></pre>
7012
7119
 
7013
7120
  <div class="thm" id="thm-recovered-units_sum_zero">
7014
- <p class="thm-label"><strong>Theorem 690</strong> (<code>units_sum_zero</code>)<a class="thm-cite" href="/theorem/lean_recovered_units_sum_zero">sealed</a>.</p>
7121
+ <p class="thm-label"><strong>Theorem 705</strong> (<code>units_sum_zero</code>)<a class="thm-cite" href="/theorem/lean_recovered_units_sum_zero">sealed</a>.</p>
7015
7122
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mrow><mo>∑</mo><mi>units</mi></mrow><mo>=</mo><mn>27</mn></mrow><mo>∧</mo><mrow><mrow><mrow><mo>∑</mo><mi>units</mi></mrow><mo>mod</mo><mn>9</mn></mrow><mo>=</mo><mn>0</mn></mrow></mrow></math></div>
7016
7123
  <pre class="thm-statement"><code>(units.foldl (· + ·) 0) = 27 ∧ (units.foldl (· + ·) 0) % 9 = 0</code></pre>
7017
7124
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\sum \mathrm{units} = 27 \land \sum \mathrm{units} \bmod 9 = 0</code></pre></details>
@@ -7019,7 +7126,7 @@ triad := [3, 6, 9]</code></pre>
7019
7126
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
7020
7127
 
7021
7128
  <div class="thm" id="thm-recovered-self_inverse_1_8">
7022
- <p class="thm-label"><strong>Theorem 691</strong> (<code>self_inverse_1_8</code>)<a class="thm-cite" href="/theorem/lean_recovered_self_inverse_1_8">sealed</a>.</p>
7129
+ <p class="thm-label"><strong>Theorem 706</strong> (<code>self_inverse_1_8</code>)<a class="thm-cite" href="/theorem/lean_recovered_self_inverse_1_8">sealed</a>.</p>
7023
7130
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>{</mo><mi>d</mi><mo>∈</mo><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>8</mn><mo>}</mo></mrow><mo>∣</mo><mrow><mrow><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>mod</mo><mn>9</mn></mrow><mo>=</mo><mn>1</mn></mrow><mo>}</mo></mrow><mo>=</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>8</mn><mo>]</mo></mrow></mrow></math></div>
7024
7131
  <pre class="thm-statement"><code>((List.range 9).filter (fun d =&gt; d * d % 9 == 1)) = [1, 8]</code></pre>
7025
7132
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\{\, d \in \{0,\dots,8\} \mid d \cdot d \bmod 9 = 1 \,\} = [1,\,8]</code></pre></details>
@@ -7027,7 +7134,7 @@ triad := [3, 6, 9]</code></pre>
7027
7134
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 18 cases. <span class="qed">□</span></p>
7028
7135
 
7029
7136
  <div class="thm" id="thm-recovered-triad_nilpotent">
7030
- <p class="thm-label"><strong>Theorem 692</strong> (<code>triad_nilpotent</code>)<a class="thm-cite" href="/theorem/lean_recovered_triad_nilpotent">sealed</a>.</p>
7137
+ <p class="thm-label"><strong>Theorem 707</strong> (<code>triad_nilpotent</code>)<a class="thm-cite" href="/theorem/lean_recovered_triad_nilpotent">sealed</a>.</p>
7031
7138
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>d</mi><mo>∈</mo><mi>triad</mi><mo>,</mo><mrow><mrow><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>mod</mo><mn>9</mn></mrow><mo>=</mo><mn>0</mn></mrow></mrow></math></div>
7032
7139
  <pre class="thm-statement"><code>triad.all (fun d =&gt; d * d % 9 == 0)</code></pre>
7033
7140
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in \mathrm{triad},\; d \cdot d \bmod 9 = 0</code></pre></details>
@@ -7035,7 +7142,7 @@ triad := [3, 6, 9]</code></pre>
7035
7142
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
7036
7143
 
7037
7144
  <div class="thm" id="thm-recovered-triad_sum_zero">
7038
- <p class="thm-label"><strong>Theorem 693</strong> (<code>triad_sum_zero</code>)<a class="thm-cite" href="/theorem/lean_recovered_triad_sum_zero">sealed</a>.</p>
7145
+ <p class="thm-label"><strong>Theorem 708</strong> (<code>triad_sum_zero</code>)<a class="thm-cite" href="/theorem/lean_recovered_triad_sum_zero">sealed</a>.</p>
7039
7146
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mrow><mo>∑</mo><mi>triad</mi></mrow><mo>=</mo><mn>18</mn></mrow><mo>∧</mo><mrow><mrow><mrow><mo>∑</mo><mi>triad</mi></mrow><mo>mod</mo><mn>9</mn></mrow><mo>=</mo><mn>0</mn></mrow></mrow></math></div>
7040
7147
  <pre class="thm-statement"><code>(triad.foldl (· + ·) 0) = 18 ∧ (triad.foldl (· + ·) 0) % 9 = 0</code></pre>
7041
7148
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\sum \mathrm{triad} = 18 \land \sum \mathrm{triad} \bmod 9 = 0</code></pre></details>
@@ -7043,7 +7150,7 @@ triad := [3, 6, 9]</code></pre>
7043
7150
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
7044
7151
 
7045
7152
  <div class="thm" id="thm-recovered-units_product_neg1">
7046
- <p class="thm-label"><strong>Theorem 694</strong> (<code>units_product_neg1</code>)<a class="thm-cite" href="/theorem/lean_recovered_units_product_neg1">sealed</a>.</p>
7153
+ <p class="thm-label"><strong>Theorem 709</strong> (<code>units_product_neg1</code>)<a class="thm-cite" href="/theorem/lean_recovered_units_product_neg1">sealed</a>.</p>
7047
7154
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mrow><mi>fold</mi><mo>(</mo><mrow><mo>(</mo><mo>·</mo><mo>⋅</mo><mo>·</mo><mo>)</mo></mrow><mo>,</mo><mi>units</mi><mo>,</mo><mn>1</mn><mo>)</mo></mrow><mo>mod</mo><mn>9</mn></mrow><mo>=</mo><mn>8</mn></mrow></math></div>
7048
7155
  <pre class="thm-statement"><code>(units.foldl (· * ·) 1) % 9 = 8</code></pre>
7049
7156
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\operatorname{fold}_{(\cdot\,\cdot\,\cdot)}\left(\mathrm{units},\, 1\right) \bmod 9 = 8</code></pre></details>
@@ -7051,7 +7158,7 @@ triad := [3, 6, 9]</code></pre>
7051
7158
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
7052
7159
 
7053
7160
  <div class="thm" id="thm-recovered-order_of_2_is_6">
7054
- <p class="thm-label"><strong>Theorem 695</strong> (<code>order_of_2_is_6</code>)<a class="thm-cite" href="/theorem/lean_recovered_order_of_2_is_6">sealed</a>.</p>
7161
+ <p class="thm-label"><strong>Theorem 710</strong> (<code>order_of_2_is_6</code>)<a class="thm-cite" href="/theorem/lean_recovered_order_of_2_is_6">sealed</a>.</p>
7055
7162
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mrow><mi>pow9</mi><mo>(</mo><mn>2</mn><mo>,</mo><mn>6</mn><mo>)</mo></mrow><mo>=</mo><mn>1</mn></mrow><mo>∧</mo><mrow><mo>∀</mo><mi>k</mi><mo>∈</mo><mrow><mo>{</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>5</mn><mo>}</mo></mrow><mo>,</mo><mrow><mrow><mi>pow9</mi><mo>(</mo><mn>2</mn><mo>,</mo><mi>k</mi><mo>)</mo></mrow><mo>≠</mo><mn>1</mn></mrow></mrow></mrow></math></div>
7056
7163
  <pre class="thm-statement"><code>pow9 2 6 = 1 ∧ ((List.range' 1 5).all (fun k =&gt; pow9 2 k != 1))</code></pre>
7057
7164
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\mathrm{pow9}\mathopen{}\left(2,\,6\right) = 1 \land \forall k \in \{1,\dots,5\},\; \mathrm{pow9}\mathopen{}\left(2,\,k\right) \neq 1</code></pre></details>
@@ -7059,7 +7166,7 @@ triad := [3, 6, 9]</code></pre>
7059
7166
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 5 cases. <span class="qed">□</span></p>
7060
7167
 
7061
7168
  <div class="thm" id="thm-recovered-sum_1_to_9_zero">
7062
- <p class="thm-label"><strong>Theorem 696</strong> (<code>sum_1_to_9_zero</code>)<a class="thm-cite" href="/theorem/lean_recovered_sum_1_to_9_zero">sealed</a>.</p>
7169
+ <p class="thm-label"><strong>Theorem 711</strong> (<code>sum_1_to_9_zero</code>)<a class="thm-cite" href="/theorem/lean_recovered_sum_1_to_9_zero">sealed</a>.</p>
7063
7170
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mrow><mo>∑</mo><mrow><mo>{</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>9</mn><mo>}</mo></mrow></mrow><mo>=</mo><mn>45</mn></mrow><mo>∧</mo><mrow><mrow><mrow><mo>∑</mo><mrow><mo>{</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>9</mn><mo>}</mo></mrow></mrow><mo>mod</mo><mn>9</mn></mrow><mo>=</mo><mn>0</mn></mrow></mrow></math></div>
7064
7171
  <pre class="thm-statement"><code>((List.range' 1 9).foldl (· + ·) 0) = 45 ∧ ((List.range' 1 9).foldl (· + ·) 0) % 9 = 0</code></pre>
7065
7172
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\sum \{1,\dots,9\} = 45 \land \sum \{1,\dots,9\} \bmod 9 = 0</code></pre></details>
@@ -7067,7 +7174,7 @@ triad := [3, 6, 9]</code></pre>
7067
7174
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 81 cases. <span class="qed">□</span></p>
7068
7175
 
7069
7176
  <div class="thm" id="thm-recovered-doubling_digitroot_period6">
7070
- <p class="thm-label"><strong>Theorem 697</strong> (<code>doubling_digitroot_period6</code>)<a class="thm-cite" href="/theorem/lean_recovered_doubling_digitroot_period6">sealed</a>.</p>
7177
+ <p class="thm-label"><strong>Theorem 712</strong> (<code>doubling_digitroot_period6</code>)<a class="thm-cite" href="/theorem/lean_recovered_doubling_digitroot_period6">sealed</a>.</p>
7071
7178
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mrow><mo>{</mo><mrow><mi>pow9</mi><mo>(</mo><mn>2</mn><mo>,</mo><mi>k</mi><mo>)</mo></mrow><mo>∣</mo><mi>k</mi><mo>∈</mo><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>5</mn><mo>}</mo></mrow><mo>}</mo></mrow><mo>=</mo><mrow><mo>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>5</mn><mo>]</mo></mrow></mrow><mo>∧</mo><mrow><mrow><mi>pow9</mi><mo>(</mo><mn>2</mn><mo>,</mo><mn>6</mn><mo>)</mo></mrow><mo>=</mo><mrow><mi>pow9</mi><mo>(</mo><mn>2</mn><mo>,</mo><mn>0</mn><mo>)</mo></mrow></mrow></mrow></math></div>
7072
7179
  <pre class="thm-statement"><code>((List.range 6).map (fun k =&gt; pow9 2 k)) = [1, 2, 4, 8, 7, 5] ∧ pow9 2 6 = pow9 2 0</code></pre>
7073
7180
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\{\, \mathrm{pow9}\mathopen{}\left(2,\,k\right) \mid k \in \{0,\dots,5\} \,\} = [1,\,2,\,4,\,8,\,7,\,5] \land \mathrm{pow9}\mathopen{}\left(2,\,6\right) = \mathrm{pow9}\mathopen{}\left(2,\,0\right)</code></pre></details>
@@ -7075,7 +7182,7 @@ triad := [3, 6, 9]</code></pre>
7075
7182
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 36 cases. <span class="qed">□</span></p>
7076
7183
 
7077
7184
  <div class="thm" id="thm-recovered-unit_exp_id_k6">
7078
- <p class="thm-label"><strong>Theorem 698</strong> (<code>unit_exp_id_k6</code>)<a class="thm-cite" href="/theorem/lean_recovered_unit_exp_id_k6">sealed</a>.</p>
7185
+ <p class="thm-label"><strong>Theorem 713</strong> (<code>unit_exp_id_k6</code>)<a class="thm-cite" href="/theorem/lean_recovered_unit_exp_id_k6">sealed</a>.</p>
7079
7186
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>u</mi><mo>∈</mo><mi>units</mi><mo>,</mo><mrow><mrow><mi>pow9</mi><mo>(</mo><mi>u</mi><mo>,</mo><mn>6</mn><mo>)</mo></mrow><mo>=</mo><mn>1</mn></mrow></mrow></math></div>
7080
7187
  <pre class="thm-statement"><code>units.all (fun u =&gt; pow9 u 6 == 1)</code></pre>
7081
7188
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall u \in \mathrm{units},\; \mathrm{pow9}\mathopen{}\left(u,\,6\right) = 1</code></pre></details>
@@ -7083,7 +7190,7 @@ triad := [3, 6, 9]</code></pre>
7083
7190
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
7084
7191
 
7085
7192
  <div class="thm" id="thm-recovered-unit_exp_id_k12">
7086
- <p class="thm-label"><strong>Theorem 699</strong> (<code>unit_exp_id_k12</code>)<a class="thm-cite" href="/theorem/lean_recovered_unit_exp_id_k12">sealed</a>.</p>
7193
+ <p class="thm-label"><strong>Theorem 714</strong> (<code>unit_exp_id_k12</code>)<a class="thm-cite" href="/theorem/lean_recovered_unit_exp_id_k12">sealed</a>.</p>
7087
7194
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>u</mi><mo>∈</mo><mi>units</mi><mo>,</mo><mrow><mrow><mi>pow9</mi><mo>(</mo><mi>u</mi><mo>,</mo><mn>12</mn><mo>)</mo></mrow><mo>=</mo><mn>1</mn></mrow></mrow></math></div>
7088
7195
  <pre class="thm-statement"><code>units.all (fun u =&gt; pow9 u 12 == 1)</code></pre>
7089
7196
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall u \in \mathrm{units},\; \mathrm{pow9}\mathopen{}\left(u,\,12\right) = 1</code></pre></details>
@@ -7091,7 +7198,7 @@ triad := [3, 6, 9]</code></pre>
7091
7198
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
7092
7199
 
7093
7200
  <div class="thm" id="thm-recovered-unit_exp_id_k18">
7094
- <p class="thm-label"><strong>Theorem 700</strong> (<code>unit_exp_id_k18</code>)<a class="thm-cite" href="/theorem/lean_recovered_unit_exp_id_k18">sealed</a>.</p>
7201
+ <p class="thm-label"><strong>Theorem 715</strong> (<code>unit_exp_id_k18</code>)<a class="thm-cite" href="/theorem/lean_recovered_unit_exp_id_k18">sealed</a>.</p>
7095
7202
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∀</mo><mi>u</mi><mo>∈</mo><mi>units</mi><mo>,</mo><mrow><mrow><mi>pow9</mi><mo>(</mo><mi>u</mi><mo>,</mo><mn>18</mn><mo>)</mo></mrow><mo>=</mo><mn>1</mn></mrow></mrow></math></div>
7096
7203
  <pre class="thm-statement"><code>units.all (fun u =&gt; pow9 u 18 == 1)</code></pre>
7097
7204
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall u \in \mathrm{units},\; \mathrm{pow9}\mathopen{}\left(u,\,18\right) = 1</code></pre></details>
@@ -7099,7 +7206,7 @@ triad := [3, 6, 9]</code></pre>
7099
7206
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
7100
7207
 
7101
7208
  <div class="thm" id="thm-recovered-powperm_k5">
7102
- <p class="thm-label"><strong>Theorem 701</strong> (<code>powperm_k5</code>)<a class="thm-cite" href="/theorem/lean_recovered_powperm_k5">sealed</a>.</p>
7209
+ <p class="thm-label"><strong>Theorem 716</strong> (<code>powperm_k5</code>)<a class="thm-cite" href="/theorem/lean_recovered_powperm_k5">sealed</a>.</p>
7103
7210
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>pow9</mi><mo>(</mo><mi>u</mi><mo>,</mo><mn>5</mn><mo>)</mo></mrow><mo>∣</mo><mi>u</mi><mo>∈</mo><mi>units</mi><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>6</mn></mrow></math></div>
7104
7211
  <pre class="thm-statement"><code>(units.map (fun u =&gt; pow9 u 5)).eraseDups.length = 6</code></pre>
7105
7212
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\operatorname{dedup}\left(\{\, \mathrm{pow9}\mathopen{}\left(u,\,5\right) \mid u \in \mathrm{units} \,\}\right)\right| = 6</code></pre></details>
@@ -7107,7 +7214,7 @@ triad := [3, 6, 9]</code></pre>
7107
7214
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
7108
7215
 
7109
7216
  <div class="thm" id="thm-recovered-powperm_k7">
7110
- <p class="thm-label"><strong>Theorem 702</strong> (<code>powperm_k7</code>)<a class="thm-cite" href="/theorem/lean_recovered_powperm_k7">sealed</a>.</p>
7217
+ <p class="thm-label"><strong>Theorem 717</strong> (<code>powperm_k7</code>)<a class="thm-cite" href="/theorem/lean_recovered_powperm_k7">sealed</a>.</p>
7111
7218
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mrow><mo>|</mo><mrow><mi>dedup</mi><mo>(</mo><mrow><mo>{</mo><mrow><mi>pow9</mi><mo>(</mo><mi>u</mi><mo>,</mo><mn>7</mn><mo>)</mo></mrow><mo>∣</mo><mi>u</mi><mo>∈</mo><mi>units</mi><mo>}</mo></mrow><mo>)</mo></mrow><mo>|</mo></mrow><mo>=</mo><mn>6</mn></mrow></math></div>
7112
7219
  <pre class="thm-statement"><code>(units.map (fun u =&gt; pow9 u 7)).eraseDups.length = 6</code></pre>
7113
7220
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\operatorname{dedup}\left(\{\, \mathrm{pow9}\mathopen{}\left(u,\,7\right) \mid u \in \mathrm{units} \,\}\right)\right| = 6</code></pre></details>
@@ -7115,7 +7222,7 @@ triad := [3, 6, 9]</code></pre>
7115
7222
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
7116
7223
 
7117
7224
  <div class="thm" id="thm-recovered-qr_u1">
7118
- <p class="thm-label"><strong>Theorem 703</strong> (<code>qr_u1</code>)<a class="thm-cite" href="/theorem/lean_recovered_qr_u1">sealed</a>.</p>
7225
+ <p class="thm-label"><strong>Theorem 718</strong> (<code>qr_u1</code>)<a class="thm-cite" href="/theorem/lean_recovered_qr_u1">sealed</a>.</p>
7119
7226
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∃</mo><mi>d</mi><mo>∈</mo><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>8</mn><mo>}</mo></mrow><mo>:</mo><mrow><mrow><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>mod</mo><mn>9</mn></mrow><mo>=</mo><mn>1</mn></mrow></mrow></math></div>
7120
7227
  <pre class="thm-statement"><code>(List.range 9).any (fun d =&gt; d * d % 9 == 1)</code></pre>
7121
7228
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\exists d \in \{0,\dots,8\} : d \cdot d \bmod 9 = 1</code></pre></details>
@@ -7123,7 +7230,7 @@ triad := [3, 6, 9]</code></pre>
7123
7230
  <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
7124
7231
 
7125
7232
  <div class="thm" id="thm-recovered-qr_u4">
7126
- <p class="thm-label"><strong>Theorem 704</strong> (<code>qr_u4</code>)<a class="thm-cite" href="/theorem/lean_recovered_qr_u4">sealed</a>.</p>
7233
+ <p class="thm-label"><strong>Theorem 719</strong> (<code>qr_u4</code>)<a class="thm-cite" href="/theorem/lean_recovered_qr_u4">sealed</a>.</p>
7127
7234
  <div class="thm-math" role="math" aria-label="the statement, typeset"><math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>∃</mo><mi>d</mi><mo>∈</mo><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>8</mn><mo>}</mo></mrow><mo>:</mo><mrow><mrow><mrow><mi>d</mi><mo>⋅</mo><mi>d</mi></mrow><mo>mod</mo><mn>9</mn></mrow><mo>=</mo><mn>4</mn></mrow></mrow></math></div>
7128
7235
  <pre class="thm-statement"><code>(List.range 9).any (fun d =&gt; d * d % 9 == 4)</code></pre>
7129
7236
  <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\exists d \in \{0,\dots,8\} : d \cdot d \bmod 9 = 4</code></pre></details>
@@ -7144,6 +7251,7 @@ triad := [3, 6, 9]</code></pre>
7144
7251
  <a href="#thm-elementary-a_knight_has_exactly_eight_leaps_and_every_one_flips_the_colour"><code>a_knight_has_exactly_eight_leaps_and_every_one_flips_the_colour</code> <span>elementary.lean</span></a>
7145
7252
  <a href="#thm-families-a_number_is_a_sum_of_two_squares_exactly_when_fermats_condition_holds"><code>a_number_is_a_sum_of_two_squares_exactly_when_fermats_condition_holds</code> <span>families.lean</span></a>
7146
7253
  <a href="#thm-reversal-a_number_is_below_ten_to_its_own_successor"><code>a_number_is_below_ten_to_its_own_successor</code> <span>reversal.lean</span></a>
7254
+ <a href="#thm-nim-a_number_xored_with_itself_is_zero_at_every_fuel"><code>a_number_xored_with_itself_is_zero_at_every_fuel</code> <span>nim.lean</span></a>
7147
7255
  <a href="#thm-energy-a_part_and_its_rest_read_back_the_whole"><code>a_part_and_its_rest_read_back_the_whole</code> <span>energy.lean</span></a>
7148
7256
  <a href="#thm-elementary-a_product_of_consecutive_numbers_is_even"><code>a_product_of_consecutive_numbers_is_even</code> <span>elementary.lean</span></a>
7149
7257
  <a href="#thm-ledgerclaims-a_proof_is_smaller_than_its_set_across_the_octave"><code>a_proof_is_smaller_than_its_set_across_the_octave</code> <span>ledgerclaims.lean</span></a>
@@ -7379,6 +7487,7 @@ triad := [3, 6, 9]</code></pre>
7379
7487
  <a href="#thm-mechanical-merkaba_cube_q3"><code>merkaba_cube_q3</code> <span>mechanical.lean</span></a>
7380
7488
  <a href="#thm-merkle-merkle_settles_its_range"><code>merkle_settles_its_range</code> <span>merkle.lean</span></a>
7381
7489
  <a href="#thm-mechanical-midy_the_two_halves_of_142857_sum_to_nines"><code>midy_the_two_halves_of_142857_sum_to_nines</code> <span>mechanical.lean</span></a>
7490
+ <a href="#thm-nim-more_fuel_changes_nothing_once_it_exceeds_an_argument"><code>more_fuel_changes_nothing_once_it_exceeds_an_argument</code> <span>nim.lean</span></a>
7382
7491
  <a href="#thm-ledgerclaims-more_payloads_than_addresses_must_collide"><code>more_payloads_than_addresses_must_collide</code> <span>ledgerclaims.lean</span></a>
7383
7492
  <a href="#thm-generated-mulperm_fails_at_the_triad"><code>mulperm_fails_at_the_triad</code> <span>generated.lean</span></a>
7384
7493
  <a href="#thm-z9-mulperm_iff_unit"><code>mulperm_iff_unit</code> <span>z9.lean</span></a>
@@ -7412,6 +7521,7 @@ triad := [3, 6, 9]</code></pre>
7412
7521
  <a href="#thm-demand3-odd_divisor_count_iff_perfect_square"><code>odd_divisor_count_iff_perfect_square</code> <span>demand3.lean</span></a>
7413
7522
  <a href="#thm-coin-on_the_fixed_points_the_reflection_never_leaves"><code>on_the_fixed_points_the_reflection_never_leaves</code> <span>coin.lean</span></a>
7414
7523
  <a href="#thm-energy-one_litre_split_returns_one_litre_burnt"><code>one_litre_split_returns_one_litre_burnt</code> <span>energy.lean</span></a>
7524
+ <a href="#thm-nim-one_more_step_of_fuel_changes_nothing_once_it_exceeds_an_argument"><code>one_more_step_of_fuel_changes_nothing_once_it_exceeds_an_argument</code> <span>nim.lean</span></a>
7415
7525
  <a href="#thm-coin-one_side_is_reflected_onto_itself"><code>one_side_is_reflected_onto_itself</code> <span>coin.lean</span></a>
7416
7526
  <a href="#thm-merkaba-one_tetrahedron_covers_half_the_units"><code>one_tetrahedron_covers_half_the_units</code> <span>merkaba.lean</span></a>
7417
7527
  <a href="#thm-energy-only_oxy_hydrogen_burns_without_admitting_nitrogen"><code>only_oxy_hydrogen_burns_without_admitting_nitrogen</code> <span>energy.lean</span></a>
@@ -7668,6 +7778,7 @@ triad := [3, 6, 9]</code></pre>
7668
7778
  <a href="#thm-mechanical-the_more_developed_the_more_cross_domain_reach"><code>the_more_developed_the_more_cross_domain_reach</code> <span>mechanical.lean</span></a>
7669
7779
  <a href="#thm-elementary-the_multiplication_table_of_the_z9_units_is_a_latin_square"><code>the_multiplication_table_of_the_z9_units_is_a_latin_square</code> <span>elementary.lean</span></a>
7670
7780
  <a href="#thm-nim-the_nim_sum_is_a_gf2_vector_addition"><code>the_nim_sum_is_a_gf2_vector_addition</code> <span>nim.lean</span></a>
7781
+ <a href="#thm-nim-the_nim_sum_is_a_gf2_vector_addition_for_every_a_b_c"><code>the_nim_sum_is_a_gf2_vector_addition_for_every_a_b_c</code> <span>nim.lean</span></a>
7671
7782
  <a href="#thm-mechanical-the_nine_times_table_always_digital_roots_to_nine"><code>the_nine_times_table_always_digital_roots_to_nine</code> <span>mechanical.lean</span></a>
7672
7783
  <a href="#thm-mechanical-the_nine_times_table_always_digital_roots_to_nine_for_every_k"><code>the_nine_times_table_always_digital_roots_to_nine_for_every_k</code> <span>mechanical.lean</span></a>
7673
7784
  <a href="#thm-coin-the_nines_complement_pairs_the_ten_digits"><code>the_nines_complement_pairs_the_ten_digits</code> <span>coin.lean</span></a>
@@ -7754,6 +7865,7 @@ triad := [3, 6, 9]</code></pre>
7754
7865
  <a href="#thm-elementary-the_whole_ring_is_not_regular_and_the_triad_is_why"><code>the_whole_ring_is_not_regular_and_the_triad_is_why</code> <span>elementary.lean</span></a>
7755
7866
  <a href="#thm-speed-the_width_is_the_ceiling_of_128_bits_over_the_symbol"><code>the_width_is_the_ceiling_of_128_bits_over_the_symbol</code> <span>speed.lean</span></a>
7756
7867
  <a href="#thm-elementary-the_wythoff_sequences_partition_the_integers"><code>the_wythoff_sequences_partition_the_integers</code> <span>elementary.lean</span></a>
7868
+ <a href="#thm-nim-the_xor_of_two_bits_is_their_sum_mod_two"><code>the_xor_of_two_bits_is_their_sum_mod_two</code> <span>nim.lean</span></a>
7757
7869
  <a href="#thm-elementary-the_z9_unit_group_splits_as_reflection_times_trinity"><code>the_z9_unit_group_splits_as_reflection_times_trinity</code> <span>elementary.lean</span></a>
7758
7870
  <a href="#thm-involution-there_are_2620_involutions_of_nine"><code>there_are_2620_involutions_of_nine</code> <span>involution.lean</span></a>
7759
7871
  <a href="#thm-families-there_are_exactly_five_platonic_solids_and_each_satisfies_eulers_formula"><code>there_are_exactly_five_platonic_solids_and_each_satisfies_eulers_formula</code> <span>families.lean</span></a>
@@ -7831,10 +7943,20 @@ triad := [3, 6, 9]</code></pre>
7831
7943
  <a href="#thm-families-wilson_all_primes_under_thirty"><code>wilson_all_primes_under_thirty</code> <span>families.lean</span></a>
7832
7944
  <a href="#thm-families-wilson_fails_at_composites"><code>wilson_fails_at_composites</code> <span>families.lean</span></a>
7833
7945
  <a href="#thm-demand3-wilsons_theorem_and_its_converse"><code>wilsons_theorem_and_its_converse</code> <span>demand3.lean</span></a>
7946
+ <a href="#thm-nim-xor_commutes_at_every_fuel"><code>xor_commutes_at_every_fuel</code> <span>nim.lean</span></a>
7947
+ <a href="#thm-nim-xor_is_associative_below_every_bound"><code>xor_is_associative_below_every_bound</code> <span>nim.lean</span></a>
7948
+ <a href="#thm-nim-xor_is_associative_for_every_a_b_c"><code>xor_is_associative_for_every_a_b_c</code> <span>nim.lean</span></a>
7834
7949
  <a href="#thm-nim-xor_is_commutative"><code>xor_is_commutative</code> <span>nim.lean</span></a>
7950
+ <a href="#thm-nim-xor_is_commutative_for_every_a_b"><code>xor_is_commutative_for_every_a_b</code> <span>nim.lean</span></a>
7835
7951
  <a href="#thm-nim-xor_is_its_own_inverse"><code>xor_is_its_own_inverse</code> <span>nim.lean</span></a>
7952
+ <a href="#thm-nim-xor_is_its_own_inverse_for_every_a_b"><code>xor_is_its_own_inverse_for_every_a_b</code> <span>nim.lean</span></a>
7836
7953
  <a href="#thm-families-xor_is_parity_up_to_eight_bits"><code>xor_is_parity_up_to_eight_bits</code> <span>families.lean</span></a>
7954
+ <a href="#thm-nim-xor_is_the_sum_of_the_bits_plus_twice_the_xor_of_the_halves"><code>xor_is_the_sum_of_the_bits_plus_twice_the_xor_of_the_halves</code> <span>nim.lean</span></a>
7955
+ <a href="#thm-nim-xor_reads_the_same_at_every_sufficient_fuel"><code>xor_reads_the_same_at_every_sufficient_fuel</code> <span>nim.lean</span></a>
7956
+ <a href="#thm-nim-xor_splits_off_its_lowest_bit"><code>xor_splits_off_its_lowest_bit</code> <span>nim.lean</span></a>
7957
+ <a href="#thm-nim-xor_undoes_itself_when_the_fuel_suffices"><code>xor_undoes_itself_when_the_fuel_suffices</code> <span>nim.lean</span></a>
7837
7958
  <a href="#thm-nim-xor_zero_is_identity"><code>xor_zero_is_identity</code> <span>nim.lean</span></a>
7959
+ <a href="#thm-nim-xor_zero_is_identity_for_every_a"><code>xor_zero_is_identity_for_every_a</code> <span>nim.lean</span></a>
7838
7960
  <a href="#thm-index-yang_mills_spectral_gap"><code>yang_mills_spectral_gap</code> <span>index.lean</span></a>
7839
7961
  <a href="#thm-z9-z9_settles_its_domain_totally"><code>z9_settles_its_domain_totally</code> <span>z9.lean</span></a>
7840
7962
  <a href="#thm-priorart-zero_claims_is_not_full_attribution"><code>zero_claims_is_not_full_attribution</code> <span>priorart.lean</span></a>