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.
Exact expanded first-order arithmetic statement
forall x y. (forall pff_divisor_swap_forward. (exists pff_left_swap_forward. (x) = pff_divisor_swap_forward * pff_left_swap_forward) -> (exists pff_right_swap_forward. (y) = pff_divisor_swap_forward * pff_right_swap_forward) -> pff_divisor_swap_forward = 1) -> (forall pff_divisor_swap_backward. (exists pff_left_swap_backward. (y) = pff_divisor_swap_backward * pff_left_swap_backward) -> (exists pff_right_swap_backward. (x) = pff_divisor_swap_backward * pff_right_swap_backward) -> pff_divisor_swap_backward = 1)Constructive proof overview
Generated structural guide
Natural common-divisor coprimality is symmetric with no gcd choice or excluded middle.
The unchanged tactic script uses 0 declared prerequisites and contains 10 exact native proof lines.
dependency-curried kernel-checked theorem body; Alpha enrollment and checked-use authority follow separately sealed release evidence; Stable membership remains unchanged
Proof neighborhood
Direct dependencies
Direct dependents
Formal native tactic body
Dependencies are introduced as named hypotheses before line 1. Local theorem links identify exact declared prerequisites. This exact body belongs to a complete independently kernel-checked constructive proof bundle and has Alpha checked-use authority; it does not imply Stable membership.
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.