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

Theorem pceu 15389
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 790 . . . 4 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → 𝑁 ∈ ℚ)
2 elq 11666 . . . 4 (𝑁 ∈ ℚ ↔ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦))
31, 2sylib 207 . . 3 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦))
4 ovex 6577 . . . . . . . . 9 (𝑆𝑇) ∈ V
5 biidd 251 . . . . . . . . 9 (𝑧 = (𝑆𝑇) → (𝑁 = (𝑥 / 𝑦) ↔ 𝑁 = (𝑥 / 𝑦)))
64, 5ceqsexv 3215 . . . . . . . 8 (∃𝑧(𝑧 = (𝑆𝑇) ∧ 𝑁 = (𝑥 / 𝑦)) ↔ 𝑁 = (𝑥 / 𝑦))
7 exancom 1774 . . . . . . . 8 (∃𝑧(𝑧 = (𝑆𝑇) ∧ 𝑁 = (𝑥 / 𝑦)) ↔ ∃𝑧(𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
86, 7bitr3i 265 . . . . . . 7 (𝑁 = (𝑥 / 𝑦) ↔ ∃𝑧(𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
98rexbii 3023 . . . . . 6 (∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦) ↔ ∃𝑦 ∈ ℕ ∃𝑧(𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
10 rexcom4 3198 . . . . . 6 (∃𝑦 ∈ ℕ ∃𝑧(𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ↔ ∃𝑧𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
119, 10bitri 263 . . . . 5 (∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦) ↔ ∃𝑧𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
1211rexbii 3023 . . . 4 (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦) ↔ ∃𝑥 ∈ ℤ ∃𝑧𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
13 rexcom4 3198 . . . 4 (∃𝑥 ∈ ℤ ∃𝑧𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ↔ ∃𝑧𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
1412, 13bitri 263 . . 3 (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦) ↔ ∃𝑧𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
153, 14sylib 207 . 2 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ∃𝑧𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
16 pcval.1 . . . . . . . . . . 11 𝑆 = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑥}, ℝ, < )
17 pcval.2 . . . . . . . . . . 11 𝑇 = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑦}, ℝ, < )
18 eqid 2610 . . . . . . . . . . 11 sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < )
19 eqid 2610 . . . . . . . . . . 11 sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ) = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )
20 simp11l 1165 . . . . . . . . . . 11 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑃 ∈ ℙ)
21 simp11r 1166 . . . . . . . . . . 11 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑁 ≠ 0)
22 simp12 1085 . . . . . . . . . . 11 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ))
23 simp13l 1169 . . . . . . . . . . 11 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑁 = (𝑥 / 𝑦))
24 simp2 1055 . . . . . . . . . . 11 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ))
25 simp3l 1082 . . . . . . . . . . 11 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑁 = (𝑠 / 𝑡))
2616, 17, 18, 19, 20, 21, 22, 23, 24, 25pceulem 15388 . . . . . . . . . 10 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → (𝑆𝑇) = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))
27 simp13r 1170 . . . . . . . . . 10 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑧 = (𝑆𝑇))
28 simp3r 1083 . . . . . . . . . 10 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))
2926, 27, 283eqtr4d 2654 . . . . . . . . 9 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑧 = 𝑤)
30293exp 1256 . . . . . . . 8 (((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) → ((𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) → ((𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))) → 𝑧 = 𝑤)))
3130rexlimdvv 3019 . . . . . . 7 (((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) → (∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))) → 𝑧 = 𝑤))
32313exp 1256 . . . . . 6 ((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) → ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) → ((𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) → (∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))) → 𝑧 = 𝑤))))
3332adantrl 748 . . . . 5 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) → ((𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) → (∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))) → 𝑧 = 𝑤))))
3433rexlimdvv 3019 . . . 4 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) → (∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))) → 𝑧 = 𝑤)))
3534impd 446 . . 3 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ((∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ∧ ∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑧 = 𝑤))
3635alrimivv 1843 . 2 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ∀𝑧𝑤((∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ∧ ∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑧 = 𝑤))
37 eqeq1 2614 . . . . . 6 (𝑧 = 𝑤 → (𝑧 = (𝑆𝑇) ↔ 𝑤 = (𝑆𝑇)))
3837anbi2d 736 . . . . 5 (𝑧 = 𝑤 → ((𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ↔ (𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆𝑇))))
39382rexbidv 3039 . . . 4 (𝑧 = 𝑤 → (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ↔ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆𝑇))))
40 oveq1 6556 . . . . . . . . 9 (𝑥 = 𝑠 → (𝑥 / 𝑦) = (𝑠 / 𝑦))
4140eqeq2d 2620 . . . . . . . 8 (𝑥 = 𝑠 → (𝑁 = (𝑥 / 𝑦) ↔ 𝑁 = (𝑠 / 𝑦)))
42 breq2 4587 . . . . . . . . . . . . 13 (𝑥 = 𝑠 → ((𝑃𝑛) ∥ 𝑥 ↔ (𝑃𝑛) ∥ 𝑠))
4342rabbidv 3164 . . . . . . . . . . . 12 (𝑥 = 𝑠 → {𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑥} = {𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠})
4443supeq1d 8235 . . . . . . . . . . 11 (𝑥 = 𝑠 → sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑥}, ℝ, < ) = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ))
4516, 44syl5eq 2656 . . . . . . . . . 10 (𝑥 = 𝑠𝑆 = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ))
4645oveq1d 6564 . . . . . . . . 9 (𝑥 = 𝑠 → (𝑆𝑇) = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇))
4746eqeq2d 2620 . . . . . . . 8 (𝑥 = 𝑠 → (𝑤 = (𝑆𝑇) ↔ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇)))
4841, 47anbi12d 743 . . . . . . 7 (𝑥 = 𝑠 → ((𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆𝑇)) ↔ (𝑁 = (𝑠 / 𝑦) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇))))
4948rexbidv 3034 . . . . . 6 (𝑥 = 𝑠 → (∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆𝑇)) ↔ ∃𝑦 ∈ ℕ (𝑁 = (𝑠 / 𝑦) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇))))
50 oveq2 6557 . . . . . . . . 9 (𝑦 = 𝑡 → (𝑠 / 𝑦) = (𝑠 / 𝑡))
5150eqeq2d 2620 . . . . . . . 8 (𝑦 = 𝑡 → (𝑁 = (𝑠 / 𝑦) ↔ 𝑁 = (𝑠 / 𝑡)))
52 breq2 4587 . . . . . . . . . . . . 13 (𝑦 = 𝑡 → ((𝑃𝑛) ∥ 𝑦 ↔ (𝑃𝑛) ∥ 𝑡))
5352rabbidv 3164 . . . . . . . . . . . 12 (𝑦 = 𝑡 → {𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑦} = {𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡})
5453supeq1d 8235 . . . . . . . . . . 11 (𝑦 = 𝑡 → sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑦}, ℝ, < ) = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))
5517, 54syl5eq 2656 . . . . . . . . . 10 (𝑦 = 𝑡𝑇 = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))
5655oveq2d 6565 . . . . . . . . 9 (𝑦 = 𝑡 → (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇) = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))
5756eqeq2d 2620 . . . . . . . 8 (𝑦 = 𝑡 → (𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇) ↔ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))))
5851, 57anbi12d 743 . . . . . . 7 (𝑦 = 𝑡 → ((𝑁 = (𝑠 / 𝑦) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇)) ↔ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))))
5958cbvrexv 3148 . . . . . 6 (∃𝑦 ∈ ℕ (𝑁 = (𝑠 / 𝑦) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇)) ↔ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))))
6049, 59syl6bb 275 . . . . 5 (𝑥 = 𝑠 → (∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆𝑇)) ↔ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))))
6160cbvrexv 3148 . . . 4 (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆𝑇)) ↔ ∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))))
6239, 61syl6bb 275 . . 3 (𝑧 = 𝑤 → (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ↔ ∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))))
6362eu4 2506 . 2 (∃!𝑧𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ↔ (∃𝑧𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ∧ ∀𝑧𝑤((∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ∧ ∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑧 = 𝑤)))
6415, 36, 63sylanbrc 695 1 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ∃!𝑧𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383  w3a 1031  wal 1473   = wceq 1475  wex 1695  wcel 1977  ∃!weu 2458  wne 2780  wrex 2897  {crab 2900   class class class wbr 4583  (class class class)co 6549  supcsup 8229  cr 9814  0cc0 9815   < clt 9953  cmin 10145   / cdiv 10563  cn 10897  0cn0 11169  cz 11254  cq 11664  cexp 12722  cdvds 14821  cprime 15223
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892  ax-pre-sup 9893
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-2o 7448  df-oadd 7451  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-sup 8231  df-inf 8232  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-div 10564  df-nn 10898  df-2 10956  df-3 10957  df-n0 11170  df-z 11255  df-uz 11564  df-q 11665  df-rp 11709  df-fl 12455  df-mod 12531  df-seq 12664  df-exp 12723  df-cj 13687  df-re 13688  df-im 13689  df-sqrt 13823  df-abs 13824  df-dvds 14822  df-gcd 15055  df-prm 15224
This theorem is referenced by:  pczpre  15390  pcdiv  15395
  Copyright terms: Public domain W3C validator