Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved. Exact original first-admission records.
Readable signature
ModEq(m, a, b)Exact expansion
exists u v. a + m * u = b + m * vThis node is conservative notation, not a theorem, axiom, predicate constant, or kernel rule. Its expansion remains in the unchanged first-order language.
Definition neighborhood
Depends on conservative definitions
none
Used by conservative definitions
none
All transitive conservative prerequisites
none
Used by theorem statements or local proof propositions
LU000M lucas_prime_block_digit_congruence LU000N lucas_one_step_division_congruence LU000R lucas_divisible_implies_zero_mod LU000T lucas_prime_row_interior_zero_mod LU000U lucas_pascal_congruence_step LU000W lucas_prime_shift_below_base LU000Z lucas_prime_shift_high_column LU0012 lucas_repeated_prime_shift_below_base LU0014 lucas_low_digit_product_congruence LU001D lucas_modular_backward_product_fold LU001I lucas_multidigit_congruence_from_one_step LU001J lucas_terminating_multidigit_theorem_from_one_step LU001O lucas_multidigit_congruence LU001P lucas_terminating_multidigit_theorem LU001Q lucas_theorem_for_length LU001R lucas_theoremGrand-campaign planning vocabulary
Locate ModEq in the global campaign vocabulary →
Reviewed ModEq corresponds to blueprint ModEq with checked argument positions [0, 1, 2].
The global atlas describes planning vocabulary and does not itself certify a definition or theorem. The reviewed expansion and conservative dependency DAG on this page are the actual family-local reading definitions.