| 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 12835 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘4) → 𝑁 ∈ ℕ) | |
| 2 | 1 | adantr 482 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘4) ∧ 𝐴 ∈ ℤ) → 𝑁 ∈ ℕ) |
| 3 | simpr 486 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘4) ∧ 𝐴 ∈ ℤ) → 𝐴 ∈ ℤ) | |
| 4 | 2z 12554 | . . . 4 ⊢ 2 ∈ ℤ | |
| 5 | 4 | a1i 11 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘4) ∧ 𝐴 ∈ ℤ) → 2 ∈ ℤ) |
| 6 | 1zzd 12553 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘4) ∧ 𝐴 ∈ ℤ) → 1 ∈ ℤ) | |
| 7 | 1le3 12383 | . . . . 5 ⊢ 1 ≤ 3 | |
| 8 | 2p1e3 12313 | . . . . 5 ⊢ (2 + 1) = 3 | |
| 9 | 7, 8 | breqtrri 5102 | . . . 4 ⊢ 1 ≤ (2 + 1) |
| 10 | 9 | a1i 11 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘4) ∧ 𝐴 ∈ ℤ) → 1 ≤ (2 + 1)) |
| 11 | eluz2 12789 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘4) ↔ (4 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 4 ≤ 𝑁)) | |
| 12 | df-4 12241 | . . . . . . . . 9 ⊢ 4 = (3 + 1) | |
| 13 | 12 | breq1i 5082 | . . . . . . . 8 ⊢ (4 ≤ 𝑁 ↔ (3 + 1) ≤ 𝑁) |
| 14 | 3z 12555 | . . . . . . . . . . 11 ⊢ 3 ∈ ℤ | |
| 15 | 14 | a1i 11 | . . . . . . . . . 10 ⊢ (4 ∈ ℤ → 3 ∈ ℤ) |
| 16 | zltp1le 12572 | . . . . . . . . . 10 ⊢ ((3 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (3 < 𝑁 ↔ (3 + 1) ≤ 𝑁)) | |
| 17 | 15, 16 | sylan 587 | . . . . . . . . 9 ⊢ ((4 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (3 < 𝑁 ↔ (3 + 1) ≤ 𝑁)) |
| 18 | 17 | biimprd 250 | . . . . . . . 8 ⊢ ((4 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((3 + 1) ≤ 𝑁 → 3 < 𝑁)) |
| 19 | 13, 18 | biimtrid 244 | . . . . . . 7 ⊢ ((4 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (4 ≤ 𝑁 → 3 < 𝑁)) |
| 20 | 19 | 3impia 1124 | . . . . . 6 ⊢ ((4 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 4 ≤ 𝑁) → 3 < 𝑁) |
| 21 | 11, 20 | sylbi 219 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘4) → 3 < 𝑁) |
| 22 | 8, 21 | eqbrtrid 5110 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘4) → (2 + 1) < 𝑁) |
| 23 | 22 | adantr 482 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘4) ∧ 𝐴 ∈ ℤ) → (2 + 1) < 𝑁) |
| 24 | submodneaddmod 47834 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ (𝐴 ∈ ℤ ∧ 2 ∈ ℤ ∧ 1 ∈ ℤ) ∧ (1 ≤ (2 + 1) ∧ (2 + 1) < 𝑁)) → ((𝐴 + 2) mod 𝑁) ≠ ((𝐴 − 1) mod 𝑁)) | |
| 25 | 2, 3, 5, 6, 10, 23, 24 | syl132anc 1397 | . 2 ⊢ ((𝑁 ∈ (ℤ≥‘4) ∧ 𝐴 ∈ ℤ) → ((𝐴 + 2) mod 𝑁) ≠ ((𝐴 − 1) mod 𝑁)) |
| 26 | 25 | necomd 2991 | 1 ⊢ ((𝑁 ∈ (ℤ≥‘4) ∧ 𝐴 ∈ ℤ) → ((𝐴 − 1) mod 𝑁) ≠ ((𝐴 + 2) mod 𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 397 ∧ w3a 1093 ∈ wcel 2121 ≠ wne 2936 class class class wbr 5075 ‘cfv 6489 (class class class)co 7360 1c1 11034 + caddc 11036 < clt 11174 ≤ cle 11175 − cmin 11372 ℕcn 12169 2c2 12231 3c3 12232 4c4 12233 ℤcz 12519 ℤ≥cuz 12783 mod cmo 13823 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5221 ax-nul 5231 ax-pow 5297 ax-pr 5365 ax-un 7682 ax-cnex 11089 ax-resscn 11090 ax-1cn 11091 ax-icn 11092 ax-addcl 11093 ax-addrcl 11094 ax-mulcl 11095 ax-mulrcl 11096 ax-mulcom 11097 ax-addass 11098 ax-mulass 11099 ax-distr 11100 ax-i2m1 11101 ax-1ne0 11102 ax-1rid 11103 ax-rnegex 11104 ax-rrecex 11105 ax-cnre 11106 ax-pre-lttri 11107 ax-pre-lttrn 11108 ax-pre-ltadd 11109 ax-pre-mulgt0 11110 ax-pre-sup 11111 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-rmo 3346 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-iun 4926 df-br 5076 df-opab 5138 df-mpt 5157 df-tr 5183 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-sup 9349 df-inf 9350 df-pnf 11176 df-mnf 11177 df-xr 11178 df-ltxr 11179 df-le 11180 df-sub 11374 df-neg 11375 df-div 11803 df-nn 12170 df-2 12239 df-3 12240 df-4 12241 df-n0 12433 df-z 12520 df-uz 12784 df-rp 12938 df-fz 13457 df-fzo 13604 df-fl 13746 df-mod 13824 df-dvds 16217 |
| This theorem is referenced by: gpg5nbgrvtx03starlem2 48574 |
| Copyright terms: Public domain | W3C validator |