![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > modqeqmodmin | GIF version |
Description: A rational number equals the difference of the rational number and a modulus modulo the modulus. (Contributed by Jim Kingdon, 26-Oct-2021.) |
Ref | Expression |
---|---|
modqeqmodmin | ⊢ ((𝐴 ∈ ℚ ∧ 𝑀 ∈ ℚ ∧ 0 < 𝑀) → (𝐴 mod 𝑀) = ((𝐴 − 𝑀) mod 𝑀)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | modqid0 9818 | . . . . 5 ⊢ ((𝑀 ∈ ℚ ∧ 0 < 𝑀) → (𝑀 mod 𝑀) = 0) | |
2 | 1 | 3adant1 962 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝑀 ∈ ℚ ∧ 0 < 𝑀) → (𝑀 mod 𝑀) = 0) |
3 | modqge0 9800 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝑀 ∈ ℚ ∧ 0 < 𝑀) → 0 ≤ (𝐴 mod 𝑀)) | |
4 | 2, 3 | eqbrtrd 3871 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝑀 ∈ ℚ ∧ 0 < 𝑀) → (𝑀 mod 𝑀) ≤ (𝐴 mod 𝑀)) |
5 | simp1 944 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝑀 ∈ ℚ ∧ 0 < 𝑀) → 𝐴 ∈ ℚ) | |
6 | simp2 945 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝑀 ∈ ℚ ∧ 0 < 𝑀) → 𝑀 ∈ ℚ) | |
7 | simp3 946 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝑀 ∈ ℚ ∧ 0 < 𝑀) → 0 < 𝑀) | |
8 | modqsubdir 9861 | . . . 4 ⊢ (((𝐴 ∈ ℚ ∧ 𝑀 ∈ ℚ) ∧ (𝑀 ∈ ℚ ∧ 0 < 𝑀)) → ((𝑀 mod 𝑀) ≤ (𝐴 mod 𝑀) ↔ ((𝐴 − 𝑀) mod 𝑀) = ((𝐴 mod 𝑀) − (𝑀 mod 𝑀)))) | |
9 | 5, 6, 6, 7, 8 | syl22anc 1176 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝑀 ∈ ℚ ∧ 0 < 𝑀) → ((𝑀 mod 𝑀) ≤ (𝐴 mod 𝑀) ↔ ((𝐴 − 𝑀) mod 𝑀) = ((𝐴 mod 𝑀) − (𝑀 mod 𝑀)))) |
10 | 4, 9 | mpbid 146 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝑀 ∈ ℚ ∧ 0 < 𝑀) → ((𝐴 − 𝑀) mod 𝑀) = ((𝐴 mod 𝑀) − (𝑀 mod 𝑀))) |
11 | 2 | eqcomd 2094 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝑀 ∈ ℚ ∧ 0 < 𝑀) → 0 = (𝑀 mod 𝑀)) |
12 | 11 | oveq2d 5682 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝑀 ∈ ℚ ∧ 0 < 𝑀) → ((𝐴 mod 𝑀) − 0) = ((𝐴 mod 𝑀) − (𝑀 mod 𝑀))) |
13 | modqcl 9794 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝑀 ∈ ℚ ∧ 0 < 𝑀) → (𝐴 mod 𝑀) ∈ ℚ) | |
14 | qcn 9180 | . . . 4 ⊢ ((𝐴 mod 𝑀) ∈ ℚ → (𝐴 mod 𝑀) ∈ ℂ) | |
15 | 13, 14 | syl 14 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝑀 ∈ ℚ ∧ 0 < 𝑀) → (𝐴 mod 𝑀) ∈ ℂ) |
16 | 15 | subid1d 7843 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝑀 ∈ ℚ ∧ 0 < 𝑀) → ((𝐴 mod 𝑀) − 0) = (𝐴 mod 𝑀)) |
17 | 10, 12, 16 | 3eqtr2rd 2128 | 1 ⊢ ((𝐴 ∈ ℚ ∧ 𝑀 ∈ ℚ ∧ 0 < 𝑀) → (𝐴 mod 𝑀) = ((𝐴 − 𝑀) mod 𝑀)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 ∧ w3a 925 = wceq 1290 ∈ wcel 1439 class class class wbr 3851 (class class class)co 5666 ℂcc 7409 0cc0 7411 < clt 7583 ≤ cle 7584 − cmin 7714 ℚcq 9165 mod cmo 9790 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 580 ax-in2 581 ax-io 666 ax-5 1382 ax-7 1383 ax-gen 1384 ax-ie1 1428 ax-ie2 1429 ax-8 1441 ax-10 1442 ax-11 1443 ax-i12 1444 ax-bndl 1445 ax-4 1446 ax-13 1450 ax-14 1451 ax-17 1465 ax-i9 1469 ax-ial 1473 ax-i5r 1474 ax-ext 2071 ax-sep 3963 ax-pow 4015 ax-pr 4045 ax-un 4269 ax-setind 4366 ax-cnex 7497 ax-resscn 7498 ax-1cn 7499 ax-1re 7500 ax-icn 7501 ax-addcl 7502 ax-addrcl 7503 ax-mulcl 7504 ax-mulrcl 7505 ax-addcom 7506 ax-mulcom 7507 ax-addass 7508 ax-mulass 7509 ax-distr 7510 ax-i2m1 7511 ax-0lt1 7512 ax-1rid 7513 ax-0id 7514 ax-rnegex 7515 ax-precex 7516 ax-cnre 7517 ax-pre-ltirr 7518 ax-pre-ltwlin 7519 ax-pre-lttrn 7520 ax-pre-apti 7521 ax-pre-ltadd 7522 ax-pre-mulgt0 7523 ax-pre-mulext 7524 ax-arch 7525 |
This theorem depends on definitions: df-bi 116 df-3or 926 df-3an 927 df-tru 1293 df-fal 1296 df-nf 1396 df-sb 1694 df-eu 1952 df-mo 1953 df-clab 2076 df-cleq 2082 df-clel 2085 df-nfc 2218 df-ne 2257 df-nel 2352 df-ral 2365 df-rex 2366 df-reu 2367 df-rmo 2368 df-rab 2369 df-v 2622 df-sbc 2842 df-csb 2935 df-dif 3002 df-un 3004 df-in 3006 df-ss 3013 df-pw 3435 df-sn 3456 df-pr 3457 df-op 3459 df-uni 3660 df-int 3695 df-iun 3738 df-br 3852 df-opab 3906 df-mpt 3907 df-id 4129 df-po 4132 df-iso 4133 df-xp 4458 df-rel 4459 df-cnv 4460 df-co 4461 df-dm 4462 df-rn 4463 df-res 4464 df-ima 4465 df-iota 4993 df-fun 5030 df-fn 5031 df-f 5032 df-fv 5036 df-riota 5622 df-ov 5669 df-oprab 5670 df-mpt2 5671 df-1st 5925 df-2nd 5926 df-pnf 7585 df-mnf 7586 df-xr 7587 df-ltxr 7588 df-le 7589 df-sub 7716 df-neg 7717 df-reap 8113 df-ap 8120 df-div 8201 df-inn 8484 df-n0 8735 df-z 8812 df-q 9166 df-rp 9196 df-fl 9738 df-mod 9791 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |