DV0010

divisor_mask_entry_zero

Index zero is masked to canonical zero for every input table and n, without inspecting or restricting F(0).

Alpha v34 checked-use · first admitted v31 · independently kernel and Lean verified; not Stable

Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.

A genuine divisor mask has S n entries, indexed zero through n, and forces its zeroth entry to zero regardless of F(0). Möbius values remain positive-domain only. This family constructs divisor sums and Möbius tables; cancellation and the full G007 endpoint are separately proved later in the same release.

Exact theorem in conservative defined notation

∀ F. ∀ n. DivisorMaskEntry(F,n,0,0)

Every linked abbreviation expands hygienically to the identical original native formula.

Definition DAG

DivisorMaskEntry(F,n,d,z) · 1

Actual proof prerequisites

none
Original expanded first-order statement 
forall F n. ((((~((0)=0)) /\ (exists dm_quotient_zero_entry. (((n)=(0)*dm_quotient_zero_entry) /\ (exists dst_positive_code_zero_entryinput dst_positive_scale_zero_entryinput dst_negative_code_zero_entryinput dst_negative_scale_zero_entryinput dst_positive_zero_entryinput dst_negative_zero_entryinput. (((F) = (((((dst_positive_code_zero_entryinput) + (dst_positive_scale_zero_entryinput)) * S ((dst_positive_code_zero_entryinput) + (dst_positive_scale_zero_entryinput)) + ((dst_positive_scale_zero_entryinput) + (dst_positive_scale_zero_entryinput))) + (((dst_negative_code_zero_entryinput) + (dst_negative_scale_zero_entryinput)) * S ((dst_negative_code_zero_entryinput) + (dst_negative_scale_zero_entryinput)) + ((dst_negative_scale_zero_entryinput) + (dst_negative_scale_zero_entryinput)))) * S ((((dst_positive_code_zero_entryinput) + (dst_positive_scale_zero_entryinput)) * S ((dst_positive_code_zero_entryinput) + (dst_positive_scale_zero_entryinput)) + ((dst_positive_scale_zero_entryinput) + (dst_positive_scale_zero_entryinput))) + (((dst_negative_code_zero_entryinput) + (dst_negative_scale_zero_entryinput)) * S ((dst_negative_code_zero_entryinput) + (dst_negative_scale_zero_entryinput)) + ((dst_negative_scale_zero_entryinput) + (dst_negative_scale_zero_entryinput)))) + ((((dst_negative_code_zero_entryinput) + (dst_negative_scale_zero_entryinput)) * S ((dst_negative_code_zero_entryinput) + (dst_negative_scale_zero_entryinput)) + ((dst_negative_scale_zero_entryinput) + (dst_negative_scale_zero_entryinput))) + (((dst_negative_code_zero_entryinput) + (dst_negative_scale_zero_entryinput)) * S ((dst_negative_code_zero_entryinput) + (dst_negative_scale_zero_entryinput)) + ((dst_negative_scale_zero_entryinput) + (dst_negative_scale_zero_entryinput)))))) /\ (((((exists ff_h_pvs_zero_entryinputpositive. ff_h_pvs_zero_entryinputpositive + S (dst_positive_zero_entryinput) = S ((S (0)) * dst_positive_scale_zero_entryinput)) /\ exists ff_q_pvs_zero_entryinputpositive. dst_positive_code_zero_entryinput = ff_q_pvs_zero_entryinputpositive * S ((S (0)) * dst_positive_scale_zero_entryinput) + (dst_positive_zero_entryinput))) /\ (((((exists ff_h_pvs_zero_entryinputnegative. ff_h_pvs_zero_entryinputnegative + S (dst_negative_zero_entryinput) = S ((S (0)) * dst_negative_scale_zero_entryinput)) /\ exists ff_q_pvs_zero_entryinputnegative. dst_negative_code_zero_entryinput = ff_q_pvs_zero_entryinputnegative * S ((S (0)) * dst_negative_scale_zero_entryinput) + (dst_negative_zero_entryinput))) /\ (exists ge_balance_positive_zero_entryinputvalue ge_balance_negative_zero_entryinputvalue. (((((0) = 2 * (ge_balance_positive_zero_entryinputvalue) /\ (ge_balance_negative_zero_entryinputvalue) = 0) \/ exists ge_signed_half_zero_entryinputvaluedecode. (((0) = 2 * ge_signed_half_zero_entryinputvaluedecode + 1 /\ (ge_balance_positive_zero_entryinputvalue) = 0) /\ (ge_balance_negative_zero_entryinputvalue) = S ge_signed_half_zero_entryinputvaluedecode))) /\ ((dst_positive_zero_entryinput) + ge_balance_negative_zero_entryinputvalue = (dst_negative_zero_entryinput) + ge_balance_positive_zero_entryinputvalue))))))))))))) \/ ((((0)=0 \/ ~(exists pvs_factor_zero_entrynondivisor. (n) = (0) * pvs_factor_zero_entrynondivisor)) /\ ((0)=0))))

Complete tactic proof in conservative notation

All 7 original proof lines are preserved. Only local proposition formulas are abbreviated; every abbreviation has an exact binder-safe expansion check. The linked exact edition contains the unchanged replay script.

Read the argument

Proof checkpoints

7 script commands · 3 reading checkpoints · 0 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.

01Fix variables and assumptionsL1–2

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

  1. L1
    intro F
  2. L2
    intro n
02Separate the logical casesL3–5

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

  1. L3
    right
  2. L4
    split
  3. L5
    left
03Calculate and transport equalitiesL6–7

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L6
    refl
  2. L7
    refl

Library-wide reading audit

Original defined command ledger · 7 lines
  1. 0001intro F
  2. 0002intro n
  3. 0003right
  4. 0004split
  5. 0005left
  6. 0006refl
  7. 0007refl