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

Theorem pceu 16931
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 12992 . . . 4 (𝑁 ∈ ℚ ↔ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦))
31, 2sylib 221 . . 3 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦))
4 ovex 7456 . . . . . . . . 9 (𝑆𝑇) ∈ V
5 biidd 265 . . . . . . . . 9 (𝑧 = (𝑆𝑇) → (𝑁 = (𝑥 / 𝑦) ↔ 𝑁 = (𝑥 / 𝑦)))
64, 5ceqsexv 3506 . . . . . . . 8 (∃𝑧(𝑧 = (𝑆𝑇) ∧ 𝑁 = (𝑥 / 𝑦)) ↔ 𝑁 = (𝑥 / 𝑦))
7 exancom 1894 . . . . . . . 8 (∃𝑧(𝑧 = (𝑆𝑇) ∧ 𝑁 = (𝑥 / 𝑦)) ↔ ∃𝑧(𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
86, 7bitr3i 280 . . . . . . 7 (𝑁 = (𝑥 / 𝑦) ↔ ∃𝑧(𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
98rexbii 3115 . . . . . 6 (∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦) ↔ ∃𝑦 ∈ ℕ ∃𝑧(𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
10 rexcom4 3295 . . . . . 6 (∃𝑦 ∈ ℕ ∃𝑧(𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ↔ ∃𝑧𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
119, 10bitri 278 . . . . 5 (∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦) ↔ ∃𝑧𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
1211rexbii 3115 . . . 4 (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦) ↔ ∃𝑥 ∈ ℤ ∃𝑧𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
13 rexcom4 3295 . . . 4 (∃𝑥 ∈ ℤ ∃𝑧𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ↔ ∃𝑧𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
1412, 13bitri 278 . . 3 (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ 𝑁 = (𝑥 / 𝑦) ↔ ∃𝑧𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
153, 14sylib 221 . 2 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ∃𝑧𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)))
16 pcval.1 . . . . . . . . . . 11 𝑆 = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑥}, ℝ, < )
17 pcval.2 . . . . . . . . . . 11 𝑇 = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑦}, ℝ, < )
18 eqid 2766 . . . . . . . . . . 11 sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < )
19 eqid 2766 . . . . . . . . . . 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 16930 . . . . . . . . . 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 2811 . . . . . . . . 9 ((((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) ∧ (𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) ∧ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑧 = 𝑤)
30293exp 1137 . . . . . . . 8 (((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) → ((𝑠 ∈ ℤ ∧ 𝑡 ∈ ℕ) → ((𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))) → 𝑧 = 𝑤)))
3130rexlimdvv 3224 . . . . . . 7 (((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) ∧ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇))) → (∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))) → 𝑧 = 𝑤))
32313exp 1137 . . . . . 6 ((𝑃 ∈ ℙ ∧ 𝑁 ≠ 0) → ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) → ((𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) → (∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))) → 𝑧 = 𝑤))))
3332adantrl 729 . . . . 5 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) → ((𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) → (∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))) → 𝑧 = 𝑤))))
3433rexlimdvv 3224 . . . 4 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) → (∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))) → 𝑧 = 𝑤)))
3534impd 416 . . 3 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ((∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ∧ ∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑧 = 𝑤))
3635alrimivv 1961 . 2 ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℚ ∧ 𝑁 ≠ 0)) → ∀𝑧𝑤((∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ∧ ∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))) → 𝑧 = 𝑤))
37 eqeq1 2770 . . . . . 6 (𝑧 = 𝑤 → (𝑧 = (𝑆𝑇) ↔ 𝑤 = (𝑆𝑇)))
3837anbi2d 642 . . . . 5 (𝑧 = 𝑤 → ((𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ↔ (𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆𝑇))))
39382rexbidv 3233 . . . 4 (𝑧 = 𝑤 → (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ↔ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆𝑇))))
40 oveq1 7430 . . . . . . . . 9 (𝑥 = 𝑠 → (𝑥 / 𝑦) = (𝑠 / 𝑦))
4140eqeq2d 2777 . . . . . . . 8 (𝑥 = 𝑠 → (𝑁 = (𝑥 / 𝑦) ↔ 𝑁 = (𝑠 / 𝑦)))
42 breq2 5118 . . . . . . . . . . . . 13 (𝑥 = 𝑠 → ((𝑃𝑛) ∥ 𝑥 ↔ (𝑃𝑛) ∥ 𝑠))
4342rabbidv 3426 . . . . . . . . . . . 12 (𝑥 = 𝑠 → {𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑥} = {𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠})
4443supeq1d 9416 . . . . . . . . . . 11 (𝑥 = 𝑠 → sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑥}, ℝ, < ) = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ))
4516, 44eqtrid 2813 . . . . . . . . . 10 (𝑥 = 𝑠𝑆 = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ))
4645oveq1d 7438 . . . . . . . . 9 (𝑥 = 𝑠 → (𝑆𝑇) = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇))
4746eqeq2d 2777 . . . . . . . 8 (𝑥 = 𝑠 → (𝑤 = (𝑆𝑇) ↔ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇)))
4841, 47anbi12d 644 . . . . . . 7 (𝑥 = 𝑠 → ((𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆𝑇)) ↔ (𝑁 = (𝑠 / 𝑦) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇))))
4948rexbidv 3192 . . . . . 6 (𝑥 = 𝑠 → (∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆𝑇)) ↔ ∃𝑦 ∈ ℕ (𝑁 = (𝑠 / 𝑦) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇))))
50 oveq2 7431 . . . . . . . . 9 (𝑦 = 𝑡 → (𝑠 / 𝑦) = (𝑠 / 𝑡))
5150eqeq2d 2777 . . . . . . . 8 (𝑦 = 𝑡 → (𝑁 = (𝑠 / 𝑦) ↔ 𝑁 = (𝑠 / 𝑡)))
52 breq2 5118 . . . . . . . . . . . . 13 (𝑦 = 𝑡 → ((𝑃𝑛) ∥ 𝑦 ↔ (𝑃𝑛) ∥ 𝑡))
5352rabbidv 3426 . . . . . . . . . . . 12 (𝑦 = 𝑡 → {𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑦} = {𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡})
5453supeq1d 9416 . . . . . . . . . . 11 (𝑦 = 𝑡 → sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑦}, ℝ, < ) = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))
5517, 54eqtrid 2813 . . . . . . . . . 10 (𝑦 = 𝑡𝑇 = sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))
5655oveq2d 7439 . . . . . . . . 9 (𝑦 = 𝑡 → (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇) = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))
5756eqeq2d 2777 . . . . . . . 8 (𝑦 = 𝑡 → (𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇) ↔ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))))
5851, 57anbi12d 644 . . . . . . 7 (𝑦 = 𝑡 → ((𝑁 = (𝑠 / 𝑦) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇)) ↔ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))))
5958cbvrexvw 3247 . . . . . 6 (∃𝑦 ∈ ℕ (𝑁 = (𝑠 / 𝑦) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − 𝑇)) ↔ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))))
6049, 59bitrdi 290 . . . . 5 (𝑥 = 𝑠 → (∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆𝑇)) ↔ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))))
6160cbvrexvw 3247 . . . 4 (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑤 = (𝑆𝑇)) ↔ ∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < ))))
6239, 61bitrdi 290 . . 3 (𝑧 = 𝑤 → (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑁 = (𝑥 / 𝑦) ∧ 𝑧 = (𝑆𝑇)) ↔ ∃𝑠 ∈ ℤ ∃𝑡 ∈ ℕ (𝑁 = (𝑠 / 𝑡) ∧ 𝑤 = (sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑠}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑃𝑛) ∥ 𝑡}, ℝ, < )))))
6362eu4 2646 . 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 2146  ∃!weu 2599  wne 2961  wrex 3092  {crab 3419   class class class wbr 5114  (class class class)co 7423  supcsup 9410  cr 11117  0cc0 11118   < clt 11261  cmin 11459   / cdiv 11889  cn 12251  0cn0 12522  cz 12609  cq 12990  cexp 14117  cdvds 16335  cprime 16754
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745  ax-cnex 11174  ax-resscn 11175  ax-1cn 11176  ax-icn 11177  ax-addcl 11178  ax-addrcl 11179  ax-mulcl 11180  ax-mulrcl 11181  ax-mulcom 11182  ax-addass 11183  ax-mulass 11184  ax-distr 11185  ax-i2m1 11186  ax-1ne0 11187  ax-1rid 11188  ax-rnegex 11189  ax-rrecex 11190  ax-cnre 11191  ax-pre-lttri 11192  ax-pre-lttrn 11193  ax-pre-ltadd 11194  ax-pre-mulgt0 11195  ax-pre-sup 11196
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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-nel 3068  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-ord 6370  df-on 6371  df-lim 6372  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-om 7872  df-1st 7995  df-2nd 7996  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-rdg 8406  df-1o 8462  df-2o 8463  df-er 8703  df-en 8953  df-dom 8954  df-sdom 8955  df-fin 8956  df-sup 9412  df-inf 9413  df-pnf 11263  df-mnf 11264  df-xr 11265  df-ltxr 11266  df-le 11267  df-sub 11461  df-neg 11462  df-div 11890  df-nn 12252  df-2 12321  df-3 12322  df-n0 12523  df-z 12610  df-uz 12881  df-q 12991  df-rp 13035  df-fl 13845  df-mod 13923  df-seq 14058  df-exp 14118  df-cj 15176  df-re 15177  df-im 15178  df-sqrt 15312  df-abs 15313  df-dvds 16336  df-gcd 16578  df-prm 16755
This theorem is used by:  pczpre  16932  pcdiv  16937
  Copyright terms: Public domain W3C validator