| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > m1modnep2mod | Structured version Visualization version GIF version | ||
| Description: A nonnegative integer minus 1 is not itself plus 2 modulo an integer greater than 3 and the nonnegative integer. (Contributed by AV, 6-Sep-2025.) |
| Ref | Expression |
|---|---|
| m1modnep2mod | ⊢ ((𝑁 ∈ (ℤ≥‘4) ∧ 𝐴 ∈ ℤ) → ((𝐴 − 1) mod 𝑁) ≠ ((𝐴 + 2) mod 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluz4nn 12831 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘4) → 𝑁 ∈ ℕ) | |
| 2 | 1 | adantr 480 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘4) ∧ 𝐴 ∈ ℤ) → 𝑁 ∈ ℕ) |
| 3 | simpr 484 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘4) ∧ 𝐴 ∈ ℤ) → 𝐴 ∈ ℤ) | |
| 4 | 2z 12550 | . . . 4 ⊢ 2 ∈ ℤ | |
| 5 | 4 | a1i 11 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘4) ∧ 𝐴 ∈ ℤ) → 2 ∈ ℤ) |
| 6 | 1zzd 12549 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘4) ∧ 𝐴 ∈ ℤ) → 1 ∈ ℤ) | |
| 7 | 1le3 12379 | . . . . 5 ⊢ 1 ≤ 3 | |
| 8 | 2p1e3 12309 | . . . . 5 ⊢ (2 + 1) = 3 | |
| 9 | 7, 8 | breqtrri 5113 | . . . 4 ⊢ 1 ≤ (2 + 1) |
| 10 | 9 | a1i 11 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘4) ∧ 𝐴 ∈ ℤ) → 1 ≤ (2 + 1)) |
| 11 | eluz2 12785 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘4) ↔ (4 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 4 ≤ 𝑁)) | |
| 12 | df-4 12237 | . . . . . . . . 9 ⊢ 4 = (3 + 1) | |
| 13 | 12 | breq1i 5093 | . . . . . . . 8 ⊢ (4 ≤ 𝑁 ↔ (3 + 1) ≤ 𝑁) |
| 14 | 3z 12551 | . . . . . . . . . . 11 ⊢ 3 ∈ ℤ | |
| 15 | 14 | a1i 11 | . . . . . . . . . 10 ⊢ (4 ∈ ℤ → 3 ∈ ℤ) |
| 16 | zltp1le 12568 | . . . . . . . . . 10 ⊢ ((3 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (3 < 𝑁 ↔ (3 + 1) ≤ 𝑁)) | |
| 17 | 15, 16 | sylan 581 | . . . . . . . . 9 ⊢ ((4 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (3 < 𝑁 ↔ (3 + 1) ≤ 𝑁)) |
| 18 | 17 | biimprd 248 | . . . . . . . 8 ⊢ ((4 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((3 + 1) ≤ 𝑁 → 3 < 𝑁)) |
| 19 | 13, 18 | biimtrid 242 | . . . . . . 7 ⊢ ((4 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (4 ≤ 𝑁 → 3 < 𝑁)) |
| 20 | 19 | 3impia 1118 | . . . . . 6 ⊢ ((4 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 4 ≤ 𝑁) → 3 < 𝑁) |
| 21 | 11, 20 | sylbi 217 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘4) → 3 < 𝑁) |
| 22 | 8, 21 | eqbrtrid 5121 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘4) → (2 + 1) < 𝑁) |
| 23 | 22 | adantr 480 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘4) ∧ 𝐴 ∈ ℤ) → (2 + 1) < 𝑁) |
| 24 | submodneaddmod 47817 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ (𝐴 ∈ ℤ ∧ 2 ∈ ℤ ∧ 1 ∈ ℤ) ∧ (1 ≤ (2 + 1) ∧ (2 + 1) < 𝑁)) → ((𝐴 + 2) mod 𝑁) ≠ ((𝐴 − 1) mod 𝑁)) | |
| 25 | 2, 3, 5, 6, 10, 23, 24 | syl132anc 1391 | . 2 ⊢ ((𝑁 ∈ (ℤ≥‘4) ∧ 𝐴 ∈ ℤ) → ((𝐴 + 2) mod 𝑁) ≠ ((𝐴 − 1) mod 𝑁)) |
| 26 | 25 | necomd 2988 | 1 ⊢ ((𝑁 ∈ (ℤ≥‘4) ∧ 𝐴 ∈ ℤ) → ((𝐴 − 1) mod 𝑁) ≠ ((𝐴 + 2) mod 𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 ∈ wcel 2114 ≠ wne 2933 class class class wbr 5086 ‘cfv 6492 (class class class)co 7360 1c1 11030 + caddc 11032 < clt 11170 ≤ cle 11171 − cmin 11368 ℕcn 12165 2c2 12227 3c3 12228 4c4 12229 ℤcz 12515 ℤ≥cuz 12779 mod cmo 13819 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-sup 9348 df-inf 9349 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-3 12236 df-4 12237 df-n0 12429 df-z 12516 df-uz 12780 df-rp 12934 df-fz 13453 df-fzo 13600 df-fl 13742 df-mod 13820 df-dvds 16213 |
| This theorem is referenced by: gpg5nbgrvtx03starlem2 48557 |
| Copyright terms: Public domain | W3C validator |