Definition in prerequisite notation
∀ pft_index_bottomlayer. Lt(pft_index_bottomlayer,l) → ∃ x. BetaAt(b,c,pft_index_bottomlayer,x) ∧ FpZeroExtendedInv(p,pft_index_bottomlayer,x)Only definitions earlier in this acyclic notation graph are used here.
Hygienic expanded first-order definition
forall pft_index_bottomlayer. (exists pfa_gap_bottomlayerprefix. pfa_gap_bottomlayerprefix + S (pft_index_bottomlayer) = ((l))) -> exists pft_value_bottomlayer. (((((exists ff_h_pft_bottomlayerpointentry. ff_h_pft_bottomlayerpointentry + S (pft_value_bottomlayer) = S ((S (pft_index_bottomlayer)) * (c))) /\ exists ff_q_pft_bottomlayerpointentry. (b) = ff_q_pft_bottomlayerpointentry * S ((S (pft_index_bottomlayer)) * (c)) + (pft_value_bottomlayer))) /\ ((((exists pfa_gap_bottomlayerpointvalueinput. pfa_gap_bottomlayerpointvalueinput + S (pft_index_bottomlayer) = ((p))) /\ (((exists pfa_gap_bottomlayerpointvalueoutput. pfa_gap_bottomlayerpointvalueoutput + S (pft_value_bottomlayer) = ((p))) /\ ((((pft_index_bottomlayer) = 0 /\ (pft_value_bottomlayer) = 0) \/ (((~((pft_index_bottomlayer) = 0)) /\ ((((exists pfa_gap_bottomlayerpointvaluenonzeromultiplicationleft. pfa_gap_bottomlayerpointvaluenonzeromultiplicationleft + S (pft_index_bottomlayer) = ((p))) /\ (((exists pfa_gap_bottomlayerpointvaluenonzeromultiplicationright. pfa_gap_bottomlayerpointvaluenonzeromultiplicationright + S (pft_value_bottomlayer) = ((p))) /\ ((((exists pfa_gap_bottomlayerpointvaluenonzeromultiplicationresultbound. pfa_gap_bottomlayerpointvaluenonzeromultiplicationresultbound + S (1) = ((p))) /\ ((exists pfa_offset_left_bottomlayerpointvaluenonzeromultiplicationresultcongruence pfa_offset_right_bottomlayerpointvaluenonzeromultiplicationresultcongruence. ((pft_index_bottomlayer) * (pft_value_bottomlayer)) + ((p)) * pfa_offset_left_bottomlayerpointvaluenonzeromultiplicationresultcongruence = (1) + ((p)) * pfa_offset_right_bottomlayerpointvaluenonzeromultiplicationresultcongruence)))))))))))))))))))))The unchanged native kernel never receives this surface symbol. Binder-safe expansion produces only its existing first-order syntax.