Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
Mobius(n,z) is positive-domain only, independently defined from squarefreeness and actual prime-factor parity. Signed codes 0, 2 and 1 represent zero, +1 and -1. This family proves values and prime-adjunction laws; the separate Möbius-inversion family supplies the complete G007 endpoint.
Exact theorem in conservative defined notation
AlternatingSignedUnit(0,2)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 6 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.
01Separate the logical casesL1–2
02Construct an explicit witnessL3–3
Supply the displayed value, then prove that it has the required property.
- L3
exists 0
03Calculate and transport equalitiesL4–4
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L4
symm
04Use earlier factsL5–5
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L5
apply PA5
05Calculate and transport equalitiesL6–6
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L6
refl