Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > mulqaddmodid | Unicode version |
Description: The sum of a positive rational number less than an upper bound and the product of an integer and the upper bound is the positive rational number modulo the upper bound. (Contributed by Jim Kingdon, 23-Oct-2021.) |
Ref | Expression |
---|---|
mulqaddmodid |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpll 495 | . . . . . 6 | |
2 | 1 | zcnd 8470 | . . . . 5 |
3 | qre 8710 | . . . . . . 7 | |
4 | 3 | ad2antlr 472 | . . . . . 6 |
5 | 4 | recnd 7147 | . . . . 5 |
6 | 2, 5 | mulcld 7139 | . . . 4 |
7 | simprr 498 | . . . . . . 7 | |
8 | 0red 7120 | . . . . . . . 8 | |
9 | 4 | rexrd 7168 | . . . . . . . 8 |
10 | elico2 8960 | . . . . . . . 8 | |
11 | 8, 9, 10 | syl2anc 403 | . . . . . . 7 |
12 | 7, 11 | mpbid 145 | . . . . . 6 |
13 | 12 | simp1d 950 | . . . . 5 |
14 | 13 | recnd 7147 | . . . 4 |
15 | 6, 14 | addcomd 7259 | . . 3 |
16 | 15 | oveq1d 5547 | . 2 |
17 | simprl 497 | . . 3 | |
18 | simplr 496 | . . 3 | |
19 | 12 | simp2d 951 | . . . 4 |
20 | 12 | simp3d 952 | . . . 4 |
21 | 8, 13, 4, 19, 20 | lelttrd 7234 | . . 3 |
22 | modqcyc 9361 | . . 3 | |
23 | 17, 1, 18, 21, 22 | syl22anc 1170 | . 2 |
24 | modqid 9351 | . . 3 | |
25 | 17, 18, 19, 20, 24 | syl22anc 1170 | . 2 |
26 | 16, 23, 25 | 3eqtrd 2117 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 102 wb 103 w3a 919 wceq 1284 wcel 1433 class class class wbr 3785 (class class class)co 5532 cr 6980 cc0 6981 caddc 6984 cmul 6986 cxr 7152 clt 7153 cle 7154 cz 8351 cq 8704 cico 8913 cmo 9324 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 576 ax-in2 577 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-13 1444 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-sep 3896 ax-pow 3948 ax-pr 3964 ax-un 4188 ax-setind 4280 ax-cnex 7067 ax-resscn 7068 ax-1cn 7069 ax-1re 7070 ax-icn 7071 ax-addcl 7072 ax-addrcl 7073 ax-mulcl 7074 ax-mulrcl 7075 ax-addcom 7076 ax-mulcom 7077 ax-addass 7078 ax-mulass 7079 ax-distr 7080 ax-i2m1 7081 ax-0lt1 7082 ax-1rid 7083 ax-0id 7084 ax-rnegex 7085 ax-precex 7086 ax-cnre 7087 ax-pre-ltirr 7088 ax-pre-ltwlin 7089 ax-pre-lttrn 7090 ax-pre-apti 7091 ax-pre-ltadd 7092 ax-pre-mulgt0 7093 ax-pre-mulext 7094 ax-arch 7095 |
This theorem depends on definitions: df-bi 115 df-3or 920 df-3an 921 df-tru 1287 df-fal 1290 df-nf 1390 df-sb 1686 df-eu 1944 df-mo 1945 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ne 2246 df-nel 2340 df-ral 2353 df-rex 2354 df-reu 2355 df-rmo 2356 df-rab 2357 df-v 2603 df-sbc 2816 df-csb 2909 df-dif 2975 df-un 2977 df-in 2979 df-ss 2986 df-pw 3384 df-sn 3404 df-pr 3405 df-op 3407 df-uni 3602 df-int 3637 df-iun 3680 df-br 3786 df-opab 3840 df-mpt 3841 df-id 4048 df-po 4051 df-iso 4052 df-xp 4369 df-rel 4370 df-cnv 4371 df-co 4372 df-dm 4373 df-rn 4374 df-res 4375 df-ima 4376 df-iota 4887 df-fun 4924 df-fn 4925 df-f 4926 df-fv 4930 df-riota 5488 df-ov 5535 df-oprab 5536 df-mpt2 5537 df-1st 5787 df-2nd 5788 df-pnf 7155 df-mnf 7156 df-xr 7157 df-ltxr 7158 df-le 7159 df-sub 7281 df-neg 7282 df-reap 7675 df-ap 7682 df-div 7761 df-inn 8040 df-n0 8289 df-z 8352 df-q 8705 df-rp 8735 df-ico 8917 df-fl 9274 df-mod 9325 |
This theorem is referenced by: modqmuladd 9368 addmodid 9374 |
Copyright terms: Public domain | W3C validator |