EU000E

euler_unit_product_factor_exists

Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable

Construct the actual weighted factor by the independent decidable coprimality predicate.

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 expanded first-order arithmetic statement

forall m i. exists v. ((((forall eut_divisor_eu_factor_exists_coprime. (exists eut_left_eu_factor_exists_coprime. (i) = eut_divisor_eu_factor_exists_coprime * eut_left_eu_factor_exists_coprime) -> (exists eut_right_eu_factor_exists_coprime. (m) = eut_divisor_eu_factor_exists_coprime * eut_right_eu_factor_exists_coprime) -> eut_divisor_eu_factor_exists_coprime = 1) /\ (v)=(i)) \/ (~(forall eut_divisor_eu_factor_exists_coprime. (exists eut_left_eu_factor_exists_coprime. (i) = eut_divisor_eu_factor_exists_coprime * eut_left_eu_factor_exists_coprime) -> (exists eut_right_eu_factor_exists_coprime. (m) = eut_divisor_eu_factor_exists_coprime * eut_right_eu_factor_exists_coprime) -> eut_divisor_eu_factor_exists_coprime = 1) /\ (v)=1)))

Constructive proof overview

Generated structural guide

Construct the actual weighted factor by the independent decidable coprimality predicate.

The unchanged tactic script uses 1 declared prerequisite and contains 17 exact native proof lines.

Alpha v34 checked-use · first admitted v31 · independently kernel and Lean verified; not Stable

Proof neighborhood

Direct dependencies

totient_coprime_decidable Alpha theorem; checked-use authorized

Direct dependents

EU0014 euler_unit_product_prefix_exists

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

17 script commands · 11 reading checkpoints · 1 local claims

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.

01Fix variables and assumptionsL1–2

Work with arbitrary variables or the premises of the current implication.

  1. L1
    intro m
  2. L2
    intro i
02Establish hcL3–6

Establish this local claim before using it. It is not an additional assumption. The following proof commands apply totient coprime decidable.

  1. L3
    have hc : (forall eut_divisor_eu_factor_yes. (exists eut_left_eu_factor_yes. (i) = eut_divisor_eu_factor_yes * eut_left_eu_factor_yes) -> (exists eut_right_eu_factor_yes. (m) = eut_divisor_eu_factor_yes * eut_right_eu_factor_yes) -> eut_divisor_eu_factor_yes = 1) \/ ~(forall eut_divisor_eu_factor_no. (exists eut_left_eu_factor_no. (i) = eut_divisor_eu_factor_no * eut_left_eu_factor_no) -> (exists eut_right_eu_factor_no. (m) = eut_divisor_eu_factor_no * eut_right_eu_factor_no) -> eut_divisor_eu_factor_no = 1)
  2. L4
    specialize totient_coprime_decidable (i)
  3. L5
    specialize totient_coprime_decidable (m)
  4. L6
    apply totient_coprime_decidable
03Separate the logical casesL7–7

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L7
    cases hc
04Construct an explicit witnessL8–8

Supply the displayed value, then prove that it has the required property.

  1. L8
    exists i
05Separate the logical casesL9–10

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L9
    left
  2. L10
    split
06Use earlier factsL11–11

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L11
    exact hc_left
07Calculate and transport equalitiesL12–12

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L12
    refl
08Construct an explicit witnessL13–13

Supply the displayed value, then prove that it has the required property.

  1. L13
    exists 1
09Separate the logical casesL14–15

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L14
    right
  2. L15
    split
10Use earlier factsL16–16

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L16
    exact hc_right
11Calculate and transport equalitiesL17–17

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L17
    refl

Library-wide reading audit

Original exact command ledger · 17 lines
  1. 0001intro m
  2. 0002intro i
  3. 0003have hc : (forall eut_divisor_eu_factor_yes. (exists eut_left_eu_factor_yes. (i) = eut_divisor_eu_factor_yes * eut_left_eu_factor_yes) -> (exists eut_right_eu_factor_yes. (m) = eut_divisor_eu_factor_yes * eut_right_eu_factor_yes) -> eut_divisor_eu_factor_yes = 1) \/ ~(forall eut_divisor_eu_factor_no. (exists eut_left_eu_factor_no. (i) = eut_divisor_eu_factor_no * eut_left_eu_factor_no) -> (exists eut_right_eu_factor_no. (m) = eut_divisor_eu_factor_no * eut_right_eu_factor_no) -> eut_divisor_eu_factor_no = 1)
  4. 0004specialize totient_coprime_decidable (i)
  5. 0005specialize totient_coprime_decidable (m)
  6. 0006apply totient_coprime_decidable
  7. 0007cases hc
  8. 0008exists i
  9. 0009left
  10. 0010split
  11. 0011exact hc_left
  12. 0012refl
  13. 0013exists 1
  14. 0014right
  15. 0015split
  16. 0016exact hc_right
  17. 0017refl