Definition in prerequisite notation
∃ dp_inverse. ¬dp_inverse = 0 ∧ (Lt(dp_inverse,m) ∧ BalancedInverse(m,a,dp_inverse))
Only definitions earlier in this acyclic notation graph are used here.
Hygienic expanded first-order definition
exists dp_inverse. (~(dp_inverse = 0) /\ ((exists dp_bound. dp_bound + S dp_inverse = m) /\ (exists dp_u dp_v. (a) * (dp_inverse) + m * dp_u = 1 + m * dp_v)))
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
none