| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > modaddid | Structured version Visualization version GIF version | ||
| Description: The sums of two nonnegative integers less than the modulus and an integer are equal iff the two nonnegative integers are equal. (Contributed by AV, 14-Nov-2025.) |
| Ref | Expression |
|---|---|
| modaddid.i | ⊢ 𝐼 = (0..^𝑁) |
| Ref | Expression |
|---|---|
| modaddid | ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) ∧ 𝐾 ∈ ℤ) → (((𝑋 + 𝐾) mod 𝑁) = ((𝑌 + 𝐾) mod 𝑁) ↔ 𝑋 = 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elfzoelz 13626 | . . . . . . 7 ⊢ (𝑋 ∈ (0..^𝑁) → 𝑋 ∈ ℤ) | |
| 2 | 1 | zred 12644 | . . . . . 6 ⊢ (𝑋 ∈ (0..^𝑁) → 𝑋 ∈ ℝ) |
| 3 | modaddid.i | . . . . . 6 ⊢ 𝐼 = (0..^𝑁) | |
| 4 | 2, 3 | eleq2s 2847 | . . . . 5 ⊢ (𝑋 ∈ 𝐼 → 𝑋 ∈ ℝ) |
| 5 | elfzoelz 13626 | . . . . . . 7 ⊢ (𝑌 ∈ (0..^𝑁) → 𝑌 ∈ ℤ) | |
| 6 | 5 | zred 12644 | . . . . . 6 ⊢ (𝑌 ∈ (0..^𝑁) → 𝑌 ∈ ℝ) |
| 7 | 6, 3 | eleq2s 2847 | . . . . 5 ⊢ (𝑌 ∈ 𝐼 → 𝑌 ∈ ℝ) |
| 8 | 4, 7 | anim12i 613 | . . . 4 ⊢ ((𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) → (𝑋 ∈ ℝ ∧ 𝑌 ∈ ℝ)) |
| 9 | 8 | 3ad2ant2 1134 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) ∧ 𝐾 ∈ ℤ) → (𝑋 ∈ ℝ ∧ 𝑌 ∈ ℝ)) |
| 10 | eluz3nn 12854 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘3) → 𝑁 ∈ ℕ) | |
| 11 | 10 | nnrpd 12999 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘3) → 𝑁 ∈ ℝ+) |
| 12 | zre 12539 | . . . 4 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℝ) | |
| 13 | 11, 12 | anim12ci 614 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ ℤ) → (𝐾 ∈ ℝ ∧ 𝑁 ∈ ℝ+)) |
| 14 | modaddb 13877 | . . 3 ⊢ (((𝑋 ∈ ℝ ∧ 𝑌 ∈ ℝ) ∧ (𝐾 ∈ ℝ ∧ 𝑁 ∈ ℝ+)) → ((𝑋 mod 𝑁) = (𝑌 mod 𝑁) ↔ ((𝑋 + 𝐾) mod 𝑁) = ((𝑌 + 𝐾) mod 𝑁))) | |
| 15 | 9, 13, 14 | 3imp3i2an 1346 | . 2 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) ∧ 𝐾 ∈ ℤ) → ((𝑋 mod 𝑁) = (𝑌 mod 𝑁) ↔ ((𝑋 + 𝐾) mod 𝑁) = ((𝑌 + 𝐾) mod 𝑁))) |
| 16 | zmodidfzoimp 13869 | . . . . 5 ⊢ (𝑋 ∈ (0..^𝑁) → (𝑋 mod 𝑁) = 𝑋) | |
| 17 | 16, 3 | eleq2s 2847 | . . . 4 ⊢ (𝑋 ∈ 𝐼 → (𝑋 mod 𝑁) = 𝑋) |
| 18 | zmodidfzoimp 13869 | . . . . 5 ⊢ (𝑌 ∈ (0..^𝑁) → (𝑌 mod 𝑁) = 𝑌) | |
| 19 | 18, 3 | eleq2s 2847 | . . . 4 ⊢ (𝑌 ∈ 𝐼 → (𝑌 mod 𝑁) = 𝑌) |
| 20 | 17, 19 | eqeqan12d 2744 | . . 3 ⊢ ((𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) → ((𝑋 mod 𝑁) = (𝑌 mod 𝑁) ↔ 𝑋 = 𝑌)) |
| 21 | 20 | 3ad2ant2 1134 | . 2 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) ∧ 𝐾 ∈ ℤ) → ((𝑋 mod 𝑁) = (𝑌 mod 𝑁) ↔ 𝑋 = 𝑌)) |
| 22 | 15, 21 | bitr3d 281 | 1 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) ∧ 𝐾 ∈ ℤ) → (((𝑋 + 𝐾) mod 𝑁) = ((𝑌 + 𝐾) mod 𝑁) ↔ 𝑋 = 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ‘cfv 6513 (class class class)co 7389 ℝcr 11073 0cc0 11074 + caddc 11077 3c3 12243 ℤcz 12535 ℤ≥cuz 12799 ℝ+crp 12957 ..^cfzo 13621 mod cmo 13837 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5253 ax-nul 5263 ax-pow 5322 ax-pr 5389 ax-un 7713 ax-cnex 11130 ax-resscn 11131 ax-1cn 11132 ax-icn 11133 ax-addcl 11134 ax-addrcl 11135 ax-mulcl 11136 ax-mulrcl 11137 ax-mulcom 11138 ax-addass 11139 ax-mulass 11140 ax-distr 11141 ax-i2m1 11142 ax-1ne0 11143 ax-1rid 11144 ax-rnegex 11145 ax-rrecex 11146 ax-cnre 11147 ax-pre-lttri 11148 ax-pre-lttrn 11149 ax-pre-ltadd 11150 ax-pre-mulgt0 11151 ax-pre-sup 11152 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3756 df-csb 3865 df-dif 3919 df-un 3921 df-in 3923 df-ss 3933 df-pss 3936 df-nul 4299 df-if 4491 df-pw 4567 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-iun 4959 df-br 5110 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6276 df-ord 6337 df-on 6338 df-lim 6339 df-suc 6340 df-iota 6466 df-fun 6515 df-fn 6516 df-f 6517 df-f1 6518 df-fo 6519 df-f1o 6520 df-fv 6521 df-riota 7346 df-ov 7392 df-oprab 7393 df-mpo 7394 df-om 7845 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8380 df-er 8673 df-en 8921 df-dom 8922 df-sdom 8923 df-sup 9399 df-inf 9400 df-pnf 11216 df-mnf 11217 df-xr 11218 df-ltxr 11219 df-le 11220 df-sub 11413 df-neg 11414 df-div 11842 df-nn 12188 df-2 12250 df-3 12251 df-n0 12449 df-z 12536 df-uz 12800 df-rp 12958 df-fz 13475 df-fzo 13622 df-fl 13760 df-mod 13838 |
| This theorem is referenced by: gpgedg2ov 48047 gpgedg2iv 48048 |
| Copyright terms: Public domain | W3C validator |