ppiublem2 - Metamath Proof Explorer

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

Theorem ppiublem2 27166

Description: A prime greater than 3 does not divide 2 or 3, so its residue mod 6 is 1 or 5. (Contributed by Mario Carneiro, 12-Mar-2014.)

**Assertion**
Ref	Expression
ppiublem2	⊢ ((𝑃 ∈ ℙ ∧ 4 ≤ 𝑃) → (𝑃 mod 6) ∈ {1, 5})

**Proof of Theorem ppiublem2**
Step	Hyp	Ref	Expression
1		prmz 16645	. . . . 5 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ)
2	1	adantr 479	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 4 ≤ 𝑃) → 𝑃 ∈ ℤ)
3		6nn 12331	. . . 4 ⊢ 6 ∈ ℕ
4		zmodfz 13890	. . . 4 ⊢ ((𝑃 ∈ ℤ ∧ 6 ∈ ℕ) → (𝑃 mod 6) ∈ (0...(6 − 1)))
5	2, 3, 4	sylancl 584	. . 3 ⊢ ((𝑃 ∈ ℙ ∧ 4 ≤ 𝑃) → (𝑃 mod 6) ∈ (0...(6 − 1)))
6		6m1e5 12373	. . . 4 ⊢ (6 − 1) = 5
7	6	oveq2i 7428	. . 3 ⊢ (0...(6 − 1)) = (0...5)
8	5, 7	eleqtrdi 2835	. 2 ⊢ ((𝑃 ∈ ℙ ∧ 4 ≤ 𝑃) → (𝑃 mod 6) ∈ (0...5))
9		6re 12332	. . . . . . . . . . 11 ⊢ 6 ∈ ℝ
10	9	leidi 11778	. . . . . . . . . 10 ⊢ 6 ≤ 6
11		noel 4331	. . . . . . . . . . . . 13 ⊢ ¬ (𝑃 mod 6) ∈ ∅
12	11	pm2.21i 119	. . . . . . . . . . . 12 ⊢ ((𝑃 mod 6) ∈ ∅ → (𝑃 mod 6) ∈ {1, 5})
13		5lt6 12423	. . . . . . . . . . . . 13 ⊢ 5 < 6
14	3	nnzi 12616	. . . . . . . . . . . . . 14 ⊢ 6 ∈ ℤ
15		5nn 12328	. . . . . . . . . . . . . . 15 ⊢ 5 ∈ ℕ
16	15	nnzi 12616	. . . . . . . . . . . . . 14 ⊢ 5 ∈ ℤ
17		fzn 13549	. . . . . . . . . . . . . 14 ⊢ ((6 ∈ ℤ ∧ 5 ∈ ℤ) → (5 < 6 ↔ (6...5) = ∅))
18	14, 16, 17	mp2an 690	. . . . . . . . . . . . 13 ⊢ (5 < 6 ↔ (6...5) = ∅)
19	13, 18	mpbi 229	. . . . . . . . . . . 12 ⊢ (6...5) = ∅
20	12, 19	eleq2s 2843	. . . . . . . . . . 11 ⊢ ((𝑃 mod 6) ∈ (6...5) → (𝑃 mod 6) ∈ {1, 5})
21	20	a1i 11	. . . . . . . . . 10 ⊢ ((𝑃 ∈ ℙ ∧ 4 ≤ 𝑃) → ((𝑃 mod 6) ∈ (6...5) → (𝑃 mod 6) ∈ {1, 5}))
22	10, 21	pm3.2i 469	. . . . . . . . 9 ⊢ (6 ≤ 6 ∧ ((𝑃 ∈ ℙ ∧ 4 ≤ 𝑃) → ((𝑃 mod 6) ∈ (6...5) → (𝑃 mod 6) ∈ {1, 5})))
23		5nn0 12522	. . . . . . . . 9 ⊢ 5 ∈ ℕ₀
24		df-6 12309	. . . . . . . . 9 ⊢ 6 = (5 + 1)
25	15	elexi 3484	. . . . . . . . . . 11 ⊢ 5 ∈ V
26	25	prid2 4768	. . . . . . . . . 10 ⊢ 5 ∈ {1, 5}
27	26	3mix3i 1332	. . . . . . . . 9 ⊢ (2 ∥ 5 ∨ 3 ∥ 5 ∨ 5 ∈ {1, 5})
28	22, 23, 24, 27	ppiublem1 27165	. . . . . . . 8 ⊢ (5 ≤ 6 ∧ ((𝑃 ∈ ℙ ∧ 4 ≤ 𝑃) → ((𝑃 mod 6) ∈ (5...5) → (𝑃 mod 6) ∈ {1, 5})))
29		4nn0 12521	. . . . . . . 8 ⊢ 4 ∈ ℕ₀
30		df-5 12308	. . . . . . . 8 ⊢ 5 = (4 + 1)
31		z4even 16348	. . . . . . . . 9 ⊢ 2 ∥ 4
32	31	3mix1i 1330	. . . . . . . 8 ⊢ (2 ∥ 4 ∨ 3 ∥ 4 ∨ 4 ∈ {1, 5})
33	28, 29, 30, 32	ppiublem1 27165	. . . . . . 7 ⊢ (4 ≤ 6 ∧ ((𝑃 ∈ ℙ ∧ 4 ≤ 𝑃) → ((𝑃 mod 6) ∈ (4...5) → (𝑃 mod 6) ∈ {1, 5})))
34		3nn0 12520	. . . . . . 7 ⊢ 3 ∈ ℕ₀
35		df-4 12307	. . . . . . 7 ⊢ 4 = (3 + 1)
36		3z 12625	. . . . . . . . 9 ⊢ 3 ∈ ℤ
37		iddvds 16246	. . . . . . . . 9 ⊢ (3 ∈ ℤ → 3 ∥ 3)
38	36, 37	ax-mp 5	. . . . . . . 8 ⊢ 3 ∥ 3
39	38	3mix2i 1331	. . . . . . 7 ⊢ (2 ∥ 3 ∨ 3 ∥ 3 ∨ 3 ∈ {1, 5})
40	33, 34, 35, 39	ppiublem1 27165	. . . . . 6 ⊢ (3 ≤ 6 ∧ ((𝑃 ∈ ℙ ∧ 4 ≤ 𝑃) → ((𝑃 mod 6) ∈ (3...5) → (𝑃 mod 6) ∈ {1, 5})))
41		2nn0 12519	. . . . . 6 ⊢ 2 ∈ ℕ₀
42		df-3 12306	. . . . . 6 ⊢ 3 = (2 + 1)
43		z2even 16346	. . . . . . 7 ⊢ 2 ∥ 2
44	43	3mix1i 1330	. . . . . 6 ⊢ (2 ∥ 2 ∨ 3 ∥ 2 ∨ 2 ∈ {1, 5})
45	40, 41, 42, 44	ppiublem1 27165	. . . . 5 ⊢ (2 ≤ 6 ∧ ((𝑃 ∈ ℙ ∧ 4 ≤ 𝑃) → ((𝑃 mod 6) ∈ (2...5) → (𝑃 mod 6) ∈ {1, 5})))
46		1nn0 12518	. . . . 5 ⊢ 1 ∈ ℕ₀
47		df-2 12305	. . . . 5 ⊢ 2 = (1 + 1)
48		1ex 11240	. . . . . . 7 ⊢ 1 ∈ V
49	48	prid1 4767	. . . . . 6 ⊢ 1 ∈ {1, 5}
50	49	3mix3i 1332	. . . . 5 ⊢ (2 ∥ 1 ∨ 3 ∥ 1 ∨ 1 ∈ {1, 5})
51	45, 46, 47, 50	ppiublem1 27165	. . . 4 ⊢ (1 ≤ 6 ∧ ((𝑃 ∈ ℙ ∧ 4 ≤ 𝑃) → ((𝑃 mod 6) ∈ (1...5) → (𝑃 mod 6) ∈ {1, 5})))
52		0nn0 12517	. . . 4 ⊢ 0 ∈ ℕ₀
53		1e0p1 12749	. . . 4 ⊢ 1 = (0 + 1)
54		z0even 16343	. . . . 5 ⊢ 2 ∥ 0
55	54	3mix1i 1330	. . . 4 ⊢ (2 ∥ 0 ∨ 3 ∥ 0 ∨ 0 ∈ {1, 5})
56	51, 52, 53, 55	ppiublem1 27165	. . 3 ⊢ (0 ≤ 6 ∧ ((𝑃 ∈ ℙ ∧ 4 ≤ 𝑃) → ((𝑃 mod 6) ∈ (0...5) → (𝑃 mod 6) ∈ {1, 5})))
57	56	simpri 484	. 2 ⊢ ((𝑃 ∈ ℙ ∧ 4 ≤ 𝑃) → ((𝑃 mod 6) ∈ (0...5) → (𝑃 mod 6) ∈ {1, 5}))
58	8, 57	mpd 15	1 ⊢ ((𝑃 ∈ ℙ ∧ 4 ≤ 𝑃) → (𝑃 mod 6) ∈ {1, 5})

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ∅c0 4323 {cpr 4631 class class class wbr 5148 (class class class)co 7417 0cc0 11138 1c1 11139 < clt 11278 ≤ cle 11279 − cmin 11474 ℕcn 12242 2c2 12297 3c3 12298 4c4 12299 5c5 12300 6c6 12301 ℤcz 12588 ...cfz 13516 mod cmo 13866 ∥ cdvds 16230 ℙcprime 16641

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 5299 ax-nul 5306 ax-pow 5364 ax-pr 5428 ax-un 7739 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215 ax-pre-sup 11216

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 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3775 df-csb 3891 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-pss 3965 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4909 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6305 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6499 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-riota 7373 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7870 df-1st 7992 df-2nd 7993 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-2o 8486 df-er 8723 df-en 8963 df-dom 8964 df-sdom 8965 df-fin 8966 df-sup 9465 df-inf 9466 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-div 11902 df-nn 12243 df-2 12305 df-3 12306 df-4 12307 df-5 12308 df-6 12309 df-n0 12503 df-z 12589 df-uz 12853 df-rp 13007 df-fz 13517 df-fl 13789 df-mod 13867 df-seq 13999 df-exp 14059 df-cj 15078 df-re 15079 df-im 15080 df-sqrt 15214 df-abs 15215 df-dvds 16231 df-prm 16642

This theorem is referenced by: ppiub 27167

W3C validator

	
		OSZAR »