PA009F

scaled_inverse_fixed_point_iff

Alpha v16 checked-use theorem · independently closed; not Stable

On the bounded unit domain, fixed points are exactly square roots of a.

Exact expanded PA statement

forall p a x. ((((((~(x = 0) /\ (exists esi_strict_gap_fixed_relation_left_bound. esi_strict_gap_fixed_relation_left_bound + S x = p))) /\ (((~(x = 0) /\ (exists esi_strict_gap_fixed_relation_right_bound. esi_strict_gap_fixed_relation_right_bound + S x = p))) /\ (exists esi_mod_left_fixed_relation_mod esi_mod_right_fixed_relation_mod. (x * x) + p * esi_mod_left_fixed_relation_mod = (a) + p * esi_mod_right_fixed_relation_mod)))) -> ((((~(x = 0) /\ (exists esi_strict_gap_fixed_square_unit_bound. esi_strict_gap_fixed_square_unit_bound + S x = p))) /\ (exists esi_mod_left_fixed_square_square esi_mod_right_fixed_square_square. (x * x) + p * esi_mod_left_fixed_square_square = (a) + p * esi_mod_right_fixed_square_square)))) /\ (((((~(x = 0) /\ (exists esi_strict_gap_fixed_square_unit_bound. esi_strict_gap_fixed_square_unit_bound + S x = p))) /\ (exists esi_mod_left_fixed_square_square esi_mod_right_fixed_square_square. (x * x) + p * esi_mod_left_fixed_square_square = (a) + p * esi_mod_right_fixed_square_square))) -> ((((~(x = 0) /\ (exists esi_strict_gap_fixed_relation_left_bound. esi_strict_gap_fixed_relation_left_bound + S x = p))) /\ (((~(x = 0) /\ (exists esi_strict_gap_fixed_relation_right_bound. esi_strict_gap_fixed_relation_right_bound + S x = p))) /\ (exists esi_mod_left_fixed_relation_mod esi_mod_right_fixed_relation_mod. (x * x) + p * esi_mod_left_fixed_relation_mod = (a) + p * esi_mod_right_fixed_relation_mod))))))

Structural proof guide

Generated structural guide

On the bounded unit domain, fixed points are exactly square roots of a.

This root lemma is proved directly from the PA rules and the hypotheses introduced by its statement.

The proof proceeds by case analysis (3).

Referenced ingredients

none

Proof neighborhood

Direct dependencies

none

Direct dependents

Formal native tactic body

Dependencies are introduced as named hypotheses before line 1. Linked names are exact direct references. This Alpha-v16 checked-use theorem is independently kernel-checked when replayed; it is not a Stable theorem.

  1. 0001intro p
  2. 0002intro a
  3. 0003intro x
  4. 0004split
  5. 0005intro hrel
  6. 0006cases hrel
  7. 0007cases hrel_right
  8. 0008split
  9. 0009exact hrel_left
  10. 0010exact hrel_right_right
  11. 0011intro hfixed
  12. 0012cases hfixed
  13. 0013split
  14. 0014exact hfixed_left
  15. 0015split
  16. 0016exact hfixed_left
  17. 0017exact hfixed_right