pczndvds - Metamath Proof Explorer

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

Theorem pczndvds 16835

Description: Defining property of the prime count function. (Contributed by Mario Carneiro, 3-Oct-2014.)

**Assertion**
Ref	Expression
pczndvds	⊢ ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ¬ (𝑃↑((𝑃 pCnt 𝑁) + 1)) ∥ 𝑁)

Proof of Theorem pczndvds Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2725	. . . . 5 ⊢ sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝑁}, ℝ, < ) = sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝑁}, ℝ, < )
2	1	pczpre 16817	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑃 pCnt 𝑁) = sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝑁}, ℝ, < ))
3	2	oveq1d 7433	. . 3 ⊢ ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ((𝑃 pCnt 𝑁) + 1) = (sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝑁}, ℝ, < ) + 1))
4	3	oveq2d 7434	. 2 ⊢ ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑃↑((𝑃 pCnt 𝑁) + 1)) = (𝑃↑(sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝑁}, ℝ, < ) + 1)))
5		prmuz2 16668	. . 3 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ (ℤ_≥‘2))
6		eqid 2725	. . . 4 ⊢ {𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝑁} = {𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝑁}
7	6, 1	pcprendvds 16810	. . 3 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ¬ (𝑃↑(sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝑁}, ℝ, < ) + 1)) ∥ 𝑁)
8	5, 7	sylan 578	. 2 ⊢ ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ¬ (𝑃↑(sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝑁}, ℝ, < ) + 1)) ∥ 𝑁)
9	4, 8	eqnbrtrd 5167	1 ⊢ ((𝑃 ∈ ℙ ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ¬ (𝑃↑((𝑃 pCnt 𝑁) + 1)) ∥ 𝑁)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 394 ∈ wcel 2098 ≠ wne 2929 {crab 3418 class class class wbr 5149 ‘cfv 6548 (class class class)co 7418 supcsup 9464 ℝcr 11138 0cc0 11139 1c1 11140 + caddc 11142 < clt 11279 2c2 12298 ℕ₀cn0 12503 ℤcz 12589 ℤ_≥cuz 12853 ↑cexp 14060 ∥ cdvds 16232 ℙcprime 16643 pCnt cpc 16806

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5300 ax-nul 5307 ax-pow 5365 ax-pr 5429 ax-un 7740 ax-cnex 11195 ax-resscn 11196 ax-1cn 11197 ax-icn 11198 ax-addcl 11199 ax-addrcl 11200 ax-mulcl 11201 ax-mulrcl 11202 ax-mulcom 11203 ax-addass 11204 ax-mulass 11205 ax-distr 11206 ax-i2m1 11207 ax-1ne0 11208 ax-1rid 11209 ax-rnegex 11210 ax-rrecex 11211 ax-cnre 11212 ax-pre-lttri 11213 ax-pre-lttrn 11214 ax-pre-ltadd 11215 ax-pre-mulgt0 11216 ax-pre-sup 11217

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2930 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3363 df-reu 3364 df-rab 3419 df-v 3463 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3964 df-nul 4323 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4910 df-iun 4999 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6306 df-ord 6373 df-on 6374 df-lim 6375 df-suc 6376 df-iota 6500 df-fun 6550 df-fn 6551 df-f 6552 df-f1 6553 df-fo 6554 df-f1o 6555 df-fv 6556 df-riota 7374 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7871 df-1st 7993 df-2nd 7994 df-frecs 8286 df-wrecs 8317 df-recs 8391 df-rdg 8430 df-1o 8486 df-2o 8487 df-er 8724 df-en 8964 df-dom 8965 df-sdom 8966 df-fin 8967 df-sup 9466 df-inf 9467 df-pnf 11281 df-mnf 11282 df-xr 11283 df-ltxr 11284 df-le 11285 df-sub 11477 df-neg 11478 df-div 11903 df-nn 12244 df-2 12306 df-3 12307 df-n0 12504 df-z 12590 df-uz 12854 df-q 12964 df-rp 13008 df-fl 13791 df-mod 13869 df-seq 14001 df-exp 14061 df-cj 15080 df-re 15081 df-im 15082 df-sqrt 15216 df-abs 15217 df-dvds 16233 df-gcd 16471 df-prm 16644 df-pc 16807

This theorem is referenced by: pcndvds 16836 pcdvdsb 16839

W3C validator

	
		OSZAR »