ND0373

JordanTupleCongruence(n,b,c,d,e,k)

All paired actual decoded coordinates are congruent modulo n, without imposing a canonical range.

Conservative notation; not a theorem, primitive, or axiom.

Definition in prerequisite notation

∀ jt_index_definition_jordan. ∀ jt_left_definition_jordan. ∀ jt_right_definition_jordan. Lt(jt_index_definition_jordan,k) → BetaAt(b,c,jt_index_definition_jordan,jt_left_definition_jordan) → BetaAt(d,e,jt_index_definition_jordan,jt_right_definition_jordan) → ModEq(n,jt_left_definition_jordan,jt_right_definition_jordan)

Only definitions earlier in this acyclic notation graph are used here.

Hygienic expanded first-order definition
forall jt_index_definition_jordan jt_left_definition_jordan jt_right_definition_jordan. (exists jt_gap_definition_jordanindex. jt_gap_definition_jordanindex+S (jt_index_definition_jordan)=(k)) -> (((exists fs_h_jt_definition_jordanleft. fs_h_jt_definition_jordanleft + S (jt_left_definition_jordan) = S ((S (jt_index_definition_jordan)) * c)) /\ exists fs_q_jt_definition_jordanleft. b = fs_q_jt_definition_jordanleft * S ((S (jt_index_definition_jordan)) * c) + (jt_left_definition_jordan))) -> (((exists fs_h_jt_definition_jordanright. fs_h_jt_definition_jordanright + S (jt_right_definition_jordan) = S ((S (jt_index_definition_jordan)) * e)) /\ exists fs_q_jt_definition_jordanright. d = fs_q_jt_definition_jordanright * S ((S (jt_index_definition_jordan)) * e) + (jt_right_definition_jordan))) -> (exists jt_left_definition_jordanmod jt_right_definition_jordanmod. (jt_left_definition_jordan)+(n)*jt_left_definition_jordanmod=(jt_right_definition_jordan)+(n)*jt_right_definition_jordanmod)

The unchanged native kernel never receives this surface symbol. Binder-safe expansion produces only its existing first-order syntax.

Direct definition dependencies

Definitions depending on this notation

Checked theorems using this definition