MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  pceu Structured version   Visualization version   GIF version

Theorem pceu 17004
Description: Uniqueness for the prime power function. (Contributed by Mario Carneiro, 23-Feb-2014.)
Hypotheses
Ref Expression
pcval.1 𝑆 = sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑥}, ℝ, < )
pcval.2 𝑇 = sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑦}, ℝ, < )
Assertion
Ref Expression
pceu ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ∃!𝑧∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)))
Distinct variable groups:   𝑥,𝑛,𝑦,𝑧,𝑁   𝑃,𝑛,𝑥,𝑦,𝑧   𝑧,𝑆   𝑧,𝑇
Allowed substitution hints:   𝑆(𝑥, 𝑦, 𝑛)   𝑇(𝑥, 𝑦, 𝑛)

Proof of Theorem pceu
Dummy variables 𝑠 𝑡 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simprl 783 . . . 4 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → 𝑁 ∈ ℚ)
2 elq 13058 . . . 4 (𝑁 ∈ ℚ ↔ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦))
31, 2sylib 221 . . 3 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦))
4 ovex 7445 . . . . . . . . 9 (𝑆 − 𝑇) ∈ V
5 biidd 265 . . . . . . . . 9 (𝑧 = (𝑆 − 𝑇) → (𝑁 = (𝑥 / 𝑦) ↔ 𝑁 = (𝑥 / 𝑦)))
64, 5ceqsexv 3499 . . . . . . . 8 (∃𝑧(𝑧 = (𝑆 − 𝑇) ∧ 𝑁 = (𝑥 / 𝑦)) ↔ 𝑁 = (𝑥 / 𝑦))
7 exancom 1894 . . . . . . . 8 (∃𝑧(𝑧 = (𝑆 − 𝑇) ∧ 𝑁 = (𝑥 / 𝑦)) ↔ ∃𝑧(𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)))
86, 7bitr3i 280 . . . . . . 7 (𝑁 = (𝑥 / 𝑦) ↔ ∃𝑧(𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)))
98rexbii 3110 . . . . . 6 (∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦) ↔ ∃𝑦 ∈ ℕ ∃𝑧(𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)))
10 rexcom4 3290 . . . . . 6 (∃𝑦 ∈ ℕ ∃𝑧(𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)) ↔ ∃𝑧∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)))
119, 10bitri 278 . . . . 5 (∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦) ↔ ∃𝑧∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)))
1211rexbii 3110 . . . 4 (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦) ↔ ∃𝑥 ∈ ℤ ∃𝑧∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)))
13 rexcom4 3290 . . . 4 (∃𝑥 ∈ ℤ ∃𝑧∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)) ↔ ∃𝑧∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)))
1412, 13bitri 278 . . 3 (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦) ↔ ∃𝑧∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)))
153, 14sylib 221 . 2 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ∃𝑧∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)))
16 pcval.1 . . . . . . . . . . 11 𝑆 = sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑥}, ℝ, < )
17 pcval.2 . . . . . . . . . . 11 𝑇 = sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑦}, ℝ, < )
18 eqid 2761 . . . . . . . . . . 11 sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) = sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < )
19 eqid 2761 . . . . . . . . . . 11 sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < ) = sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < )
20 simp11l 1303 . . . . . . . . . . 11 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑃 ∈ ℙ)
21 simp11r 1304 . . . . . . . . . . 11 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑁 ≠ 0)
22 simp12 1223 . . . . . . . . . . 11 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < )))) → (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ))
23 simp13l 1307 . . . . . . . . . . 11 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑁 = (𝑥 / 𝑦))
24 simp2 1155 . . . . . . . . . . 11 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < )))) → (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ))
25 simp3l 1220 . . . . . . . . . . 11 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑁 = (𝑠 / 𝑡))
2616, 17, 18, 19, 20, 21, 22, 23, 24, 25pceulem 17003 . . . . . . . . . 10 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < )))) → (𝑆 − 𝑇) = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < )))
27 simp13r 1308 . . . . . . . . . 10 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑧 = (𝑆 − 𝑇))
28 simp3r 1221 . . . . . . . . . 10 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < )))
2926, 27, 283eqtr4d 2806 . . . . . . . . 9 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑧 = 𝑤)
30293exp 1137 . . . . . . . 8 (((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇))) → ((𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) → ((𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < ))) → 𝑧 = 𝑤)))
3130rexlimdvv 3219 . . . . . . 7 (((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇))) → (∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < ))) → 𝑧 = 𝑤))
32313exp 1137 . . . . . 6 ((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) → ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) → ((𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)) → (∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < ))) → 𝑧 = 𝑤))))
3332adantrl 729 . . . . 5 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) → ((𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)) → (∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < ))) → 𝑧 = 𝑤))))
3433rexlimdvv 3219 . . . 4 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)) → (∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < ))) → 𝑧 = 𝑤)))
3534impd 416 . . 3 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ((∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)) ∧ ∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑧 = 𝑤))
3635alrimivv 1961 . 2 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ∀𝑧∀𝑤((∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)) ∧ ∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑧 = 𝑤))
37 eqeq1 2765 . . . . . 6 (𝑧 = 𝑤 → (𝑧 = (𝑆 − 𝑇) ↔ 𝑤 = (𝑆 − 𝑇)))
3837anbi2d 642 . . . . 5 (𝑧 = 𝑤 → ((𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)) ↔ (𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆 − 𝑇))))
39382rexbidv 3228 . . . 4 (𝑧 = 𝑤 → (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)) ↔ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆 − 𝑇))))
40 oveq1 7419 . . . . . . . . 9 (𝑥 = 𝑠 → (𝑥 / 𝑦) = (𝑠 / 𝑦))
4140eqeq2d 2772 . . . . . . . 8 (𝑥 = 𝑠 → (𝑁 = (𝑥 / 𝑦) ↔ 𝑁 = (𝑠 / 𝑦)))
42 breq2 5107 . . . . . . . . . . . . 13 (𝑥 = 𝑠 → ((𝑃↑𝑛) ∥ 𝑥 ↔ (𝑃↑𝑛) ∥ 𝑠))
4342rabbidv 3420 . . . . . . . . . . . 12 (𝑥 = 𝑠 → {𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑥} = {𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠})
4443supeq1d 9422 . . . . . . . . . . 11 (𝑥 = 𝑠 → sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑥}, ℝ, < ) = sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ))
4516, 44eqtrid 2808 . . . . . . . . . 10 (𝑥 = 𝑠 → 𝑆 = sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ))
4645oveq1d 7427 . . . . . . . . 9 (𝑥 = 𝑠 → (𝑆 − 𝑇) = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇))
4746eqeq2d 2772 . . . . . . . 8 (𝑥 = 𝑠 → (𝑤 = (𝑆 − 𝑇) ↔ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇)))
4841, 47anbi12d 644 . . . . . . 7 (𝑥 = 𝑠 → ((𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆 − 𝑇)) ↔ (𝑁 = (𝑠 / 𝑦) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇))))
4948rexbidv 3187 . . . . . 6 (𝑥 = 𝑠 → (∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆 − 𝑇)) ↔ ∃𝑦 ∈ ℕ (𝑁 = (𝑠 / 𝑦) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇))))
50 oveq2 7420 . . . . . . . . 9 (𝑦 = 𝑡 → (𝑠 / 𝑦) = (𝑠 / 𝑡))
5150eqeq2d 2772 . . . . . . . 8 (𝑦 = 𝑡 → (𝑁 = (𝑠 / 𝑦) ↔ 𝑁 = (𝑠 / 𝑡)))
52 breq2 5107 . . . . . . . . . . . . 13 (𝑦 = 𝑡 → ((𝑃↑𝑛) ∥ 𝑦 ↔ (𝑃↑𝑛) ∥ 𝑡))
5352rabbidv 3420 . . . . . . . . . . . 12 (𝑦 = 𝑡 → {𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑦} = {𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡})
5453supeq1d 9422 . . . . . . . . . . 11 (𝑦 = 𝑡 → sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑦}, ℝ, < ) = sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < ))
5517, 54eqtrid 2808 . . . . . . . . . 10 (𝑦 = 𝑡 → 𝑇 = sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < ))
5655oveq2d 7428 . . . . . . . . 9 (𝑦 = 𝑡 → (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇) = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < )))
5756eqeq2d 2772 . . . . . . . 8 (𝑦 = 𝑡 → (𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇) ↔ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < ))))
5851, 57anbi12d 644 . . . . . . 7 (𝑦 = 𝑡 → ((𝑁 = (𝑠 / 𝑦) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇)) ↔ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < )))))
5958cbvrexvw 3242 . . . . . 6 (∃𝑦 ∈ ℕ (𝑁 = (𝑠 / 𝑦) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇)) ↔ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < ))))
6049, 59bitrdi 290 . . . . 5 (𝑥 = 𝑠 → (∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆 − 𝑇)) ↔ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < )))))
6160cbvrexvw 3242 . . . 4 (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆 − 𝑇)) ↔ ∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < ))))
6239, 61bitrdi 290 . . 3 (𝑧 = 𝑤 → (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)) ↔ ∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < )))))
6362eu4 2641 . 2 (∃!𝑧∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)) ↔ (∃𝑧∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)) ∧ ∀𝑧∀𝑤((∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)) ∧ ∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑧 = 𝑤)))
6415, 36, 63sylanbrc 595 1 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ∃!𝑧∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆 − 𝑇)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∃!weu 2594   ≠ wne 2956  ∃wrex 3087  {crab 3413   class class class wbr 5103  (class class class)co 7412  supcsup 9416  ℝcr 11180  0cc0 11181   < clt 11324   − cmin 11522   / cdiv 11954  ℕcn 12316  ℕ0cn0 12587  ℤcz 12674  ℚcq 13056  ↑cexp 14184   ∥ cdvds 16402  ℙcprime 16826
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-cnex 11237  ax-resscn 11238  ax-1cn 11239  ax-icn 11240  ax-addcl 11241  ax-addrcl 11242  ax-mulcl 11243  ax-mulrcl 11244  ax-mulcom 11245  ax-addass 11246  ax-mulass 11247  ax-distr 11248  ax-i2m1 11249  ax-1ne0 11250  ax-1rid 11251  ax-rnegex 11252  ax-rrecex 11253  ax-cnre 11254  ax-pre-lttri 11255  ax-pre-lttrn 11256  ax-pre-ltadd 11257  ax-pre-mulgt0 11258  ax-pre-sup 11259
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8460  df-2o 8461  df-er 8701  df-en 8958  df-dom 8959  df-sdom 8960  df-fin 8961  df-sup 9418  df-inf 9419  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11524  df-neg 11525  df-div 11955  df-nn 12317  df-2 12386  df-3 12387  df-n0 12588  df-z 12675  df-uz 12947  df-q 13057  df-rp 13102  df-fl 13912  df-mod 13990  df-seq 14125  df-exp 14185  df-cj 15246  df-re 15247  df-im 15248  df-sqrt 15382  df-abs 15383  df-dvds 16403  df-gcd 16645  df-prm 16827
This theorem is used by:  pczpre  17005  pcdiv  17010
  Copyright terms: Public domain W3C validator