Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > addmodlteqALT | GIF version |
Description: Two nonnegative integers less than the modulus are equal iff the sums of these integer with another integer are equal modulo the modulus. Shorter proof of addmodlteq 10178 based on the "divides" relation. (Contributed by AV, 14-Mar-2021.) (New usage is discouraged.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
addmodlteqALT | ⊢ ((𝐼 ∈ (0..^𝑁) ∧ 𝐽 ∈ (0..^𝑁) ∧ 𝑆 ∈ ℤ) → (((𝐼 + 𝑆) mod 𝑁) = ((𝐽 + 𝑆) mod 𝑁) ↔ 𝐼 = 𝐽)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elfzo0 9966 | . . . . 5 ⊢ (𝐼 ∈ (0..^𝑁) ↔ (𝐼 ∈ ℕ0 ∧ 𝑁 ∈ ℕ ∧ 𝐼 < 𝑁)) | |
2 | elfzoelz 9931 | . . . . . . . 8 ⊢ (𝐽 ∈ (0..^𝑁) → 𝐽 ∈ ℤ) | |
3 | simplrr 525 | . . . . . . . . . 10 ⊢ (((𝐽 ∈ ℤ ∧ (𝐼 ∈ ℕ0 ∧ 𝑁 ∈ ℕ)) ∧ 𝑆 ∈ ℤ) → 𝑁 ∈ ℕ) | |
4 | nn0z 9081 | . . . . . . . . . . . 12 ⊢ (𝐼 ∈ ℕ0 → 𝐼 ∈ ℤ) | |
5 | 4 | ad2antrl 481 | . . . . . . . . . . 11 ⊢ ((𝐽 ∈ ℤ ∧ (𝐼 ∈ ℕ0 ∧ 𝑁 ∈ ℕ)) → 𝐼 ∈ ℤ) |
6 | zaddcl 9101 | . . . . . . . . . . 11 ⊢ ((𝐼 ∈ ℤ ∧ 𝑆 ∈ ℤ) → (𝐼 + 𝑆) ∈ ℤ) | |
7 | 5, 6 | sylan 281 | . . . . . . . . . 10 ⊢ (((𝐽 ∈ ℤ ∧ (𝐼 ∈ ℕ0 ∧ 𝑁 ∈ ℕ)) ∧ 𝑆 ∈ ℤ) → (𝐼 + 𝑆) ∈ ℤ) |
8 | zaddcl 9101 | . . . . . . . . . . 11 ⊢ ((𝐽 ∈ ℤ ∧ 𝑆 ∈ ℤ) → (𝐽 + 𝑆) ∈ ℤ) | |
9 | 8 | adantlr 468 | . . . . . . . . . 10 ⊢ (((𝐽 ∈ ℤ ∧ (𝐼 ∈ ℕ0 ∧ 𝑁 ∈ ℕ)) ∧ 𝑆 ∈ ℤ) → (𝐽 + 𝑆) ∈ ℤ) |
10 | 3, 7, 9 | 3jca 1161 | . . . . . . . . 9 ⊢ (((𝐽 ∈ ℤ ∧ (𝐼 ∈ ℕ0 ∧ 𝑁 ∈ ℕ)) ∧ 𝑆 ∈ ℤ) → (𝑁 ∈ ℕ ∧ (𝐼 + 𝑆) ∈ ℤ ∧ (𝐽 + 𝑆) ∈ ℤ)) |
11 | 10 | exp31 361 | . . . . . . . 8 ⊢ (𝐽 ∈ ℤ → ((𝐼 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) → (𝑆 ∈ ℤ → (𝑁 ∈ ℕ ∧ (𝐼 + 𝑆) ∈ ℤ ∧ (𝐽 + 𝑆) ∈ ℤ)))) |
12 | 2, 11 | syl 14 | . . . . . . 7 ⊢ (𝐽 ∈ (0..^𝑁) → ((𝐼 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) → (𝑆 ∈ ℤ → (𝑁 ∈ ℕ ∧ (𝐼 + 𝑆) ∈ ℤ ∧ (𝐽 + 𝑆) ∈ ℤ)))) |
13 | 12 | com12 30 | . . . . . 6 ⊢ ((𝐼 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) → (𝐽 ∈ (0..^𝑁) → (𝑆 ∈ ℤ → (𝑁 ∈ ℕ ∧ (𝐼 + 𝑆) ∈ ℤ ∧ (𝐽 + 𝑆) ∈ ℤ)))) |
14 | 13 | 3adant3 1001 | . . . . 5 ⊢ ((𝐼 ∈ ℕ0 ∧ 𝑁 ∈ ℕ ∧ 𝐼 < 𝑁) → (𝐽 ∈ (0..^𝑁) → (𝑆 ∈ ℤ → (𝑁 ∈ ℕ ∧ (𝐼 + 𝑆) ∈ ℤ ∧ (𝐽 + 𝑆) ∈ ℤ)))) |
15 | 1, 14 | sylbi 120 | . . . 4 ⊢ (𝐼 ∈ (0..^𝑁) → (𝐽 ∈ (0..^𝑁) → (𝑆 ∈ ℤ → (𝑁 ∈ ℕ ∧ (𝐼 + 𝑆) ∈ ℤ ∧ (𝐽 + 𝑆) ∈ ℤ)))) |
16 | 15 | 3imp 1175 | . . 3 ⊢ ((𝐼 ∈ (0..^𝑁) ∧ 𝐽 ∈ (0..^𝑁) ∧ 𝑆 ∈ ℤ) → (𝑁 ∈ ℕ ∧ (𝐼 + 𝑆) ∈ ℤ ∧ (𝐽 + 𝑆) ∈ ℤ)) |
17 | moddvds 11509 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ (𝐼 + 𝑆) ∈ ℤ ∧ (𝐽 + 𝑆) ∈ ℤ) → (((𝐼 + 𝑆) mod 𝑁) = ((𝐽 + 𝑆) mod 𝑁) ↔ 𝑁 ∥ ((𝐼 + 𝑆) − (𝐽 + 𝑆)))) | |
18 | 16, 17 | syl 14 | . 2 ⊢ ((𝐼 ∈ (0..^𝑁) ∧ 𝐽 ∈ (0..^𝑁) ∧ 𝑆 ∈ ℤ) → (((𝐼 + 𝑆) mod 𝑁) = ((𝐽 + 𝑆) mod 𝑁) ↔ 𝑁 ∥ ((𝐼 + 𝑆) − (𝐽 + 𝑆)))) |
19 | elfzoel2 9930 | . . . . 5 ⊢ (𝐼 ∈ (0..^𝑁) → 𝑁 ∈ ℤ) | |
20 | zcn 9066 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
21 | 20 | subid1d 8069 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → (𝑁 − 0) = 𝑁) |
22 | 21 | eqcomd 2145 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 = (𝑁 − 0)) |
23 | 19, 22 | syl 14 | . . . 4 ⊢ (𝐼 ∈ (0..^𝑁) → 𝑁 = (𝑁 − 0)) |
24 | 23 | 3ad2ant1 1002 | . . 3 ⊢ ((𝐼 ∈ (0..^𝑁) ∧ 𝐽 ∈ (0..^𝑁) ∧ 𝑆 ∈ ℤ) → 𝑁 = (𝑁 − 0)) |
25 | elfzoelz 9931 | . . . . 5 ⊢ (𝐼 ∈ (0..^𝑁) → 𝐼 ∈ ℤ) | |
26 | 25 | zcnd 9181 | . . . 4 ⊢ (𝐼 ∈ (0..^𝑁) → 𝐼 ∈ ℂ) |
27 | 2 | zcnd 9181 | . . . 4 ⊢ (𝐽 ∈ (0..^𝑁) → 𝐽 ∈ ℂ) |
28 | zcn 9066 | . . . 4 ⊢ (𝑆 ∈ ℤ → 𝑆 ∈ ℂ) | |
29 | pnpcan2 8009 | . . . 4 ⊢ ((𝐼 ∈ ℂ ∧ 𝐽 ∈ ℂ ∧ 𝑆 ∈ ℂ) → ((𝐼 + 𝑆) − (𝐽 + 𝑆)) = (𝐼 − 𝐽)) | |
30 | 26, 27, 28, 29 | syl3an 1258 | . . 3 ⊢ ((𝐼 ∈ (0..^𝑁) ∧ 𝐽 ∈ (0..^𝑁) ∧ 𝑆 ∈ ℤ) → ((𝐼 + 𝑆) − (𝐽 + 𝑆)) = (𝐼 − 𝐽)) |
31 | 24, 30 | breq12d 3942 | . 2 ⊢ ((𝐼 ∈ (0..^𝑁) ∧ 𝐽 ∈ (0..^𝑁) ∧ 𝑆 ∈ ℤ) → (𝑁 ∥ ((𝐼 + 𝑆) − (𝐽 + 𝑆)) ↔ (𝑁 − 0) ∥ (𝐼 − 𝐽))) |
32 | fzocongeq 11563 | . . 3 ⊢ ((𝐼 ∈ (0..^𝑁) ∧ 𝐽 ∈ (0..^𝑁)) → ((𝑁 − 0) ∥ (𝐼 − 𝐽) ↔ 𝐼 = 𝐽)) | |
33 | 32 | 3adant3 1001 | . 2 ⊢ ((𝐼 ∈ (0..^𝑁) ∧ 𝐽 ∈ (0..^𝑁) ∧ 𝑆 ∈ ℤ) → ((𝑁 − 0) ∥ (𝐼 − 𝐽) ↔ 𝐼 = 𝐽)) |
34 | 18, 31, 33 | 3bitrd 213 | 1 ⊢ ((𝐼 ∈ (0..^𝑁) ∧ 𝐽 ∈ (0..^𝑁) ∧ 𝑆 ∈ ℤ) → (((𝐼 + 𝑆) mod 𝑁) = ((𝐽 + 𝑆) mod 𝑁) ↔ 𝐼 = 𝐽)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∧ w3a 962 = wceq 1331 ∈ wcel 1480 class class class wbr 3929 (class class class)co 5774 ℂcc 7625 0cc0 7627 + caddc 7630 < clt 7807 − cmin 7940 ℕcn 8727 ℕ0cn0 8984 ℤcz 9061 ..^cfzo 9926 mod cmo 10102 ∥ cdvds 11500 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-coll 4043 ax-sep 4046 ax-nul 4054 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-iinf 4502 ax-cnex 7718 ax-resscn 7719 ax-1cn 7720 ax-1re 7721 ax-icn 7722 ax-addcl 7723 ax-addrcl 7724 ax-mulcl 7725 ax-mulrcl 7726 ax-addcom 7727 ax-mulcom 7728 ax-addass 7729 ax-mulass 7730 ax-distr 7731 ax-i2m1 7732 ax-0lt1 7733 ax-1rid 7734 ax-0id 7735 ax-rnegex 7736 ax-precex 7737 ax-cnre 7738 ax-pre-ltirr 7739 ax-pre-ltwlin 7740 ax-pre-lttrn 7741 ax-pre-apti 7742 ax-pre-ltadd 7743 ax-pre-mulgt0 7744 ax-pre-mulext 7745 ax-arch 7746 ax-caucvg 7747 |
This theorem depends on definitions: df-bi 116 df-dc 820 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-nel 2404 df-ral 2421 df-rex 2422 df-reu 2423 df-rmo 2424 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-nul 3364 df-if 3475 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-iun 3815 df-br 3930 df-opab 3990 df-mpt 3991 df-tr 4027 df-id 4215 df-po 4218 df-iso 4219 df-iord 4288 df-on 4290 df-ilim 4291 df-suc 4293 df-iom 4505 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-f1 5128 df-fo 5129 df-f1o 5130 df-fv 5131 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-1st 6038 df-2nd 6039 df-recs 6202 df-frec 6288 df-pnf 7809 df-mnf 7810 df-xr 7811 df-ltxr 7812 df-le 7813 df-sub 7942 df-neg 7943 df-reap 8344 df-ap 8351 df-div 8440 df-inn 8728 df-2 8786 df-3 8787 df-4 8788 df-n0 8985 df-z 9062 df-uz 9334 df-q 9419 df-rp 9449 df-fz 9798 df-fzo 9927 df-fl 10050 df-mod 10103 df-seqfrec 10226 df-exp 10300 df-cj 10621 df-re 10622 df-im 10623 df-rsqrt 10777 df-abs 10778 df-dvds 11501 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |