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 17086

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 16872	. . . 4 ⊢ 2 ∈ ℙ
2		pcndvds2 17051	. . . 4 ⊢ ((2 ∈ ℙ ∧ 𝐾 ∈ ℕ) → ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))))
3	1, 2	mpan 703	. . 3 ⊢ (𝐾 ∈ ℕ → ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))))
4		pcdvds 17047	. . . 4 ⊢ ((2 ∈ ℙ ∧ 𝐾 ∈ ℕ) → (2↑(2 pCnt 𝐾)) ∥ 𝐾)
5	1, 4	mpan 703	. . 3 ⊢ (𝐾 ∈ ℕ → (2↑(2 pCnt 𝐾)) ∥ 𝐾)
6		2nn 12419	. . . . . . . . 9 ⊢ 2 ∈ ℕ
7	6	a1i 11	. . . . . . . 8 ⊢ (𝐾 ∈ ℕ → 2 ∈ ℕ)
8	1	a1i 11	. . . . . . . . 9 ⊢ (𝐾 ∈ ℕ → 2 ∈ ℙ)
9		id 23	. . . . . . . . 9 ⊢ (𝐾 ∈ ℕ → 𝐾 ∈ ℕ)
10	8, 9	pccld 17033	. . . . . . . 8 ⊢ (𝐾 ∈ ℕ → (2 pCnt 𝐾) ∈ ℕ₀)
11	7, 10	nnexpcld 14392	. . . . . . 7 ⊢ (𝐾 ∈ ℕ → (2↑(2 pCnt 𝐾)) ∈ ℕ)
12		nndivdvds 16436	. . . . . . 7 ⊢ ((𝐾 ∈ ℕ ∧ (2↑(2 pCnt 𝐾)) ∈ ℕ) → ((2↑(2 pCnt 𝐾)) ∥ 𝐾 ↔ (𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ))
13	11, 12	mpdan 700	. . . . . 6 ⊢ (𝐾 ∈ ℕ → ((2↑(2 pCnt 𝐾)) ∥ 𝐾 ↔ (𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ))
14	13	adantr 486	. . . . 5 ⊢ ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → ((2↑(2 pCnt 𝐾)) ∥ 𝐾 ↔ (𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ))
15		elnn1uz2 13055	. . . . . . 7 ⊢ ((𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ ↔ ((𝐾 / (2↑(2 pCnt 𝐾))) = 1 ∨ (𝐾 / (2↑(2 pCnt 𝐾))) ∈ (ℤ_≥‘2)))
16		nncn 12346	. . . . . . . . . . . . 13 ⊢ (𝐾 ∈ ℕ → 𝐾 ∈ ℂ)
17		nncn 12346	. . . . . . . . . . . . . . 15 ⊢ ((2↑(2 pCnt 𝐾)) ∈ ℕ → (2↑(2 pCnt 𝐾)) ∈ ℂ)
18		nnne0 12375	. . . . . . . . . . . . . . 15 ⊢ ((2↑(2 pCnt 𝐾)) ∈ ℕ → (2↑(2 pCnt 𝐾)) ≠ 0)
19	17, 18	jca 521	. . . . . . . . . . . . . 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 595	. . . . . . . . . . . 12 ⊢ (𝐾 ∈ ℕ → (𝐾 ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0))
23	22	adantr 486	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ ℕ ∧ ¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (𝐾 ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0))
24		diveq1 12006	. . . . . . . . . . 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 486	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ ℕ ∧ 𝐾 = (2↑(2 pCnt 𝐾))) → (2 pCnt 𝐾) ∈ ℕ₀)
27		oveq2 7428	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = (2 pCnt 𝐾) → (2↑𝑛) = (2↑(2 pCnt 𝐾)))
28	27	eqeq2d 2771	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = (2 pCnt 𝐾) → (𝐾 = (2↑𝑛) ↔ 𝐾 = (2↑(2 pCnt 𝐾))))
29	28	adantl 487	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ ℕ ∧ 𝐾 = (2↑(2 pCnt 𝐾))) ∧ 𝑛 = (2 pCnt 𝐾)) → (𝐾 = (2↑𝑛) ↔ 𝐾 = (2↑(2 pCnt 𝐾))))
30		simpr 490	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ ℕ ∧ 𝐾 = (2↑(2 pCnt 𝐾))) → 𝐾 = (2↑(2 pCnt 𝐾)))
31	26, 29, 30	rspcedvd 3578	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ ℕ ∧ 𝐾 = (2↑(2 pCnt 𝐾))) → ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛))
32	31	ex 418	. . . . . . . . . . . 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 486	. . . . . . . . . 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 16885	. . . . . . . . 9 ⊢ ((𝐾 / (2↑(2 pCnt 𝐾))) ∈ (ℤ_≥‘2) → ∃𝑞 ∈ ℙ 𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))))
39		breq1 5105	. . . . . . . . . . . . . . . . 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 487	. . . . . . . . . . . . . . 15 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (𝑞 = 2 → 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))))
42	41	necon3bd 2969	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾)))) → (¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → 𝑞 ≠ 2))
43	42	ex 418	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) → (𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → (¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → 𝑞 ≠ 2)))
44		prmnn 16854	. . . . . . . . . . . . . . 15 ⊢ (𝑞 ∈ ℙ → 𝑞 ∈ ℕ)
45	5, 13	mpbid 235	. . . . . . . . . . . . . . 15 ⊢ (𝐾 ∈ ℕ → (𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ)
46		nndivides 16437	. . . . . . . . . . . . . . 15 ⊢ ((𝑞 ∈ ℕ ∧ (𝐾 / (2↑(2 pCnt 𝐾))) ∈ ℕ) → (𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) ↔ ∃𝑚 ∈ ℕ (𝑚 · 𝑞) = (𝐾 / (2↑(2 pCnt 𝐾)))))
47	44, 45, 46	syl2anr 609	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) → (𝑞 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) ↔ ∃𝑚 ∈ ℕ (𝑚 · 𝑞) = (𝐾 / (2↑(2 pCnt 𝐾)))))
48		eqcom 2767	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑚 · 𝑞) = (𝐾 / (2↑(2 pCnt 𝐾))) ↔ (𝐾 / (2↑(2 pCnt 𝐾))) = (𝑚 · 𝑞))
49	16	ad2antrr 739	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝐾 ∈ ℂ)
50		simpr 490	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝑚 ∈ ℕ)
51	44	ad2antlr 740	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝑞 ∈ ℕ)
52	50, 51	nnmulcld 12394	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (𝑚 · 𝑞) ∈ ℕ)
53	52	nncnd 12354	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (𝑚 · 𝑞) ∈ ℂ)
54	11	ad2antrr 739	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (2↑(2 pCnt 𝐾)) ∈ ℕ)
55	54, 19	syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → ((2↑(2 pCnt 𝐾)) ∈ ℂ ∧ (2↑(2 pCnt 𝐾)) ≠ 0))
56		divmul 11980	. . . . . . . . . . . . . . . . . 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 490	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) → 𝑞 ∈ ℙ)
60	59	adantr 486	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝑞 ∈ ℙ)
61	60	anim1i 627	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) → (𝑞 ∈ ℙ ∧ 𝑞 ≠ 2))
62		eldifsn 4744	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑞 ∈ (ℙ ∖ {2}) ↔ (𝑞 ∈ ℙ ∧ 𝑞 ≠ 2))
63	61, 62	sylibr 237	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) → 𝑞 ∈ (ℙ ∖ {2}))
64	63	adantr 486	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) → 𝑞 ∈ (ℙ ∖ {2}))
65		breq1 5105	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑝 = 𝑞 → (𝑝 ∥ 𝐾 ↔ 𝑞 ∥ 𝐾))
66	65	adantl 487	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) ∧ 𝑝 = 𝑞) → (𝑝 ∥ 𝐾 ↔ 𝑞 ∥ 𝐾))
67	54, 50	nnmulcld 12394	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → ((2↑(2 pCnt 𝐾)) · 𝑚) ∈ ℕ)
68	67	nnzd 12722	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → ((2↑(2 pCnt 𝐾)) · 𝑚) ∈ ℤ)
69	44	nnzd 12722	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑞 ∈ ℙ → 𝑞 ∈ ℤ)
70	69	ad2antlr 740	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝑞 ∈ ℤ)
71	68, 70	jca 521	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (((2↑(2 pCnt 𝐾)) · 𝑚) ∈ ℤ ∧ 𝑞 ∈ ℤ))
72	71	adantr 486	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) → (((2↑(2 pCnt 𝐾)) · 𝑚) ∈ ℤ ∧ 𝑞 ∈ ℤ))
73		dvdsmul2 16453	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((((2↑(2 pCnt 𝐾)) · 𝑚) ∈ ℤ ∧ 𝑞 ∈ ℤ) → 𝑞 ∥ (((2↑(2 pCnt 𝐾)) · 𝑚) · 𝑞))
74	72, 73	syl 18	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) → 𝑞 ∥ (((2↑(2 pCnt 𝐾)) · 𝑚) · 𝑞))
75		2nn0 12626	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ 2 ∈ ℕ₀
76	75	a1i 11	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝐾 ∈ ℕ → 2 ∈ ℕ₀)
77	76, 10	nn0expcld 14393	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝐾 ∈ ℕ → (2↑(2 pCnt 𝐾)) ∈ ℕ₀)
78	77	ad2antrr 739	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (2↑(2 pCnt 𝐾)) ∈ ℕ₀)
79	78	nn0cnd 12672	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → (2↑(2 pCnt 𝐾)) ∈ ℂ)
80		nncn 12346	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑚 ∈ ℕ → 𝑚 ∈ ℂ)
81	80	adantl 487	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝑚 ∈ ℂ)
82	44	nncnd 12354	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑞 ∈ ℙ → 𝑞 ∈ ℂ)
83	82	ad2antlr 740	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → 𝑞 ∈ ℂ)
84	79, 81, 83	3jca 1146	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) → ((2↑(2 pCnt 𝐾)) ∈ ℂ ∧ 𝑚 ∈ ℂ ∧ 𝑞 ∈ ℂ))
85	84	adantr 486	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) → ((2↑(2 pCnt 𝐾)) ∈ ℂ ∧ 𝑚 ∈ ℂ ∧ 𝑞 ∈ ℂ))
86		mulass 11291	. . . . . . . . . . . . . . . . . . . . . . . 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 5130	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) → 𝑞 ∥ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)))
89	88	adantr 486	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) → 𝑞 ∥ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)))
90		breq2 5106	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾 → (𝑞 ∥ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) ↔ 𝑞 ∥ 𝐾))
91	90	adantl 487	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) → (𝑞 ∥ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) ↔ 𝑞 ∥ 𝐾))
92	89, 91	mpbid 235	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) → 𝑞 ∥ 𝐾)
93	64, 66, 92	rspcedvd 3578	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)
94	93	a1d 26	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝐾 ∈ ℕ ∧ 𝑞 ∈ ℙ) ∧ 𝑚 ∈ ℕ) ∧ 𝑞 ≠ 2) ∧ ((2↑(2 pCnt 𝐾)) · (𝑚 · 𝑞)) = 𝐾) → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))
95	94	exp31 425	. . . . . . . . . . . . . . . . 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 3163	. . . . . . . . . . . . . 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 3163	. . . . . . . . . . 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 416	. . . . . . . . 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 871	. . . . . . 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 418	. . 3 ⊢ (𝐾 ∈ ℕ → (¬ 2 ∥ (𝐾 / (2↑(2 pCnt 𝐾))) → ((2↑(2 pCnt 𝐾)) ∥ 𝐾 → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))))
110	3, 5, 109	mp2d 50	. 2 ⊢ (𝐾 ∈ ℕ → (¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾))
111	110	imp 412	1 ⊢ ((𝐾 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ℕ₀ 𝐾 = (2↑𝑛)) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝐾)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ∃wrex 3086 ∖ cdif 4045 {csn 4584 class class class wbr 5102 ‘cfv 6538 (class class class)co 7420 ℂcc 11201 0cc0 11203 1c1 11204 · cmul 11208 / cdiv 11976 ℕcn 12338 2c2 12400 ℕ₀cn0 12609 ℤcz 12696 ℤ_≥cuz 12968 ↑cexp 14207 ∥ cdvds 16427 ℙcprime 16851 pCnt cpc 17019

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11259 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 ax-pre-mulgt0 11280 ax-pre-sup 11281

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 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 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-1o 8479 df-2o 8480 df-er 8720 df-en 8977 df-dom 8978 df-sdom 8979 df-fin 8980 df-sup 9437 df-inf 9438 df-pnf 11348 df-mnf 11349 df-xr 11350 df-ltxr 11351 df-le 11352 df-sub 11546 df-neg 11547 df-div 11977 df-nn 12339 df-2 12408 df-3 12409 df-n0 12610 df-z 12697 df-uz 12969 df-q 13079 df-rp 13124 df-fz 13643 df-fl 13935 df-mod 14013 df-seq 14148 df-exp 14208 df-cj 15271 df-re 15272 df-im 15273 df-sqrt 15407 df-abs 15408 df-dvds 16428 df-gcd 16670 df-prm 16852 df-pc 17020

This theorem is used by: fltoprmlem1 27998 2pwp1prm 48767

W3C validator