Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > prmlem1a | 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 ∥ 𝑁 |
prmlem1a.x | ⊢ ((¬ 2 ∥ 5 ∧ 𝑥 ∈ (ℤ≥‘5)) → ((𝑥 ∈ (ℙ ∖ {2}) ∧ (𝑥↑2) ≤ 𝑁) → ¬ 𝑥 ∥ 𝑁)) |
Ref | Expression |
---|---|
prmlem1a | ⊢ 𝑁 ∈ ℙ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | prmlem1.n | . . 3 ⊢ 𝑁 ∈ ℕ | |
2 | prmlem1.gt | . . 3 ⊢ 1 < 𝑁 | |
3 | eluz2b2 12324 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) ↔ (𝑁 ∈ ℕ ∧ 1 < 𝑁)) | |
4 | 1, 2, 3 | mpbir2an 709 | . 2 ⊢ 𝑁 ∈ (ℤ≥‘2) |
5 | breq1 5071 | . . . . . 6 ⊢ (𝑥 = 2 → (𝑥 ∥ 𝑁 ↔ 2 ∥ 𝑁)) | |
6 | 5 | notbid 320 | . . . . 5 ⊢ (𝑥 = 2 → (¬ 𝑥 ∥ 𝑁 ↔ ¬ 2 ∥ 𝑁)) |
7 | 6 | imbi2d 343 | . . . 4 ⊢ (𝑥 = 2 → (((𝑥↑2) ≤ 𝑁 → ¬ 𝑥 ∥ 𝑁) ↔ ((𝑥↑2) ≤ 𝑁 → ¬ 2 ∥ 𝑁))) |
8 | prmnn 16020 | . . . . . 6 ⊢ (𝑥 ∈ ℙ → 𝑥 ∈ ℕ) | |
9 | 8 | adantr 483 | . . . . 5 ⊢ ((𝑥 ∈ ℙ ∧ 𝑥 ≠ 2) → 𝑥 ∈ ℕ) |
10 | eldifsn 4721 | . . . . . 6 ⊢ (𝑥 ∈ (ℙ ∖ {2}) ↔ (𝑥 ∈ ℙ ∧ 𝑥 ≠ 2)) | |
11 | n2dvds1 15719 | . . . . . . . . 9 ⊢ ¬ 2 ∥ 1 | |
12 | prmlem1a.x | . . . . . . . . . . 11 ⊢ ((¬ 2 ∥ 5 ∧ 𝑥 ∈ (ℤ≥‘5)) → ((𝑥 ∈ (ℙ ∖ {2}) ∧ (𝑥↑2) ≤ 𝑁) → ¬ 𝑥 ∥ 𝑁)) | |
13 | prmlem1.3 | . . . . . . . . . . . 12 ⊢ ¬ 3 ∥ 𝑁 | |
14 | 13 | a1i 11 | . . . . . . . . . . 11 ⊢ (3 ∈ ℙ → ¬ 3 ∥ 𝑁) |
15 | 3p2e5 11791 | . . . . . . . . . . 11 ⊢ (3 + 2) = 5 | |
16 | 12, 14, 15 | prmlem0 16441 | . . . . . . . . . 10 ⊢ ((¬ 2 ∥ 3 ∧ 𝑥 ∈ (ℤ≥‘3)) → ((𝑥 ∈ (ℙ ∖ {2}) ∧ (𝑥↑2) ≤ 𝑁) → ¬ 𝑥 ∥ 𝑁)) |
17 | 1nprm 16025 | . . . . . . . . . . 11 ⊢ ¬ 1 ∈ ℙ | |
18 | 17 | pm2.21i 119 | . . . . . . . . . 10 ⊢ (1 ∈ ℙ → ¬ 1 ∥ 𝑁) |
19 | 1p2e3 11783 | . . . . . . . . . 10 ⊢ (1 + 2) = 3 | |
20 | 16, 18, 19 | prmlem0 16441 | . . . . . . . . 9 ⊢ ((¬ 2 ∥ 1 ∧ 𝑥 ∈ (ℤ≥‘1)) → ((𝑥 ∈ (ℙ ∖ {2}) ∧ (𝑥↑2) ≤ 𝑁) → ¬ 𝑥 ∥ 𝑁)) |
21 | 11, 20 | mpan 688 | . . . . . . . 8 ⊢ (𝑥 ∈ (ℤ≥‘1) → ((𝑥 ∈ (ℙ ∖ {2}) ∧ (𝑥↑2) ≤ 𝑁) → ¬ 𝑥 ∥ 𝑁)) |
22 | nnuz 12284 | . . . . . . . 8 ⊢ ℕ = (ℤ≥‘1) | |
23 | 21, 22 | eleq2s 2933 | . . . . . . 7 ⊢ (𝑥 ∈ ℕ → ((𝑥 ∈ (ℙ ∖ {2}) ∧ (𝑥↑2) ≤ 𝑁) → ¬ 𝑥 ∥ 𝑁)) |
24 | 23 | expd 418 | . . . . . 6 ⊢ (𝑥 ∈ ℕ → (𝑥 ∈ (ℙ ∖ {2}) → ((𝑥↑2) ≤ 𝑁 → ¬ 𝑥 ∥ 𝑁))) |
25 | 10, 24 | syl5bir 245 | . . . . 5 ⊢ (𝑥 ∈ ℕ → ((𝑥 ∈ ℙ ∧ 𝑥 ≠ 2) → ((𝑥↑2) ≤ 𝑁 → ¬ 𝑥 ∥ 𝑁))) |
26 | 9, 25 | mpcom 38 | . . . 4 ⊢ ((𝑥 ∈ ℙ ∧ 𝑥 ≠ 2) → ((𝑥↑2) ≤ 𝑁 → ¬ 𝑥 ∥ 𝑁)) |
27 | prmlem1.2 | . . . . 5 ⊢ ¬ 2 ∥ 𝑁 | |
28 | 27 | 2a1i 12 | . . . 4 ⊢ (𝑥 ∈ ℙ → ((𝑥↑2) ≤ 𝑁 → ¬ 2 ∥ 𝑁)) |
29 | 7, 26, 28 | pm2.61ne 3104 | . . 3 ⊢ (𝑥 ∈ ℙ → ((𝑥↑2) ≤ 𝑁 → ¬ 𝑥 ∥ 𝑁)) |
30 | 29 | rgen 3150 | . 2 ⊢ ∀𝑥 ∈ ℙ ((𝑥↑2) ≤ 𝑁 → ¬ 𝑥 ∥ 𝑁) |
31 | isprm5 16053 | . 2 ⊢ (𝑁 ∈ ℙ ↔ (𝑁 ∈ (ℤ≥‘2) ∧ ∀𝑥 ∈ ℙ ((𝑥↑2) ≤ 𝑁 → ¬ 𝑥 ∥ 𝑁))) | |
32 | 4, 30, 31 | mpbir2an 709 | 1 ⊢ 𝑁 ∈ ℙ |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ≠ wne 3018 ∀wral 3140 ∖ cdif 3935 {csn 4569 class class class wbr 5068 ‘cfv 6357 (class class class)co 7158 1c1 10540 < clt 10677 ≤ cle 10678 ℕcn 11640 2c2 11695 3c3 11696 5c5 11698 ℤ≥cuz 12246 ↑cexp 13432 ∥ cdvds 15609 ℙcprime 16017 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 ax-pre-sup 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-2o 8105 df-er 8291 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-sup 8908 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-div 11300 df-nn 11641 df-2 11703 df-3 11704 df-4 11705 df-5 11706 df-n0 11901 df-z 11985 df-uz 12247 df-rp 12393 df-fz 12896 df-seq 13373 df-exp 13433 df-cj 14460 df-re 14461 df-im 14462 df-sqrt 14596 df-abs 14597 df-dvds 15610 df-prm 16018 |
This theorem is referenced by: prmlem1 16443 prmlem2 16455 |
Copyright terms: Public domain | W3C validator |