Definition in prerequisite notation
∀ fom_index_pfp_lowertier. Lt(fom_index_pfp_lowertier,l) → ∃ x. BetaAt(b,c,fom_index_pfp_lowertier,x) ∧ Lt(x,B)
Only definitions earlier in this acyclic notation graph are used here.
Hygienic expanded first-order definition
forall fom_index_pfp_lowertier. (exists fom_gap_pfp_lowertier_index_bound. fom_gap_pfp_lowertier_index_bound + S (fom_index_pfp_lowertier) = (l)) -> exists fom_value_pfp_lowertier. ((((exists fom_beta_height_pfp_lowertier_entry. fom_beta_height_pfp_lowertier_entry + S (fom_value_pfp_lowertier) = S ((S (fom_index_pfp_lowertier)) * (c))) /\ exists fom_beta_quotient_pfp_lowertier_entry. (b) = fom_beta_quotient_pfp_lowertier_entry * S ((S (fom_index_pfp_lowertier)) * (c)) + (fom_value_pfp_lowertier))) /\ (exists fom_gap_pfp_lowertier_value_bound. fom_gap_pfp_lowertier_value_bound + S (fom_value_pfp_lowertier) = (B)))
The unchanged native kernel never receives this surface symbol. Binder-safe expansion produces only its existing first-order syntax.