PD0024 · conservative definition

BoundedPrefix

Every decoded entry below l is itself below l.

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

BoundedPrefix(b,c,l)

Exact expansion

forall fp_i_defined_bounded_prefix. (exists fp_gap_defined_bounded_prefix_index. fp_gap_defined_bounded_prefix_index + S fp_i_defined_bounded_prefix = l) -> exists fp_value_defined_bounded_prefix. ((((exists ff_h_defined_bounded_prefix_entry. ff_h_defined_bounded_prefix_entry + S (fp_value_defined_bounded_prefix) = S ((S (fp_i_defined_bounded_prefix)) * c)) /\ exists ff_q_defined_bounded_prefix_entry. b = ff_q_defined_bounded_prefix_entry * S ((S (fp_i_defined_bounded_prefix)) * c) + (fp_value_defined_bounded_prefix))) /\ (exists fp_gap_defined_bounded_prefix_value. fp_gap_defined_bounded_prefix_value + S fp_value_defined_bounded_prefix = l))

This node is notation, not a theorem, axiom, predicate constant, or kernel rule. The elaboration layer must expand it before proof checking.

Definition neighborhood

Expands using

Used by definitions

none

Used by theorem statements or local proof propositions