oddprmdvds - Metamath Proof Explorer

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

Theorem oddprmdvds 16840

Description: Every positive integer which is not a power of two is divisible by an odd prime number. (Contributed by AV, 6-Aug-2021.)

**Assertion**
Ref	Expression
oddprmdvds	⊢ ((𝐾 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛)) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)

Distinct variable group: 𝑛,𝐾,𝑝

Proof of Theorem oddprmdvds Dummy variables 𝑚 𝑞 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		2prm 16633	. . . 4 ⊢ 2 ∈ ℙ
2		pcndvds2 16805	. . . 4 ⊢ ((2 ∈ ℙ ∧ 𝐾 ∈ ℕ) → ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))))
3	1, 2	mpan 686	. . 3 ⊢ (𝐾 ∈ ℕ → ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))))
4		pcdvds 16801	. . . 4 ⊢ ((2 ∈ ℙ ∧ 𝐾 ∈ ℕ) → (2↑(2 pCnt 𝐾)) ∥ 𝐾)
5	1, 4	mpan 686	. . 3 ⊢ (𝐾 ∈ ℕ → (2↑(2 pCnt 𝐾)) ∥ 𝐾)
6		2nn 12289	. . . . . . . . 9 ⊢ 2 ∈ ℕ
7	6	a1i 11	. . . . . . . 8 ⊢ (𝐾 ∈ ℕ → 2 ∈ ℕ)
8	1	a1i 11	. . . . . . . . 9 ⊢ (𝐾 ∈ ℕ → 2 ∈ ℙ)
9		id 22	. . . . . . . . 9 ⊢ (𝐾 ∈ ℕ → 𝐾 ∈ ℕ)
10	8, 9	pccld 16787	. . . . . . . 8 ⊢ (𝐾 ∈ ℕ → (2 pCnt 𝐾) ∈ ℕ₀)
11	7, 10	nnexpcld 14212	. . . . . . 7 ⊢ (𝐾 ∈ ℕ → (2↑(2 pCnt 𝐾)) ∈ ℕ)
12		nndivdvds 16210	. . . . . . 7 ⊢ ((𝐾 ∈ ℕ ∧ (2↑(2 pCnt 𝐾)) ∈ ℕ) → ((2↑(2 pCnt 𝐾)) ∥ 𝐾 ↔ (𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ))
13	11, 12	mpdan 683	. . . . . 6 ⊢ (𝐾 ∈ ℕ → ((2↑(2 pCnt 𝐾)) ∥ 𝐾 ↔ (𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ))
14	13	adantr 479	. . . . 5 ⊢ ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → ((2↑(2 pCnt 𝐾)) ∥ 𝐾 ↔ (𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ))
15		elnn1uz2 12913	. . . . . . 7 ⊢ ((𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ ↔ ((𝐾 / (2↑(2 pCnt 𝐾))) = 1 ∨ (𝐾 / (2↑(2 pCnt 𝐾))) ∈ (ℤ_≥‘2)))
16		nncn 12224	. . . . . . . . . . . . 13 ⊢ (𝐾 ∈ ℕ → 𝐾 ∈ ℂ)
17		nncn 12224	. . . . . . . . . . . . . . 15 ⊢ ((2↑(2 pCnt 𝐾)) ∈ ℕ → (2↑(2 pCnt 𝐾)) ∈ ℂ)
18		nnne0 12250	. . . . . . . . . . . . . . 15 ⊢ ((2↑(2 pCnt 𝐾)) ∈ ℕ → (2↑(2 pCnt 𝐾)) ≠ 0)
19	17, 18	jca 510	. . . . . . . . . . . . . 14 ⊢ ((2↑(2 pCnt 𝐾)) ∈ ℕ → ((2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0))
20	11, 19	syl 17	. . . . . . . . . . . . 13 ⊢ (𝐾 ∈ ℕ → ((2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0))
21		3anass 1093	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0) ↔ (𝐾 ∈ ℂ ∧ ((2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0)))
22	16, 20, 21	sylanbrc 581	. . . . . . . . . . . 12 ⊢ (𝐾 ∈ ℕ → (𝐾 ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0))
23	22	adantr 479	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (𝐾 ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0))
24		diveq1 11909	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0) → ((𝐾 / (2↑(2 pCnt 𝐾))) = 1 ↔ 𝐾 = (2↑(2 pCnt 𝐾))))
25	23, 24	syl 17	. . . . . . . . . 10 ⊢ ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → ((𝐾 / (2↑(2 pCnt 𝐾))) = 1 ↔ 𝐾 = (2↑(2 pCnt 𝐾))))
26	10	adantr 479	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ ℕ ∧ 𝐾 = (2↑(2 pCnt 𝐾))) → (2 pCnt 𝐾) ∈ ℕ₀)
27		oveq2 7419	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = (2 pCnt 𝐾) → (2↑𝑛) = (2↑(2 pCnt 𝐾)))
28	27	eqeq2d 2741	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = (2 pCnt 𝐾) → (𝐾 = (2↑𝑛) ↔ 𝐾 = (2↑(2 pCnt 𝐾))))
29	28	adantl 480	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ ℕ ∧ 𝐾 = (2↑(2 pCnt 𝐾))) ∧ 𝑛 = (2 pCnt 𝐾)) → (𝐾 = (2↑𝑛) ↔ 𝐾 = (2↑(2 pCnt 𝐾))))
30		simpr 483	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ ℕ ∧ 𝐾 = (2↑(2 pCnt 𝐾))) → 𝐾 = (2↑(2 pCnt 𝐾)))
31	26, 29, 30	rspcedvd 3613	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ ℕ ∧ 𝐾 = (2↑(2 pCnt 𝐾))) → ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛))
32	31	ex 411	. . . . . . . . . . . 12 ⊢ (𝐾 ∈ ℕ → (𝐾 = (2↑(2 pCnt 𝐾)) → ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛)))
33		pm2.24 124	. . . . . . . . . . . 12 ⊢ (∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))
34	32, 33	syl6 35	. . . . . . . . . . 11 ⊢ (𝐾 ∈ ℕ → (𝐾 = (2↑(2 pCnt 𝐾)) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)))
35	34	adantr 479	. . . . . . . . . 10 ⊢ ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (𝐾 = (2↑(2 pCnt 𝐾)) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)))
36	25, 35	sylbid 239	. . . . . . . . 9 ⊢ ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → ((𝐾 / (2↑(2 pCnt 𝐾))) = 1 → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)))
37	36	com12 32	. . . . . . . 8 ⊢ ((𝐾 / (2↑(2 pCnt 𝐾))) = 1 → ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)))
38		exprmfct 16645	. . . . . . . . 9 ⊢ ((𝐾 / (2↑(2 pCnt 𝐾))) ∈ (ℤ_≥‘2) → ∃𝑞 ∈ ℙ 𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))))
39		breq1 5150	. . . . . . . . . . . . . . . . 17 ⊢ (𝑞 = 2 → (𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) ↔ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))))
40	39	biimpcd 248	. . . . . . . . . . . . . . . 16 ⊢ (𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → (𝑞 = 2 → 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))))
41	40	adantl 480	. . . . . . . . . . . . . . 15 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (𝑞 = 2 → 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))))
42	41	necon3bd 2952	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → 𝑞 ≠ 2))
43	42	ex 411	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) → (𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → (¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → 𝑞 ≠ 2)))
44		prmnn 16615	. . . . . . . . . . . . . . 15 ⊢ (𝑞 ∈ ℙ → 𝑞 ∈ ℕ)
45	5, 13	mpbid 231	. . . . . . . . . . . . . . 15 ⊢ (𝐾 ∈ ℕ → (𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ)
46		nndivides 16211	. . . . . . . . . . . . . . 15 ⊢ ((𝑞 ∈ ℕ ∧ (𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ) → (𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) ↔ ∃𝑚 ∈ ℕ (𝑚 · 𝑞) = (𝐾 / (2↑(2 pCnt 𝐾)))))
47	44, 45, 46	syl2anr 595	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) → (𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) ↔ ∃𝑚 ∈ ℕ (𝑚 · 𝑞) = (𝐾 / (2↑(2 pCnt 𝐾)))))
48		eqcom 2737	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑚 · 𝑞) = (𝐾 / (2↑(2 pCnt 𝐾))) ↔ (𝐾 / (2↑(2 pCnt 𝐾))) = (𝑚 · 𝑞))
49	16	ad2antrr 722	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝐾 ∈ ℂ)
50		simpr 483	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝑚 ∈ ℕ)
51	44	ad2antlr 723	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝑞 ∈ ℕ)
52	50, 51	nnmulcld 12269	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (𝑚 · 𝑞) ∈ ℕ)
53	52	nncnd 12232	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (𝑚 · 𝑞) ∈ ℂ)
54	11	ad2antrr 722	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (2↑(2 pCnt 𝐾)) ∈ ℕ)
55	54, 19	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → ((2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0))
56		divmul 11879	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐾 ∈ ℂ ∧ (𝑚 · 𝑞) ∈ ℂ ∧ ((2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0)) → ((𝐾 / (2↑(2 pCnt 𝐾))) = (𝑚 · 𝑞) ↔ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾))
57	49, 53, 55, 56	syl3anc 1369	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → ((𝐾 / (2↑(2 pCnt 𝐾))) = (𝑚 · 𝑞) ↔ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾))
58	48, 57	bitrid 282	. . . . . . . . . . . . . . . 16 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → ((𝑚 · 𝑞) = (𝐾 / (2↑(2 pCnt 𝐾))) ↔ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾))
59		simpr 483	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) → 𝑞 ∈ ℙ)
60	59	adantr 479	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝑞 ∈ ℙ)
61	60	anim1i 613	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) → (𝑞 ∈ ℙ ∧ 𝑞 ≠ 2))
62		eldifsn 4789	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑞 ∈ (ℙ ∖ {2}) ↔ (𝑞 ∈ ℙ ∧ 𝑞 ≠ 2))
63	61, 62	sylibr 233	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) → 𝑞 ∈ (ℙ ∖ {2}))
64	63	adantr 479	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) → 𝑞 ∈ (ℙ ∖ {2}))
65		breq1 5150	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑝 = 𝑞 → (𝑝 ∥ 𝐾 ↔ 𝑞 ∥ 𝐾))
66	65	adantl 480	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) ∧ 𝑝 = 𝑞) → (𝑝 ∥ 𝐾 ↔ 𝑞 ∥ 𝐾))
67	54, 50	nnmulcld 12269	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → ((2↑(2 pCnt 𝐾)) · 𝑚) ∈ ℕ)
68	67	nnzd 12589	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → ((2↑(2 pCnt 𝐾)) · 𝑚) ∈ ℤ)
69	44	nnzd 12589	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑞 ∈ ℙ → 𝑞 ∈ ℤ)
70	69	ad2antlr 723	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝑞 ∈ ℤ)
71	68, 70	jca 510	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (((2↑(2 pCnt 𝐾)) · 𝑚) ∈ ℤ ∧ 𝑞 ∈ ℤ))
72	71	adantr 479	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) → (((2↑(2 pCnt 𝐾)) · 𝑚) ∈ ℤ ∧ 𝑞 ∈ ℤ))
73		dvdsmul2 16226	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((((2↑(2 pCnt 𝐾)) · 𝑚) ∈ ℤ ∧ 𝑞 ∈ ℤ) → 𝑞 ∥ (((2↑(2 pCnt 𝐾)) · 𝑚) · 𝑞))
74	72, 73	syl 17	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) → 𝑞 ∥ (((2↑(2 pCnt 𝐾)) · 𝑚) · 𝑞))
75		2nn0 12493	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ 2 ∈ ℕ₀
76	75	a1i 11	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝐾 ∈ ℕ → 2 ∈ ℕ₀)
77	76, 10	nn0expcld 14213	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝐾 ∈ ℕ → (2↑(2 pCnt 𝐾)) ∈ ℕ₀)
78	77	ad2antrr 722	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (2↑(2 pCnt 𝐾)) ∈ ℕ₀)
79	78	nn0cnd 12538	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (2↑(2 pCnt 𝐾)) ∈ ℂ)
80		nncn 12224	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑚 ∈ ℕ → 𝑚 ∈ ℂ)
81	80	adantl 480	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝑚 ∈ ℂ)
82	44	nncnd 12232	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑞 ∈ ℙ → 𝑞 ∈ ℂ)
83	82	ad2antlr 723	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝑞 ∈ ℂ)
84	79, 81, 83	3jca 1126	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → ((2↑(2 pCnt 𝐾)) ∈ ℂ ∧ 𝑚 ∈ ℂ ∧ 𝑞 ∈ ℂ))
85	84	adantr 479	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) → ((2↑(2 pCnt 𝐾)) ∈ ℂ ∧ 𝑚 ∈ ℂ ∧ 𝑞 ∈ ℂ))
86		mulass 11200	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((2↑(2 pCnt 𝐾)) ∈ ℂ ∧ 𝑚 ∈ ℂ ∧ 𝑞 ∈ ℂ) → (((2↑(2 pCnt 𝐾)) · 𝑚) · 𝑞) = ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)))
87	85, 86	syl 17	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) → (((2↑(2 pCnt 𝐾)) · 𝑚) · 𝑞) = ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)))
88	74, 87	breqtrd 5173	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) → 𝑞 ∥ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)))
89	88	adantr 479	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) → 𝑞 ∥ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)))
90		breq2 5151	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾 → (𝑞 ∥ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) ↔ 𝑞 ∥ 𝐾))
91	90	adantl 480	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) → (𝑞 ∥ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) ↔ 𝑞 ∥ 𝐾))
92	89, 91	mpbid 231	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) → 𝑞 ∥ 𝐾)
93	64, 66, 92	rspcedvd 3613	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)
94	93	a1d 25	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))
95	94	exp31 418	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (𝑞 ≠ 2 → (((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾 → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))))
96	95	com23 86	. . . . . . . . . . . . . . . 16 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾 → (𝑞 ≠ 2 → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))))
97	58, 96	sylbid 239	. . . . . . . . . . . . . . 15 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → ((𝑚 · 𝑞) = (𝐾 / (2↑(2 pCnt 𝐾))) → (𝑞 ≠ 2 → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))))
98	97	rexlimdva 3153	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) → (∃𝑚 ∈ ℕ (𝑚 · 𝑞) = (𝐾 / (2↑(2 pCnt 𝐾))) → (𝑞 ≠ 2 → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))))
99	47, 98	sylbid 239	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) → (𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → (𝑞 ≠ 2 → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))))
100	43, 99	syldd 72	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) → (𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → (¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))))
101	100	rexlimdva 3153	. . . . . . . . . . 11 ⊢ (𝐾 ∈ ℕ → (∃𝑞 ∈ ℙ 𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → (¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))))
102	101	com12 32	. . . . . . . . . 10 ⊢ (∃𝑞 ∈ ℙ 𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → (𝐾 ∈ ℕ → (¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))))
103	102	impd 409	. . . . . . . . 9 ⊢ (∃𝑞 ∈ ℙ 𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)))
104	38, 103	syl 17	. . . . . . . 8 ⊢ ((𝐾 / (2↑(2 pCnt 𝐾))) ∈ (ℤ_≥‘2) → ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)))
105	37, 104	jaoi 853	. . . . . . 7 ⊢ (((𝐾 / (2↑(2 pCnt 𝐾))) = 1 ∨ (𝐾 / (2↑(2 pCnt 𝐾))) ∈ (ℤ_≥‘2)) → ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)))
106	15, 105	sylbi 216	. . . . . 6 ⊢ ((𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ → ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)))
107	106	com12 32	. . . . 5 ⊢ ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → ((𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)))
108	14, 107	sylbid 239	. . . 4 ⊢ ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → ((2↑(2 pCnt 𝐾)) ∥ 𝐾 → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)))
109	108	ex 411	. . 3 ⊢ (𝐾 ∈ ℕ → (¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → ((2↑(2 pCnt 𝐾)) ∥ 𝐾 → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))))
110	3, 5, 109	mp2d 49	. 2 ⊢ (𝐾 ∈ ℕ → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))
111	110	imp 405	1 ⊢ ((𝐾 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛)) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 394 ∨ wo 843 ∧ w3a 1085 = wceq 1539 ∈ wcel 2104 ≠ wne 2938 ∃wrex 3068 ∖ cdif 3944 {csn 4627 class class class wbr 5147 ‘cfv 6542 (class class class)co 7411 ℂcc 11110 0cc0 11112 1c1 11113 · cmul 11117 / cdiv 11875 ℕcn 12216 2c2 12271 ℕ₀cn0 12476 ℤcz 12562 ℤ_≥cuz 12826 ↑cexp 14031 ∥ cdvds 16201 ℙcprime 16612 pCnt cpc 16773

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-pre-sup 11190

This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-1o 8468 df-2o 8469 df-er 8705 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-sup 9439 df-inf 9440 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-div 11876 df-nn 12217 df-2 12279 df-3 12280 df-n0 12477 df-z 12563 df-uz 12827 df-q 12937 df-rp 12979 df-fz 13489 df-fl 13761 df-mod 13839 df-seq 13971 df-exp 14032 df-cj 15050 df-re 15051 df-im 15052 df-sqrt 15186 df-abs 15187 df-dvds 16202 df-gcd 16440 df-prm 16613 df-pc 16774

This theorem is referenced by: 2pwp1prm 46555

W3C validator