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 16964

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 16751	. . . 4 ⊢ 2 ∈ ℙ
2		pcndvds2 16929	. . . 4 ⊢ ((2 ∈ ℙ ∧ 𝐾 ∈ ℕ) → ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))))
3	1, 2	mpan 702	. . 3 ⊢ (𝐾 ∈ ℕ → ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))))
4		pcdvds 16925	. . . 4 ⊢ ((2 ∈ ℙ ∧ 𝐾 ∈ ℕ) → (2↑(2 pCnt 𝐾)) ∥ 𝐾)
5	1, 4	mpan 702	. . 3 ⊢ (𝐾 ∈ ℕ → (2↑(2 pCnt 𝐾)) ∥ 𝐾)
6		2nn 12315	. . . . . . . . 9 ⊢ 2 ∈ ℕ
7	6	a1i 11	. . . . . . . 8 ⊢ (𝐾 ∈ ℕ → 2 ∈ ℕ)
8	1	a1i 11	. . . . . . . . 9 ⊢ (𝐾 ∈ ℕ → 2 ∈ ℙ)
9		id 23	. . . . . . . . 9 ⊢ (𝐾 ∈ ℕ → 𝐾 ∈ ℕ)
10	8, 9	pccld 16911	. . . . . . . 8 ⊢ (𝐾 ∈ ℕ → (2 pCnt 𝐾) ∈ ℕ₀)
11	7, 10	nnexpcld 14283	. . . . . . 7 ⊢ (𝐾 ∈ ℕ → (2↑(2 pCnt 𝐾)) ∈ ℕ)
12		nndivdvds 16320	. . . . . . 7 ⊢ ((𝐾 ∈ ℕ ∧ (2↑(2 pCnt 𝐾)) ∈ ℕ) → ((2↑(2 pCnt 𝐾)) ∥ 𝐾 ↔ (𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ))
13	11, 12	mpdan 699	. . . . . 6 ⊢ (𝐾 ∈ ℕ → ((2↑(2 pCnt 𝐾)) ∥ 𝐾 ↔ (𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ))
14	13	adantr 485	. . . . 5 ⊢ ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → ((2↑(2 pCnt 𝐾)) ∥ 𝐾 ↔ (𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ))
15		elnn1uz2 12950	. . . . . . 7 ⊢ ((𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ ↔ ((𝐾 / (2↑(2 pCnt 𝐾))) = 1 ∨ (𝐾 / (2↑(2 pCnt 𝐾))) ∈ (ℤ_≥‘2)))
16		nncn 12242	. . . . . . . . . . . . 13 ⊢ (𝐾 ∈ ℕ → 𝐾 ∈ ℂ)
17		nncn 12242	. . . . . . . . . . . . . . 15 ⊢ ((2↑(2 pCnt 𝐾)) ∈ ℕ → (2↑(2 pCnt 𝐾)) ∈ ℂ)
18		nnne0 12271	. . . . . . . . . . . . . . 15 ⊢ ((2↑(2 pCnt 𝐾)) ∈ ℕ → (2↑(2 pCnt 𝐾)) ≠ 0)
19	17, 18	jca 520	. . . . . . . . . . . . . 14 ⊢ ((2↑(2 pCnt 𝐾)) ∈ ℕ → ((2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0))
20	11, 19	syl 18	. . . . . . . . . . . . 13 ⊢ (𝐾 ∈ ℕ → ((2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0))
21		3anass 1111	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0) ↔ (𝐾 ∈ ℂ ∧ ((2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0)))
22	16, 20, 21	sylanbrc 594	. . . . . . . . . . . 12 ⊢ (𝐾 ∈ ℕ → (𝐾 ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0))
23	22	adantr 485	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (𝐾 ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0))
24		diveq1 11902	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0) → ((𝐾 / (2↑(2 pCnt 𝐾))) = 1 ↔ 𝐾 = (2↑(2 pCnt 𝐾))))
25	23, 24	syl 18	. . . . . . . . . 10 ⊢ ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → ((𝐾 / (2↑(2 pCnt 𝐾))) = 1 ↔ 𝐾 = (2↑(2 pCnt 𝐾))))
26	10	adantr 485	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ ℕ ∧ 𝐾 = (2↑(2 pCnt 𝐾))) → (2 pCnt 𝐾) ∈ ℕ₀)
27		oveq2 7420	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = (2 pCnt 𝐾) → (2↑𝑛) = (2↑(2 pCnt 𝐾)))
28	27	eqeq2d 2774	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = (2 pCnt 𝐾) → (𝐾 = (2↑𝑛) ↔ 𝐾 = (2↑(2 pCnt 𝐾))))
29	28	adantl 486	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ ℕ ∧ 𝐾 = (2↑(2 pCnt 𝐾))) ∧ 𝑛 = (2 pCnt 𝐾)) → (𝐾 = (2↑𝑛) ↔ 𝐾 = (2↑(2 pCnt 𝐾))))
30		simpr 489	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ ℕ ∧ 𝐾 = (2↑(2 pCnt 𝐾))) → 𝐾 = (2↑(2 pCnt 𝐾)))
31	26, 29, 30	rspcedvd 3584	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ ℕ ∧ 𝐾 = (2↑(2 pCnt 𝐾))) → ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛))
32	31	ex 417	. . . . . . . . . . . 12 ⊢ (𝐾 ∈ ℕ → (𝐾 = (2↑(2 pCnt 𝐾)) → ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛)))
33		pm2.24 125	. . . . . . . . . . . 12 ⊢ (∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))
34	32, 33	syl6 36	. . . . . . . . . . 11 ⊢ (𝐾 ∈ ℕ → (𝐾 = (2↑(2 pCnt 𝐾)) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)))
35	34	adantr 485	. . . . . . . . . 10 ⊢ ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (𝐾 = (2↑(2 pCnt 𝐾)) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)))
36	25, 35	sylbid 243	. . . . . . . . 9 ⊢ ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → ((𝐾 / (2↑(2 pCnt 𝐾))) = 1 → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)))
37	36	com12 33	. . . . . . . 8 ⊢ ((𝐾 / (2↑(2 pCnt 𝐾))) = 1 → ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)))
38		exprmfct 16764	. . . . . . . . 9 ⊢ ((𝐾 / (2↑(2 pCnt 𝐾))) ∈ (ℤ_≥‘2) → ∃𝑞 ∈ ℙ 𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))))
39		breq1 5113	. . . . . . . . . . . . . . . . 17 ⊢ (𝑞 = 2 → (𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) ↔ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))))
40	39	biimpcd 252	. . . . . . . . . . . . . . . 16 ⊢ (𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → (𝑞 = 2 → 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))))
41	40	adantl 486	. . . . . . . . . . . . . . 15 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (𝑞 = 2 → 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))))
42	41	necon3bd 2972	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → 𝑞 ≠ 2))
43	42	ex 417	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) → (𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → (¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → 𝑞 ≠ 2)))
44		prmnn 16733	. . . . . . . . . . . . . . 15 ⊢ (𝑞 ∈ ℙ → 𝑞 ∈ ℕ)
45	5, 13	mpbid 235	. . . . . . . . . . . . . . 15 ⊢ (𝐾 ∈ ℕ → (𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ)
46		nndivides 16321	. . . . . . . . . . . . . . 15 ⊢ ((𝑞 ∈ ℕ ∧ (𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ) → (𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) ↔ ∃𝑚 ∈ ℕ (𝑚 · 𝑞) = (𝐾 / (2↑(2 pCnt 𝐾)))))
47	44, 45, 46	syl2anr 608	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) → (𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) ↔ ∃𝑚 ∈ ℕ (𝑚 · 𝑞) = (𝐾 / (2↑(2 pCnt 𝐾)))))
48		eqcom 2770	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑚 · 𝑞) = (𝐾 / (2↑(2 pCnt 𝐾))) ↔ (𝐾 / (2↑(2 pCnt 𝐾))) = (𝑚 · 𝑞))
49	16	ad2antrr 738	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝐾 ∈ ℂ)
50		simpr 489	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝑚 ∈ ℕ)
51	44	ad2antlr 739	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝑞 ∈ ℕ)
52	50, 51	nnmulcld 12290	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (𝑚 · 𝑞) ∈ ℕ)
53	52	nncnd 12250	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (𝑚 · 𝑞) ∈ ℂ)
54	11	ad2antrr 738	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (2↑(2 pCnt 𝐾)) ∈ ℕ)
55	54, 19	syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → ((2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0))
56		divmul 11876	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐾 ∈ ℂ ∧ (𝑚 · 𝑞) ∈ ℂ ∧ ((2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0)) → ((𝐾 / (2↑(2 pCnt 𝐾))) = (𝑚 · 𝑞) ↔ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾))
57	49, 53, 55, 56	syl3anc 1398	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → ((𝐾 / (2↑(2 pCnt 𝐾))) = (𝑚 · 𝑞) ↔ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾))
58	48, 57	bitrid 286	. . . . . . . . . . . . . . . 16 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → ((𝑚 · 𝑞) = (𝐾 / (2↑(2 pCnt 𝐾))) ↔ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾))
59		simpr 489	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) → 𝑞 ∈ ℙ)
60	59	adantr 485	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝑞 ∈ ℙ)
61	60	anim1i 626	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) → (𝑞 ∈ ℙ ∧ 𝑞 ≠ 2))
62		eldifsn 4754	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑞 ∈ (ℙ ∖ {2}) ↔ (𝑞 ∈ ℙ ∧ 𝑞 ≠ 2))
63	61, 62	sylibr 237	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) → 𝑞 ∈ (ℙ ∖ {2}))
64	63	adantr 485	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) → 𝑞 ∈ (ℙ ∖ {2}))
65		breq1 5113	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑝 = 𝑞 → (𝑝 ∥ 𝐾 ↔ 𝑞 ∥ 𝐾))
66	65	adantl 486	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) ∧ 𝑝 = 𝑞) → (𝑝 ∥ 𝐾 ↔ 𝑞 ∥ 𝐾))
67	54, 50	nnmulcld 12290	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → ((2↑(2 pCnt 𝐾)) · 𝑚) ∈ ℕ)
68	67	nnzd 12618	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → ((2↑(2 pCnt 𝐾)) · 𝑚) ∈ ℤ)
69	44	nnzd 12618	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑞 ∈ ℙ → 𝑞 ∈ ℤ)
70	69	ad2antlr 739	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝑞 ∈ ℤ)
71	68, 70	jca 520	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (((2↑(2 pCnt 𝐾)) · 𝑚) ∈ ℤ ∧ 𝑞 ∈ ℤ))
72	71	adantr 485	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) → (((2↑(2 pCnt 𝐾)) · 𝑚) ∈ ℤ ∧ 𝑞 ∈ ℤ))
73		dvdsmul2 16337	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((((2↑(2 pCnt 𝐾)) · 𝑚) ∈ ℤ ∧ 𝑞 ∈ ℤ) → 𝑞 ∥ (((2↑(2 pCnt 𝐾)) · 𝑚) · 𝑞))
74	72, 73	syl 18	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) → 𝑞 ∥ (((2↑(2 pCnt 𝐾)) · 𝑚) · 𝑞))
75		2nn0 12522	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ 2 ∈ ℕ₀
76	75	a1i 11	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝐾 ∈ ℕ → 2 ∈ ℕ₀)
77	76, 10	nn0expcld 14284	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝐾 ∈ ℕ → (2↑(2 pCnt 𝐾)) ∈ ℕ₀)
78	77	ad2antrr 738	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (2↑(2 pCnt 𝐾)) ∈ ℕ₀)
79	78	nn0cnd 12568	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (2↑(2 pCnt 𝐾)) ∈ ℂ)
80		nncn 12242	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑚 ∈ ℕ → 𝑚 ∈ ℂ)
81	80	adantl 486	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝑚 ∈ ℂ)
82	44	nncnd 12250	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑞 ∈ ℙ → 𝑞 ∈ ℂ)
83	82	ad2antlr 739	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝑞 ∈ ℂ)
84	79, 81, 83	3jca 1146	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → ((2↑(2 pCnt 𝐾)) ∈ ℂ ∧ 𝑚 ∈ ℂ ∧ 𝑞 ∈ ℂ))
85	84	adantr 485	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) → ((2↑(2 pCnt 𝐾)) ∈ ℂ ∧ 𝑚 ∈ ℂ ∧ 𝑞 ∈ ℂ))
86		mulass 11189	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((2↑(2 pCnt 𝐾)) ∈ ℂ ∧ 𝑚 ∈ ℂ ∧ 𝑞 ∈ ℂ) → (((2↑(2 pCnt 𝐾)) · 𝑚) · 𝑞) = ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)))
87	85, 86	syl 18	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) → (((2↑(2 pCnt 𝐾)) · 𝑚) · 𝑞) = ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)))
88	74, 87	breqtrd 5138	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) → 𝑞 ∥ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)))
89	88	adantr 485	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) → 𝑞 ∥ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)))
90		breq2 5114	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾 → (𝑞 ∥ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) ↔ 𝑞 ∥ 𝐾))
91	90	adantl 486	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) → (𝑞 ∥ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) ↔ 𝑞 ∥ 𝐾))
92	89, 91	mpbid 235	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) → 𝑞 ∥ 𝐾)
93	64, 66, 92	rspcedvd 3584	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)
94	93	a1d 26	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))
95	94	exp31 424	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (𝑞 ≠ 2 → (((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾 → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))))
96	95	com23 87	. . . . . . . . . . . . . . . 16 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾 → (𝑞 ≠ 2 → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))))
97	58, 96	sylbid 243	. . . . . . . . . . . . . . 15 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → ((𝑚 · 𝑞) = (𝐾 / (2↑(2 pCnt 𝐾))) → (𝑞 ≠ 2 → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))))
98	97	rexlimdva 3166	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) → (∃𝑚 ∈ ℕ (𝑚 · 𝑞) = (𝐾 / (2↑(2 pCnt 𝐾))) → (𝑞 ≠ 2 → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))))
99	47, 98	sylbid 243	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) → (𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → (𝑞 ≠ 2 → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))))
100	43, 99	syldd 73	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) → (𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → (¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))))
101	100	rexlimdva 3166	. . . . . . . . . . 11 ⊢ (𝐾 ∈ ℕ → (∃𝑞 ∈ ℙ 𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → (¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))))
102	101	com12 33	. . . . . . . . . 10 ⊢ (∃𝑞 ∈ ℙ 𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → (𝐾 ∈ ℕ → (¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))))
103	102	impd 415	. . . . . . . . 9 ⊢ (∃𝑞 ∈ ℙ 𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)))
104	38, 103	syl 18	. . . . . . . 8 ⊢ ((𝐾 / (2↑(2 pCnt 𝐾))) ∈ (ℤ_≥‘2) → ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)))
105	37, 104	jaoi 870	. . . . . . 7 ⊢ (((𝐾 / (2↑(2 pCnt 𝐾))) = 1 ∨ (𝐾 / (2↑(2 pCnt 𝐾))) ∈ (ℤ_≥‘2)) → ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)))
106	15, 105	sylbi 220	. . . . . 6 ⊢ ((𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ → ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)))
107	106	com12 33	. . . . 5 ⊢ ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → ((𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)))
108	14, 107	sylbid 243	. . . 4 ⊢ ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → ((2↑(2 pCnt 𝐾)) ∥ 𝐾 → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)))
109	108	ex 417	. . 3 ⊢ (𝐾 ∈ ℕ → (¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → ((2↑(2 pCnt 𝐾)) ∥ 𝐾 → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))))
110	3, 5, 109	mp2d 50	. 2 ⊢ (𝐾 ∈ ℕ → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))
111	110	imp 411	1 ⊢ ((𝐾 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛)) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 ∃wrex 3089 ∖ cdif 3903 {csn 4590 class class class wbr 5110 ‘cfv 6538 (class class class)co 7412 ℂcc 11099 0cc0 11101 1c1 11102 · cmul 11106 / cdiv 11872 ℕcn 12234 2c2 12296 ℕ₀cn0 12505 ℤcz 12592 ℤ_≥cuz 12863 ↑cexp 14099 ∥ cdvds 16311 ℙcprime 16730 pCnt cpc 16897

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 ax-pre-sup 11179

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-1o 8454 df-2o 8455 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-fin 8948 df-sup 9403 df-inf 9404 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-div 11873 df-nn 12235 df-2 12304 df-3 12305 df-n0 12506 df-z 12593 df-uz 12864 df-q 12974 df-rp 13018 df-fz 13537 df-fl 13827 df-mod 13905 df-seq 14040 df-exp 14100 df-cj 15152 df-re 15153 df-im 15154 df-sqrt 15288 df-abs 15289 df-dvds 16312 df-gcd 16554 df-prm 16731 df-pc 16898

This theorem is referenced by: 2pwp1prm 48324

W3C validator