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

Theorem pceu 16760
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 770 . . . 4 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → 𝑁 ∈ ℚ)
2 elq 12850 . . . 4 (𝑁 ∈ ℚ ↔ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦))
31, 2sylib 218 . . 3 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦))
4 ovex 7385 . . . . . . . . 9 (𝑆𝑇) ∈ V
5 biidd 262 . . . . . . . . 9 (𝑧 = (𝑆𝑇) → (𝑁 = (𝑥 / 𝑦) ↔ 𝑁 = (𝑥 / 𝑦)))
64, 5ceqsexv 3487 . . . . . . . 8 (∃𝑧(𝑧 = (𝑆𝑇) ∧ 𝑁 = (𝑥 / 𝑦)) ↔ 𝑁 = (𝑥 / 𝑦))
7 exancom 1862 . . . . . . . 8 (∃𝑧(𝑧 = (𝑆𝑇) ∧ 𝑁 = (𝑥 / 𝑦)) ↔ ∃𝑧(𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
86, 7bitr3i 277 . . . . . . 7 (𝑁 = (𝑥 / 𝑦) ↔ ∃𝑧(𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
98rexbii 3080 . . . . . 6 (∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦) ↔ ∃𝑦 ∈ ℕ ∃𝑧(𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
10 rexcom4 3260 . . . . . 6 (∃𝑦 ∈ ℕ ∃𝑧(𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ↔ ∃𝑧𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
119, 10bitri 275 . . . . 5 (∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦) ↔ ∃𝑧𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
1211rexbii 3080 . . . 4 (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦) ↔ ∃𝑥 ∈ ℤ ∃𝑧𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
13 rexcom4 3260 . . . 4 (∃𝑥 ∈ ℤ ∃𝑧𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ↔ ∃𝑧𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
1412, 13bitri 275 . . 3 (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦) ↔ ∃𝑧𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
153, 14sylib 218 . 2 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ∃𝑧𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
16 pcval.1 . . . . . . . . . . 11 𝑆 = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑥}, ℝ, < )
17 pcval.2 . . . . . . . . . . 11 𝑇 = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑦}, ℝ, < )
18 eqid 2733 . . . . . . . . . . 11 sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < )
19 eqid 2733 . . . . . . . . . . 11 sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ) = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )
20 simp11l 1285 . . . . . . . . . . 11 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑃 ∈ ℙ)
21 simp11r 1286 . . . . . . . . . . 11 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑁 ≠ 0)
22 simp12 1205 . . . . . . . . . . 11 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ))
23 simp13l 1289 . . . . . . . . . . 11 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑁 = (𝑥 / 𝑦))
24 simp2 1137 . . . . . . . . . . 11 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ))
25 simp3l 1202 . . . . . . . . . . 11 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑁 = (𝑠 / 𝑡))
2616, 17, 18, 19, 20, 21, 22, 23, 24, 25pceulem 16759 . . . . . . . . . 10 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → (𝑆𝑇) = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))
27 simp13r 1290 . . . . . . . . . 10 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑧 = (𝑆𝑇))
28 simp3r 1203 . . . . . . . . . 10 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))
2926, 27, 283eqtr4d 2778 . . . . . . . . 9 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑧 = 𝑤)
30293exp 1119 . . . . . . . 8 (((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) → ((𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) → ((𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))) → 𝑧 = 𝑤)))
3130rexlimdvv 3189 . . . . . . 7 (((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) → (∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))) → 𝑧 = 𝑤))
32313exp 1119 . . . . . 6 ((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) → ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) → ((𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) → (∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))) → 𝑧 = 𝑤))))
3332adantrl 716 . . . . 5 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) → ((𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) → (∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))) → 𝑧 = 𝑤))))
3433rexlimdvv 3189 . . . 4 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) → (∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))) → 𝑧 = 𝑤)))
3534impd 410 . . 3 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ((∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ∧ ∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑧 = 𝑤))
3635alrimivv 1929 . 2 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ∀𝑧𝑤((∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ∧ ∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑧 = 𝑤))
37 eqeq1 2737 . . . . . 6 (𝑧 = 𝑤 → (𝑧 = (𝑆𝑇) ↔ 𝑤 = (𝑆𝑇)))
3837anbi2d 630 . . . . 5 (𝑧 = 𝑤 → ((𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ↔ (𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆𝑇))))
39382rexbidv 3198 . . . 4 (𝑧 = 𝑤 → (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ↔ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆𝑇))))
40 oveq1 7359 . . . . . . . . 9 (𝑥 = 𝑠 → (𝑥 / 𝑦) = (𝑠 / 𝑦))
4140eqeq2d 2744 . . . . . . . 8 (𝑥 = 𝑠 → (𝑁 = (𝑥 / 𝑦) ↔ 𝑁 = (𝑠 / 𝑦)))
42 breq2 5097 . . . . . . . . . . . . 13 (𝑥 = 𝑠 → ((𝑃𝑛) ∥ 𝑥 ↔ (𝑃𝑛) ∥ 𝑠))
4342rabbidv 3403 . . . . . . . . . . . 12 (𝑥 = 𝑠 → {𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑥} = {𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠})
4443supeq1d 9337 . . . . . . . . . . 11 (𝑥 = 𝑠 → sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑥}, ℝ, < ) = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ))
4516, 44eqtrid 2780 . . . . . . . . . 10 (𝑥 = 𝑠𝑆 = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ))
4645oveq1d 7367 . . . . . . . . 9 (𝑥 = 𝑠 → (𝑆𝑇) = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇))
4746eqeq2d 2744 . . . . . . . 8 (𝑥 = 𝑠 → (𝑤 = (𝑆𝑇) ↔ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇)))
4841, 47anbi12d 632 . . . . . . 7 (𝑥 = 𝑠 → ((𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆𝑇)) ↔ (𝑁 = (𝑠 / 𝑦) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇))))
4948rexbidv 3157 . . . . . 6 (𝑥 = 𝑠 → (∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆𝑇)) ↔ ∃𝑦 ∈ ℕ (𝑁 = (𝑠 / 𝑦) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇))))
50 oveq2 7360 . . . . . . . . 9 (𝑦 = 𝑡 → (𝑠 / 𝑦) = (𝑠 / 𝑡))
5150eqeq2d 2744 . . . . . . . 8 (𝑦 = 𝑡 → (𝑁 = (𝑠 / 𝑦) ↔ 𝑁 = (𝑠 / 𝑡)))
52 breq2 5097 . . . . . . . . . . . . 13 (𝑦 = 𝑡 → ((𝑃𝑛) ∥ 𝑦 ↔ (𝑃𝑛) ∥ 𝑡))
5352rabbidv 3403 . . . . . . . . . . . 12 (𝑦 = 𝑡 → {𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑦} = {𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡})
5453supeq1d 9337 . . . . . . . . . . 11 (𝑦 = 𝑡 → sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑦}, ℝ, < ) = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))
5517, 54eqtrid 2780 . . . . . . . . . 10 (𝑦 = 𝑡𝑇 = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))
5655oveq2d 7368 . . . . . . . . 9 (𝑦 = 𝑡 → (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇) = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))
5756eqeq2d 2744 . . . . . . . 8 (𝑦 = 𝑡 → (𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇) ↔ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))))
5851, 57anbi12d 632 . . . . . . 7 (𝑦 = 𝑡 → ((𝑁 = (𝑠 / 𝑦) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇)) ↔ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))))
5958cbvrexvw 3212 . . . . . 6 (∃𝑦 ∈ ℕ (𝑁 = (𝑠 / 𝑦) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇)) ↔ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))))
6049, 59bitrdi 287 . . . . 5 (𝑥 = 𝑠 → (∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆𝑇)) ↔ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))))
6160cbvrexvw 3212 . . . 4 (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆𝑇)) ↔ ∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))))
6239, 61bitrdi 287 . . 3 (𝑧 = 𝑤 → (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ↔ ∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))))
6362eu4 2612 . 2 (∃!𝑧𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ↔ (∃𝑧𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ∧ ∀𝑧𝑤((∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ∧ ∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑧 = 𝑤)))
6415, 36, 63sylanbrc 583 1 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ∃!𝑧𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086  wal 1539   = wceq 1541  wex 1780  wcel 2113  ∃!weu 2565  wne 2929  wrex 3057  {crab 3396   class class class wbr 5093  (class class class)co 7352  supcsup 9331  cr 11012  0cc0 11013   < clt 11153  cmin 11351   / cdiv 11781  cn 12132  0cn0 12388  cz 12475  cq 12848  cexp 13970  cdvds 16165  cprime 16584
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674  ax-cnex 11069  ax-resscn 11070  ax-1cn 11071  ax-icn 11072  ax-addcl 11073  ax-addrcl 11074  ax-mulcl 11075  ax-mulrcl 11076  ax-mulcom 11077  ax-addass 11078  ax-mulass 11079  ax-distr 11080  ax-i2m1 11081  ax-1ne0 11082  ax-1rid 11083  ax-rnegex 11084  ax-rrecex 11085  ax-cnre 11086  ax-pre-lttri 11087  ax-pre-lttrn 11088  ax-pre-ltadd 11089  ax-pre-mulgt0 11090  ax-pre-sup 11091
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-nel 3034  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-tr 5201  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7309  df-ov 7355  df-oprab 7356  df-mpo 7357  df-om 7803  df-1st 7927  df-2nd 7928  df-frecs 8217  df-wrecs 8248  df-recs 8297  df-rdg 8335  df-1o 8391  df-2o 8392  df-er 8628  df-en 8876  df-dom 8877  df-sdom 8878  df-fin 8879  df-sup 9333  df-inf 9334  df-pnf 11155  df-mnf 11156  df-xr 11157  df-ltxr 11158  df-le 11159  df-sub 11353  df-neg 11354  df-div 11782  df-nn 12133  df-2 12195  df-3 12196  df-n0 12389  df-z 12476  df-uz 12739  df-q 12849  df-rp 12893  df-fl 13698  df-mod 13776  df-seq 13911  df-exp 13971  df-cj 15008  df-re 15009  df-im 15010  df-sqrt 15144  df-abs 15145  df-dvds 16166  df-gcd 16408  df-prm 16585
This theorem is referenced by:  pczpre  16761  pcdiv  16766
  Copyright terms: Public domain W3C validator