prmlem1 - Intuitionistic Logic Explorer

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

Theorem prmlem1 13242

Description: A quick proof skeleton to show that the numbers less than 25 are prime, by trial division. (Contributed by Mario Carneiro, 18-Feb-2014.)

**Hypotheses**
Ref	Expression
prmlem1.n	⊢ 𝑁 ∈ ℕ
prmlem1.gt	⊢ 1 < 𝑁
prmlem1.2	⊢ ¬ 2 ∥ 𝑁
prmlem1.3	⊢ ¬ 3 ∥ 𝑁
prmlem1.lt	⊢ 𝑁 < ;25

**Assertion**
Ref	Expression
prmlem1	⊢ 𝑁 ∈ ℙ

Proof of Theorem prmlem1 Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		prmlem1.n	. 2 ⊢ 𝑁 ∈ ℕ
2		prmlem1.gt	. 2 ⊢ 1 < 𝑁
3		prmlem1.2	. 2 ⊢ ¬ 2 ∥ 𝑁
4		prmlem1.3	. 2 ⊢ ¬ 3 ∥ 𝑁
5		eluzelre 9941	. . . . . . . 8 ⊢ (𝑥 ∈ (ℤ_≥‘5) → 𝑥 ∈ ℝ)
6	5	resqcld 11150	. . . . . . 7 ⊢ (𝑥 ∈ (ℤ_≥‘5) → (𝑥↑2) ∈ ℝ)
7		eluzle 9943	. . . . . . . 8 ⊢ (𝑥 ∈ (ℤ_≥‘5) → 5 ≤ 𝑥)
8		5re 9385	. . . . . . . . 9 ⊢ 5 ∈ ℝ
9		5nn0 9587	. . . . . . . . . 10 ⊢ 5 ∈ ℕ₀
10	9	nn0ge0i 9594	. . . . . . . . 9 ⊢ 0 ≤ 5
11		le2sq2 11065	. . . . . . . . 9 ⊢ (((5 ∈ ℝ ∧ 0 ≤ 5) ∧ (𝑥 ∈ ℝ ∧ 5 ≤ 𝑥)) → (5↑2) ≤ (𝑥↑2))
12	8, 10, 11	mpanl12 440	. . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 5 ≤ 𝑥) → (5↑2) ≤ (𝑥↑2))
13	5, 7, 12	syl2anc 415	. . . . . . 7 ⊢ (𝑥 ∈ (ℤ_≥‘5) → (5↑2) ≤ (𝑥↑2))
14	1	nnrei 9315	. . . . . . . 8 ⊢ 𝑁 ∈ ℝ
15	8	resqcli 11074	. . . . . . . 8 ⊢ (5↑2) ∈ ℝ
16		prmlem1.lt	. . . . . . . . . 10 ⊢ 𝑁 < ;25
17		5cn 9386	. . . . . . . . . . . 12 ⊢ 5 ∈ ℂ
18	17	sqvali 11069	. . . . . . . . . . 11 ⊢ (5↑2) = (5 · 5)
19		5t5e25 9888	. . . . . . . . . . 11 ⊢ (5 · 5) = ;25
20	18, 19	eqtri 2259	. . . . . . . . . 10 ⊢ (5↑2) = ;25
21	16, 20	breqtrri 4157	. . . . . . . . 9 ⊢ 𝑁 < (5↑2)
22		ltletr 8415	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℝ ∧ (5↑2) ∈ ℝ ∧ (𝑥↑2) ∈ ℝ) → ((𝑁 < (5↑2) ∧ (5↑2) ≤ (𝑥↑2)) → 𝑁 < (𝑥↑2)))
23	21, 22	mpani 434	. . . . . . . 8 ⊢ ((𝑁 ∈ ℝ ∧ (5↑2) ∈ ℝ ∧ (𝑥↑2) ∈ ℝ) → ((5↑2) ≤ (𝑥↑2) → 𝑁 < (𝑥↑2)))
24	14, 15, 23	mp3an12 1368	. . . . . . 7 ⊢ ((𝑥↑2) ∈ ℝ → ((5↑2) ≤ (𝑥↑2) → 𝑁 < (𝑥↑2)))
25	6, 13, 24	sylc 62	. . . . . 6 ⊢ (𝑥 ∈ (ℤ_≥‘5) → 𝑁 < (𝑥↑2))
26	1	nnzi 9669	. . . . . . 7 ⊢ 𝑁 ∈ ℤ
27		eluzelz 9940	. . . . . . . 8 ⊢ (𝑥 ∈ (ℤ_≥‘5) → 𝑥 ∈ ℤ)
28		zsqcl 11060	. . . . . . . 8 ⊢ (𝑥 ∈ ℤ → (𝑥↑2) ∈ ℤ)
29	27, 28	syl 14	. . . . . . 7 ⊢ (𝑥 ∈ (ℤ_≥‘5) → (𝑥↑2) ∈ ℤ)
30		zltnle 9694	. . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ (𝑥↑2) ∈ ℤ) → (𝑁 < (𝑥↑2) ↔ ¬ (𝑥↑2) ≤ 𝑁))
31	26, 29, 30	sylancr 418	. . . . . 6 ⊢ (𝑥 ∈ (ℤ_≥‘5) → (𝑁 < (𝑥↑2) ↔ ¬ (𝑥↑2) ≤ 𝑁))
32	25, 31	mpbid 147	. . . . 5 ⊢ (𝑥 ∈ (ℤ_≥‘5) → ¬ (𝑥↑2) ≤ 𝑁)
33	32	pm2.21d 628	. . . 4 ⊢ (𝑥 ∈ (ℤ_≥‘5) → ((𝑥↑2) ≤ 𝑁 → ¬ 𝑥 ∥ 𝑁))
34	33	adantld 278	. . 3 ⊢ (𝑥 ∈ (ℤ_≥‘5) → ((𝑥 ∈ (ℙ ∖ {2}) ∧ (𝑥↑2) ≤ 𝑁) → ¬ 𝑥 ∥ 𝑁))
35	34	adantl 277	. 2 ⊢ ((¬ 2 ∥ 5 ∧ 𝑥 ∈ (ℤ_≥‘5)) → ((𝑥 ∈ (ℙ ∖ {2}) ∧ (𝑥↑2) ≤ 𝑁) → ¬ 𝑥 ∥ 𝑁))
36	1, 2, 3, 4, 35	prmlem1a 13241	1 ⊢ 𝑁 ∈ ℙ

Colors of variables: wff set class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1009 ∈ wcel 2209 ∖ cdif 3217 {csn 3709 class class class wbr 4130 ‘cfv 5377 (class class class)co 6085 ℝcr 8178 0cc0 8179 1c1 8180 · cmul 8184 < clt 8360 ≤ cle 8361 ℕcn 9306 2c2 9357 3c3 9358 5c5 9360 ℤcz 9648 cdc 9781 ℤ_≥cuz 9930 ↑cexp 10988 ∥ cdvds 12570 ℙcprime 12901

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-mulrcl 8278 ax-addcom 8279 ax-mulcom 8280 ax-addass 8281 ax-mulass 8282 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-1rid 8286 ax-0id 8287 ax-rnegex 8288 ax-precex 8289 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-apti 8294 ax-pre-ltadd 8295 ax-pre-mulgt0 8296 ax-pre-mulext 8297 ax-arch 8298 ax-caucvg 8299

This proof depends on definitions: df-bi 117 df-stab 843 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-xor 1425 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-po 4441 df-iso 4442 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-frec 6662 df-1o 6687 df-2o 6688 df-er 6807 df-en 7023 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8500 df-neg 8501 df-reap 8905 df-ap 8912 df-div 9005 df-inn 9307 df-2 9365 df-3 9366 df-4 9367 df-5 9368 df-6 9369 df-7 9370 df-8 9371 df-9 9372 df-n0 9568 df-z 9649 df-dec 9782 df-uz 9931 df-q 10029 df-rp 10065 df-fz 10422 df-fzo 10560 df-fl 10715 df-mod 10773 df-seqfrec 10898 df-exp 10989 df-cj 11621 df-re 11622 df-im 11623 df-rsqrt 11778 df-abs 11779 df-dvds 12571 df-prm 12902

This theorem is used by: 5prm 13243 7prm 13245 11prm 13249 13prm 13250 17prm 13251 19prm 13252 23prm 13253

W3C validator