![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > prmgapprmolem | Structured version Visualization version GIF version |
Description: Lemma for prmgapprmo 16942: The primorial of a number plus an integer greater than 1 and less then or equal to the number are not coprime. (Contributed by AV, 15-Aug-2020.) (Revised by AV, 29-Aug-2020.) |
Ref | Expression |
---|---|
prmgapprmolem | ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) → 1 < (((#p‘𝑁) + 𝐼) gcd 𝐼)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | prmuz2 16580 | . . . . 5 ⊢ (𝑝 ∈ ℙ → 𝑝 ∈ (ℤ≥‘2)) | |
2 | 1 | ad2antlr 726 | . . . 4 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) ∧ 𝑝 ∈ ℙ) ∧ (𝑝 ≤ 𝑁 ∧ 𝑝 ∥ 𝐼 ∧ 𝑝 ∥ ((#p‘𝑁) + 𝐼))) → 𝑝 ∈ (ℤ≥‘2)) |
3 | breq1 5112 | . . . . . 6 ⊢ (𝑞 = 𝑝 → (𝑞 ∥ ((#p‘𝑁) + 𝐼) ↔ 𝑝 ∥ ((#p‘𝑁) + 𝐼))) | |
4 | breq1 5112 | . . . . . 6 ⊢ (𝑞 = 𝑝 → (𝑞 ∥ 𝐼 ↔ 𝑝 ∥ 𝐼)) | |
5 | 3, 4 | anbi12d 632 | . . . . 5 ⊢ (𝑞 = 𝑝 → ((𝑞 ∥ ((#p‘𝑁) + 𝐼) ∧ 𝑞 ∥ 𝐼) ↔ (𝑝 ∥ ((#p‘𝑁) + 𝐼) ∧ 𝑝 ∥ 𝐼))) |
6 | 5 | adantl 483 | . . . 4 ⊢ (((((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) ∧ 𝑝 ∈ ℙ) ∧ (𝑝 ≤ 𝑁 ∧ 𝑝 ∥ 𝐼 ∧ 𝑝 ∥ ((#p‘𝑁) + 𝐼))) ∧ 𝑞 = 𝑝) → ((𝑞 ∥ ((#p‘𝑁) + 𝐼) ∧ 𝑞 ∥ 𝐼) ↔ (𝑝 ∥ ((#p‘𝑁) + 𝐼) ∧ 𝑝 ∥ 𝐼))) |
7 | pm3.22 461 | . . . . . 6 ⊢ ((𝑝 ∥ 𝐼 ∧ 𝑝 ∥ ((#p‘𝑁) + 𝐼)) → (𝑝 ∥ ((#p‘𝑁) + 𝐼) ∧ 𝑝 ∥ 𝐼)) | |
8 | 7 | 3adant1 1131 | . . . . 5 ⊢ ((𝑝 ≤ 𝑁 ∧ 𝑝 ∥ 𝐼 ∧ 𝑝 ∥ ((#p‘𝑁) + 𝐼)) → (𝑝 ∥ ((#p‘𝑁) + 𝐼) ∧ 𝑝 ∥ 𝐼)) |
9 | 8 | adantl 483 | . . . 4 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) ∧ 𝑝 ∈ ℙ) ∧ (𝑝 ≤ 𝑁 ∧ 𝑝 ∥ 𝐼 ∧ 𝑝 ∥ ((#p‘𝑁) + 𝐼))) → (𝑝 ∥ ((#p‘𝑁) + 𝐼) ∧ 𝑝 ∥ 𝐼)) |
10 | 2, 6, 9 | rspcedvd 3585 | . . 3 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) ∧ 𝑝 ∈ ℙ) ∧ (𝑝 ≤ 𝑁 ∧ 𝑝 ∥ 𝐼 ∧ 𝑝 ∥ ((#p‘𝑁) + 𝐼))) → ∃𝑞 ∈ (ℤ≥‘2)(𝑞 ∥ ((#p‘𝑁) + 𝐼) ∧ 𝑞 ∥ 𝐼)) |
11 | prmdvdsprmop 16923 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) → ∃𝑝 ∈ ℙ (𝑝 ≤ 𝑁 ∧ 𝑝 ∥ 𝐼 ∧ 𝑝 ∥ ((#p‘𝑁) + 𝐼))) | |
12 | 10, 11 | r19.29a 3156 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) → ∃𝑞 ∈ (ℤ≥‘2)(𝑞 ∥ ((#p‘𝑁) + 𝐼) ∧ 𝑞 ∥ 𝐼)) |
13 | nnnn0 12428 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0) | |
14 | prmocl 16914 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (#p‘𝑁) ∈ ℕ) | |
15 | 13, 14 | syl 17 | . . . 4 ⊢ (𝑁 ∈ ℕ → (#p‘𝑁) ∈ ℕ) |
16 | elfzuz 13446 | . . . . 5 ⊢ (𝐼 ∈ (2...𝑁) → 𝐼 ∈ (ℤ≥‘2)) | |
17 | eluz2nn 12817 | . . . . 5 ⊢ (𝐼 ∈ (ℤ≥‘2) → 𝐼 ∈ ℕ) | |
18 | 16, 17 | syl 17 | . . . 4 ⊢ (𝐼 ∈ (2...𝑁) → 𝐼 ∈ ℕ) |
19 | nnaddcl 12184 | . . . 4 ⊢ (((#p‘𝑁) ∈ ℕ ∧ 𝐼 ∈ ℕ) → ((#p‘𝑁) + 𝐼) ∈ ℕ) | |
20 | 15, 18, 19 | syl2an 597 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) → ((#p‘𝑁) + 𝐼) ∈ ℕ) |
21 | 18 | adantl 483 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) → 𝐼 ∈ ℕ) |
22 | ncoprmgcdgt1b 16535 | . . 3 ⊢ ((((#p‘𝑁) + 𝐼) ∈ ℕ ∧ 𝐼 ∈ ℕ) → (∃𝑞 ∈ (ℤ≥‘2)(𝑞 ∥ ((#p‘𝑁) + 𝐼) ∧ 𝑞 ∥ 𝐼) ↔ 1 < (((#p‘𝑁) + 𝐼) gcd 𝐼))) | |
23 | 20, 21, 22 | syl2anc 585 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) → (∃𝑞 ∈ (ℤ≥‘2)(𝑞 ∥ ((#p‘𝑁) + 𝐼) ∧ 𝑞 ∥ 𝐼) ↔ 1 < (((#p‘𝑁) + 𝐼) gcd 𝐼))) |
24 | 12, 23 | mpbid 231 | 1 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) → 1 < (((#p‘𝑁) + 𝐼) gcd 𝐼)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∧ w3a 1088 ∈ wcel 2107 ∃wrex 3070 class class class wbr 5109 ‘cfv 6500 (class class class)co 7361 1c1 11060 + caddc 11062 < clt 11197 ≤ cle 11198 ℕcn 12161 2c2 12216 ℕ0cn0 12421 ℤ≥cuz 12771 ...cfz 13433 ∥ cdvds 16144 gcd cgcd 16382 ℙcprime 16555 #pcprmo 16911 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5246 ax-sep 5260 ax-nul 5267 ax-pow 5324 ax-pr 5388 ax-un 7676 ax-inf2 9585 ax-cnex 11115 ax-resscn 11116 ax-1cn 11117 ax-icn 11118 ax-addcl 11119 ax-addrcl 11120 ax-mulcl 11121 ax-mulrcl 11122 ax-mulcom 11123 ax-addass 11124 ax-mulass 11125 ax-distr 11126 ax-i2m1 11127 ax-1ne0 11128 ax-1rid 11129 ax-rnegex 11130 ax-rrecex 11131 ax-cnre 11132 ax-pre-lttri 11133 ax-pre-lttrn 11134 ax-pre-ltadd 11135 ax-pre-mulgt0 11136 ax-pre-sup 11137 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3352 df-reu 3353 df-rab 3407 df-v 3449 df-sbc 3744 df-csb 3860 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3933 df-nul 4287 df-if 4491 df-pw 4566 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4870 df-int 4912 df-iun 4960 df-br 5110 df-opab 5172 df-mpt 5193 df-tr 5227 df-id 5535 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5592 df-se 5593 df-we 5594 df-xp 5643 df-rel 5644 df-cnv 5645 df-co 5646 df-dm 5647 df-rn 5648 df-res 5649 df-ima 5650 df-pred 6257 df-ord 6324 df-on 6325 df-lim 6326 df-suc 6327 df-iota 6452 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-isom 6509 df-riota 7317 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7807 df-1st 7925 df-2nd 7926 df-frecs 8216 df-wrecs 8247 df-recs 8321 df-rdg 8360 df-1o 8416 df-2o 8417 df-er 8654 df-en 8890 df-dom 8891 df-sdom 8892 df-fin 8893 df-sup 9386 df-inf 9387 df-oi 9454 df-card 9883 df-pnf 11199 df-mnf 11200 df-xr 11201 df-ltxr 11202 df-le 11203 df-sub 11395 df-neg 11396 df-div 11821 df-nn 12162 df-2 12224 df-3 12225 df-n0 12422 df-z 12508 df-uz 12772 df-rp 12924 df-fz 13434 df-fzo 13577 df-seq 13916 df-exp 13977 df-hash 14240 df-cj 14993 df-re 14994 df-im 14995 df-sqrt 15129 df-abs 15130 df-clim 15379 df-prod 15797 df-dvds 16145 df-gcd 16383 df-prm 16556 df-prmo 16912 |
This theorem is referenced by: prmgapprmo 16942 |
Copyright terms: Public domain | W3C validator |