oddprm - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > oddprm		GIF version

Theorem oddprm 12261

Description: A prime not equal to 2 is odd. (Contributed by Mario Carneiro, 4-Feb-2015.) (Proof shortened by AV, 10-Jul-2022.)

**Assertion**
Ref	Expression
oddprm	⊢ (𝑁 ∈ (ℙ ∖ {2}) → ((𝑁 − 1) / 2) ∈ ℕ)

**Proof of Theorem oddprm**
Step	Hyp	Ref	Expression
1		eldifi 3259	. . . . 5 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → 𝑁 ∈ ℙ)
2		prmz 12113	. . . . 5 ⊢ (𝑁 ∈ ℙ → 𝑁 ∈ ℤ)
3	1, 2	syl 14	. . . 4 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → 𝑁 ∈ ℤ)
4		eldifsni 3723	. . . . . . 7 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → 𝑁 ≠ 2)
5	4	necomd 2433	. . . . . 6 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → 2 ≠ 𝑁)
6	5	neneqd 2368	. . . . 5 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → ¬ 2 = 𝑁)
7		2z 9283	. . . . . . 7 ⊢ 2 ∈ ℤ
8		uzid 9544	. . . . . . 7 ⊢ (2 ∈ ℤ → 2 ∈ (ℤ_≥‘2))
9	7, 8	ax-mp 5	. . . . . 6 ⊢ 2 ∈ (ℤ_≥‘2)
10		dvdsprm 12139	. . . . . 6 ⊢ ((2 ∈ (ℤ_≥‘2) ∧ 𝑁 ∈ ℙ) → (2 ∥ 𝑁 ↔ 2 = 𝑁))
11	9, 1, 10	sylancr 414	. . . . 5 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → (2 ∥ 𝑁 ↔ 2 = 𝑁))
12	6, 11	mtbird 673	. . . 4 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → ¬ 2 ∥ 𝑁)
13		1z 9281	. . . . 5 ⊢ 1 ∈ ℤ
14		n2dvds1 11919	. . . . 5 ⊢ ¬ 2 ∥ 1
15		omoe 11903	. . . . 5 ⊢ (((𝑁 ∈ ℤ ∧ ¬ 2 ∥ 𝑁) ∧ (1 ∈ ℤ ∧ ¬ 2 ∥ 1)) → 2 ∥ (𝑁 − 1))
16	13, 14, 15	mpanr12 439	. . . 4 ⊢ ((𝑁 ∈ ℤ ∧ ¬ 2 ∥ 𝑁) → 2 ∥ (𝑁 − 1))
17	3, 12, 16	syl2anc 411	. . 3 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → 2 ∥ (𝑁 − 1))
18		prmnn 12112	. . . . 5 ⊢ (𝑁 ∈ ℙ → 𝑁 ∈ ℕ)
19		nnm1nn0 9219	. . . . 5 ⊢ (𝑁 ∈ ℕ → (𝑁 − 1) ∈ ℕ₀)
20	1, 18, 19	3syl 17	. . . 4 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → (𝑁 − 1) ∈ ℕ₀)
21		nn0z 9275	. . . 4 ⊢ ((𝑁 − 1) ∈ ℕ₀ → (𝑁 − 1) ∈ ℤ)
22		evend2 11896	. . . 4 ⊢ ((𝑁 − 1) ∈ ℤ → (2 ∥ (𝑁 − 1) ↔ ((𝑁 − 1) / 2) ∈ ℤ))
23	20, 21, 22	3syl 17	. . 3 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → (2 ∥ (𝑁 − 1) ↔ ((𝑁 − 1) / 2) ∈ ℤ))
24	17, 23	mpbid 147	. 2 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → ((𝑁 − 1) / 2) ∈ ℤ)
25		prmuz2 12133	. . 3 ⊢ (𝑁 ∈ ℙ → 𝑁 ∈ (ℤ_≥‘2))
26		uz2m1nn 9607	. . 3 ⊢ (𝑁 ∈ (ℤ_≥‘2) → (𝑁 − 1) ∈ ℕ)
27		nngt0 8946	. . . 4 ⊢ ((𝑁 − 1) ∈ ℕ → 0 < (𝑁 − 1))
28		nnre 8928	. . . . 5 ⊢ ((𝑁 − 1) ∈ ℕ → (𝑁 − 1) ∈ ℝ)
29		2rp 9660	. . . . . 6 ⊢ 2 ∈ ℝ⁺
30	29	a1i 9	. . . . 5 ⊢ ((𝑁 − 1) ∈ ℕ → 2 ∈ ℝ⁺)
31	28, 30	gt0divd 9736	. . . 4 ⊢ ((𝑁 − 1) ∈ ℕ → (0 < (𝑁 − 1) ↔ 0 < ((𝑁 − 1) / 2)))
32	27, 31	mpbid 147	. . 3 ⊢ ((𝑁 − 1) ∈ ℕ → 0 < ((𝑁 − 1) / 2))
33	1, 25, 26, 32	4syl 18	. 2 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → 0 < ((𝑁 − 1) / 2))
34		elnnz 9265	. 2 ⊢ (((𝑁 − 1) / 2) ∈ ℕ ↔ (((𝑁 − 1) / 2) ∈ ℤ ∧ 0 < ((𝑁 − 1) / 2)))
35	24, 33, 34	sylanbrc 417	1 ⊢ (𝑁 ∈ (ℙ ∖ {2}) → ((𝑁 − 1) / 2) ∈ ℕ)

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1353 ∈ wcel 2148 ∖ cdif 3128 {csn 3594 class class class wbr 4005 ‘cfv 5218 (class class class)co 5877 0cc0 7813 1c1 7814 < clt 7994 − cmin 8130 / cdiv 8631 ℕcn 8921 2c2 8972 ℕ₀cn0 9178 ℤcz 9255 ℤ_≥cuz 9530 ℝ⁺crp 9655 ∥ cdvds 11796 ℙcprime 12109

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4120 ax-sep 4123 ax-nul 4131 ax-pow 4176 ax-pr 4211 ax-un 4435 ax-setind 4538 ax-iinf 4589 ax-cnex 7904 ax-resscn 7905 ax-1cn 7906 ax-1re 7907 ax-icn 7908 ax-addcl 7909 ax-addrcl 7910 ax-mulcl 7911 ax-mulrcl 7912 ax-addcom 7913 ax-mulcom 7914 ax-addass 7915 ax-mulass 7916 ax-distr 7917 ax-i2m1 7918 ax-0lt1 7919 ax-1rid 7920 ax-0id 7921 ax-rnegex 7922 ax-precex 7923 ax-cnre 7924 ax-pre-ltirr 7925 ax-pre-ltwlin 7926 ax-pre-lttrn 7927 ax-pre-apti 7928 ax-pre-ltadd 7929 ax-pre-mulgt0 7930 ax-pre-mulext 7931 ax-arch 7932 ax-caucvg 7933

This theorem depends on definitions: df-bi 117 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-xor 1376 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2741 df-sbc 2965 df-csb 3060 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-nul 3425 df-if 3537 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-int 3847 df-iun 3890 df-br 4006 df-opab 4067 df-mpt 4068 df-tr 4104 df-id 4295 df-po 4298 df-iso 4299 df-iord 4368 df-on 4370 df-ilim 4371 df-suc 4373 df-iom 4592 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-rn 4639 df-res 4640 df-ima 4641 df-iota 5180 df-fun 5220 df-fn 5221 df-f 5222 df-f1 5223 df-fo 5224 df-f1o 5225 df-fv 5226 df-riota 5833 df-ov 5880 df-oprab 5881 df-mpo 5882 df-1st 6143 df-2nd 6144 df-recs 6308 df-frec 6394 df-1o 6419 df-2o 6420 df-er 6537 df-en 6743 df-pnf 7996 df-mnf 7997 df-xr 7998 df-ltxr 7999 df-le 8000 df-sub 8132 df-neg 8133 df-reap 8534 df-ap 8541 df-div 8632 df-inn 8922 df-2 8980 df-3 8981 df-4 8982 df-n0 9179 df-z 9256 df-uz 9531 df-q 9622 df-rp 9656 df-seqfrec 10448 df-exp 10522 df-cj 10853 df-re 10854 df-im 10855 df-rsqrt 11009 df-abs 11010 df-dvds 11797 df-prm 12110

This theorem is referenced by: nnoddn2prm 12262 lgslem1 14440 lgslem4 14443 lgsval2lem 14450 lgsvalmod 14459 lgsmod 14466 lgsdirprm 14474 lgsne0 14478 lgseisenlem1 14489 lgseisenlem2 14490 m1lgs 14491

W3C validator