PA008V · theorem

bounded_into_zero

Alpha v34 checked-use theorem · independently closed; not Stable

Every empty beta prefix is bounded into every codomain.

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.

Statement with defined notation

∀ b. ∀ c. ∀ n. ∀ x. Lt(x,0) → ∃ y. BetaAt(b,c,x,y) ∧ Lt(y,n)

Every purple notation token opens its conservative definition. This is a reading surface; the compiler expands the statement before the unchanged kernel checks it.

Definitions used by this theorem

In the theorem statement

PD0002 Lt PD0013 BetaAt

3 occurrences

In local proof propositions

none

0 occurrences

Exact expanded native-PA statement
forall b c n. (forall fom_index_wpoi_zero_bounded. (exists fom_gap_wpoi_zero_bounded_index_bound. fom_gap_wpoi_zero_bounded_index_bound + S (fom_index_wpoi_zero_bounded) = 0) -> exists fom_value_wpoi_zero_bounded. ((((exists fom_beta_height_wpoi_zero_bounded_entry. fom_beta_height_wpoi_zero_bounded_entry + S (fom_value_wpoi_zero_bounded) = S ((S (fom_index_wpoi_zero_bounded)) * c)) /\ exists fom_beta_quotient_wpoi_zero_bounded_entry. b = fom_beta_quotient_wpoi_zero_bounded_entry * S ((S (fom_index_wpoi_zero_bounded)) * c) + (fom_value_wpoi_zero_bounded))) /\ (exists fom_gap_wpoi_zero_bounded_value_bound. fom_gap_wpoi_zero_bounded_value_bound + S (fom_value_wpoi_zero_bounded) = n)))

Proof neighborhood

Direct theorem prerequisites

PA0004 add_eq_zero_right PA0005 succ_ne_zero

Direct theorem dependents

PA008X scaled_pair_order_state_zero PA00AA pair_order_state_zero

Definition-aware tactic body

Only local propositions introduced by have or suffices are compacted. The untrusted compiler re-expands each one before the original tactic script is replayed; defined notation is never accepted by the kernel. Open the exact replay line beneath every changed command.

Read the argument

Proof checkpoints

15 script commands · 3 reading checkpoints · 1 local claims

This is a reading aid, not a new proof or a proof-tree certificate. Checkpoint groups are consecutive commands, not inferred branch boundaries. Every step links to the preserved script.

Definition notation is shown below. Open the paired exact edition for the original native formulas. Source pairing is not a new equivalence certificate.

Named ingredients (2)
add eq zero rightsucc ne zero
01Fix variables and assumptionsL1–5

Work with arbitrary variables or the premises of the current implication.

  1. L1
    intro b
  2. L2
    intro c
  3. L3
    intro n
  4. L4
    intro q
  5. L5
    intro hq
02Separate the logical casesL6–7

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L6
    exfalso
  2. L7
    cases hq
03Establish hsqL8–15

Establish this local claim before using it. It is not an additional assumption. The following proof commands apply add eq zero right.

  1. L8
    have hsq : S q = 0
  2. L9
    specialize add_eq_zero_right x
  3. L10
    specialize add_eq_zero_right (S q)
  4. L11
    apply add_eq_zero_right
  5. L12
    exact hq_witness
  6. L13
    specialize succ_ne_zero q
  7. L14
    apply succ_ne_zero
  8. L15
    exact hsq

Library-wide reading audit

Original defined command ledger · 15 lines
  1. 0001intro b
  2. 0002intro c
  3. 0003intro n
  4. 0004intro q
  5. 0005intro hq
  6. 0006exfalso
  7. 0007cases hq
  8. 0008have hsq : S q = 0
  9. 0009specialize add_eq_zero_right x
  10. 0010specialize add_eq_zero_right (S q)
  11. 0011apply add_eq_zero_right
  12. 0012exact hq_witness
  13. 0013specialize succ_ne_zero q
  14. 0014apply succ_ne_zero
  15. 0015exact hsq