Exact expanded PA statement
forall i. exists a. (((((~(S (i) = 1) /\ forall bpr_left_bpfc_exists_prime bpr_right_bpfc_exists_prime. S (i) = bpr_left_bpfc_exists_prime * bpr_right_bpfc_exists_prime -> bpr_left_bpfc_exists_prime = 1 \/ bpr_right_bpfc_exists_prime = 1)) /\ a = S (i)) \/ (~((~(S (i) = 1) /\ forall bpr_left_bpfc_exists_prime bpr_right_bpfc_exists_prime. S (i) = bpr_left_bpfc_exists_prime * bpr_right_bpfc_exists_prime -> bpr_left_bpfc_exists_prime = 1 \/ bpr_right_bpfc_exists_prime = 1)) /\ a = 1)))Structural proof guide
Every index has its exact prime-or-one selector factor.
Direct prerequisites: prime_decidable. The authored body proceeds by case analysis (1).
Proof neighborhood
Direct dependencies
Direct dependents
Formal native tactic body
Dependencies are hypotheses of this body receipt. The focused endpoint audits separately check the complete empty-context certificates.