This checkpoint constructs prime-order fields (k=1), with genuine finite arithmetic tables, cardinality, and characteristic. Inversion is proved only for nonzero elements; the table's zero entry is a zero-to-zero convention. G091 for every prime power p^k, with an irreducible polynomial of degree k, remains open. No extension-field construction or G091 closure is claimed.
Exact theorem in conservative defined notation
∀ p. Prime(p) → FpCharacteristic(p)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 26 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
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.
Named ingredients (4)
01Fix variables and assumptionsL1–2
02Separate the logical casesL3–3
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L3
split
03Use earlier factsL4–11
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L4
specialize prime_field_unit_multiple_from_residue (p) - L5
specialize prime_field_unit_multiple_from_residue (p) - L6
specialize prime_field_unit_multiple_from_residue (0) - L7
apply prime_field_unit_multiple_from_residue - L8
exact hp - L9
specialize prime_field_residue_modulus_zero (p) - L10
apply prime_field_residue_modulus_zero - L11
exact hp
04Fix variables and assumptionsL12–15
05Use earlier factsL16–25
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L16
specialize prime_field_positive_below_modulus_not_zero (p) - L17
specialize prime_field_positive_below_modulus_not_zero (n) - L18
apply prime_field_positive_below_modulus_not_zero - L19
exact hn - L20
exact hpositive - L21
specialize prime_field_unit_multiple_residue (p) - L22
specialize prime_field_unit_multiple_residue (n) - L23
specialize prime_field_unit_multiple_residue (0) - L24
apply prime_field_unit_multiple_residue - L25
exact hp
06Use earlier factsL26–26
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L26
exact hm
Original defined command ledger · 26 lines
- 0001
intro p - 0002
intro hp - 0003
split - 0004
specialize prime_field_unit_multiple_from_residue (p) - 0005
specialize prime_field_unit_multiple_from_residue (p) - 0006
specialize prime_field_unit_multiple_from_residue (0) - 0007
apply prime_field_unit_multiple_from_residue - 0008
exact hp - 0009
specialize prime_field_residue_modulus_zero (p) - 0010
apply prime_field_residue_modulus_zero - 0011
exact hp - 0012
intro n - 0013
intro hn - 0014
intro hpositive - 0015
intro hm - 0016
specialize prime_field_positive_below_modulus_not_zero (p) - 0017
specialize prime_field_positive_below_modulus_not_zero (n) - 0018
apply prime_field_positive_below_modulus_not_zero - 0019
exact hn - 0020
exact hpositive - 0021
specialize prime_field_unit_multiple_residue (p) - 0022
specialize prime_field_unit_multiple_residue (n) - 0023
specialize prime_field_unit_multiple_residue (0) - 0024
apply prime_field_unit_multiple_residue - 0025
exact hp - 0026
exact hm