Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > prmlem1 | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
prmlem1.n | ⊢ 𝑁 ∈ ℕ |
prmlem1.gt | ⊢ 1 < 𝑁 |
prmlem1.2 | ⊢ ¬ 2 ∥ 𝑁 |
prmlem1.3 | ⊢ ¬ 3 ∥ 𝑁 |
prmlem1.lt | ⊢ 𝑁 < ;25 |
Ref | Expression |
---|---|
prmlem1 | ⊢ 𝑁 ∈ ℙ |
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 12242 | . . . . . . . 8 ⊢ (𝑥 ∈ (ℤ≥‘5) → 𝑥 ∈ ℝ) | |
6 | 5 | resqcld 13599 | . . . . . . 7 ⊢ (𝑥 ∈ (ℤ≥‘5) → (𝑥↑2) ∈ ℝ) |
7 | eluzle 12244 | . . . . . . . 8 ⊢ (𝑥 ∈ (ℤ≥‘5) → 5 ≤ 𝑥) | |
8 | 5re 11712 | . . . . . . . . 9 ⊢ 5 ∈ ℝ | |
9 | 5nn0 11905 | . . . . . . . . . 10 ⊢ 5 ∈ ℕ0 | |
10 | 9 | nn0ge0i 11912 | . . . . . . . . 9 ⊢ 0 ≤ 5 |
11 | le2sq2 13488 | . . . . . . . . 9 ⊢ (((5 ∈ ℝ ∧ 0 ≤ 5) ∧ (𝑥 ∈ ℝ ∧ 5 ≤ 𝑥)) → (5↑2) ≤ (𝑥↑2)) | |
12 | 8, 10, 11 | mpanl12 698 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 5 ≤ 𝑥) → (5↑2) ≤ (𝑥↑2)) |
13 | 5, 7, 12 | syl2anc 584 | . . . . . . 7 ⊢ (𝑥 ∈ (ℤ≥‘5) → (5↑2) ≤ (𝑥↑2)) |
14 | 1 | nnrei 11635 | . . . . . . . 8 ⊢ 𝑁 ∈ ℝ |
15 | 8 | resqcli 13537 | . . . . . . . 8 ⊢ (5↑2) ∈ ℝ |
16 | prmlem1.lt | . . . . . . . . . 10 ⊢ 𝑁 < ;25 | |
17 | 5cn 11713 | . . . . . . . . . . . 12 ⊢ 5 ∈ ℂ | |
18 | 17 | sqvali 13531 | . . . . . . . . . . 11 ⊢ (5↑2) = (5 · 5) |
19 | 5t5e25 12189 | . . . . . . . . . . 11 ⊢ (5 · 5) = ;25 | |
20 | 18, 19 | eqtri 2841 | . . . . . . . . . 10 ⊢ (5↑2) = ;25 |
21 | 16, 20 | breqtrri 5084 | . . . . . . . . 9 ⊢ 𝑁 < (5↑2) |
22 | ltletr 10720 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℝ ∧ (5↑2) ∈ ℝ ∧ (𝑥↑2) ∈ ℝ) → ((𝑁 < (5↑2) ∧ (5↑2) ≤ (𝑥↑2)) → 𝑁 < (𝑥↑2))) | |
23 | 21, 22 | mpani 692 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℝ ∧ (5↑2) ∈ ℝ ∧ (𝑥↑2) ∈ ℝ) → ((5↑2) ≤ (𝑥↑2) → 𝑁 < (𝑥↑2))) |
24 | 14, 15, 23 | mp3an12 1442 | . . . . . . 7 ⊢ ((𝑥↑2) ∈ ℝ → ((5↑2) ≤ (𝑥↑2) → 𝑁 < (𝑥↑2))) |
25 | 6, 13, 24 | sylc 65 | . . . . . 6 ⊢ (𝑥 ∈ (ℤ≥‘5) → 𝑁 < (𝑥↑2)) |
26 | ltnle 10708 | . . . . . . 7 ⊢ ((𝑁 ∈ ℝ ∧ (𝑥↑2) ∈ ℝ) → (𝑁 < (𝑥↑2) ↔ ¬ (𝑥↑2) ≤ 𝑁)) | |
27 | 14, 6, 26 | sylancr 587 | . . . . . 6 ⊢ (𝑥 ∈ (ℤ≥‘5) → (𝑁 < (𝑥↑2) ↔ ¬ (𝑥↑2) ≤ 𝑁)) |
28 | 25, 27 | mpbid 233 | . . . . 5 ⊢ (𝑥 ∈ (ℤ≥‘5) → ¬ (𝑥↑2) ≤ 𝑁) |
29 | 28 | pm2.21d 121 | . . . 4 ⊢ (𝑥 ∈ (ℤ≥‘5) → ((𝑥↑2) ≤ 𝑁 → ¬ 𝑥 ∥ 𝑁)) |
30 | 29 | adantld 491 | . . 3 ⊢ (𝑥 ∈ (ℤ≥‘5) → ((𝑥 ∈ (ℙ ∖ {2}) ∧ (𝑥↑2) ≤ 𝑁) → ¬ 𝑥 ∥ 𝑁)) |
31 | 30 | adantl 482 | . 2 ⊢ ((¬ 2 ∥ 5 ∧ 𝑥 ∈ (ℤ≥‘5)) → ((𝑥 ∈ (ℙ ∖ {2}) ∧ (𝑥↑2) ≤ 𝑁) → ¬ 𝑥 ∥ 𝑁)) |
32 | 1, 2, 3, 4, 31 | prmlem1a 16428 | 1 ⊢ 𝑁 ∈ ℙ |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1079 ∈ wcel 2105 ∖ cdif 3930 {csn 4557 class class class wbr 5057 ‘cfv 6348 (class class class)co 7145 ℝcr 10524 0cc0 10525 1c1 10526 · cmul 10530 < clt 10663 ≤ cle 10664 ℕcn 11626 2c2 11680 3c3 11681 5c5 11683 ;cdc 12086 ℤ≥cuz 12231 ↑cexp 13417 ∥ cdvds 15595 ℙcprime 16003 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 ax-pre-sup 10603 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-1st 7678 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-2o 8092 df-er 8278 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-sup 8894 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-div 11286 df-nn 11627 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-7 11693 df-8 11694 df-9 11695 df-n0 11886 df-z 11970 df-dec 12087 df-uz 12232 df-rp 12378 df-fz 12881 df-seq 13358 df-exp 13418 df-cj 14446 df-re 14447 df-im 14448 df-sqrt 14582 df-abs 14583 df-dvds 15596 df-prm 16004 |
This theorem is referenced by: 5prm 16430 7prm 16432 11prm 16436 13prm 16437 17prm 16438 19prm 16439 23prm 16440 |
Copyright terms: Public domain | W3C validator |