| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > modqadd12d | GIF version | ||
| Description: Additive property of the modulo operation. (Contributed by Jim Kingdon, 25-Oct-2021.) |
| Ref | Expression |
|---|---|
| modqadd12d.1 | ⊢ (𝜑 → 𝐴 ∈ ℚ) |
| modqadd12d.2 | ⊢ (𝜑 → 𝐵 ∈ ℚ) |
| modqadd12d.3 | ⊢ (𝜑 → 𝐶 ∈ ℚ) |
| modqadd12d.4 | ⊢ (𝜑 → 𝐷 ∈ ℚ) |
| modqadd12d.5 | ⊢ (𝜑 → 𝐸 ∈ ℚ) |
| modqadd12d.egt0 | ⊢ (𝜑 → 0 < 𝐸) |
| modqadd12d.6 | ⊢ (𝜑 → (𝐴 mod 𝐸) = (𝐵 mod 𝐸)) |
| modqadd12d.7 | ⊢ (𝜑 → (𝐶 mod 𝐸) = (𝐷 mod 𝐸)) |
| Ref | Expression |
|---|---|
| modqadd12d | ⊢ (𝜑 → ((𝐴 + 𝐶) mod 𝐸) = ((𝐵 + 𝐷) mod 𝐸)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | modqadd12d.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℚ) | |
| 2 | modqadd12d.2 | . . 3 ⊢ (𝜑 → 𝐵 ∈ ℚ) | |
| 3 | modqadd12d.3 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℚ) | |
| 4 | modqadd12d.5 | . . 3 ⊢ (𝜑 → 𝐸 ∈ ℚ) | |
| 5 | modqadd12d.egt0 | . . 3 ⊢ (𝜑 → 0 < 𝐸) | |
| 6 | modqadd12d.6 | . . 3 ⊢ (𝜑 → (𝐴 mod 𝐸) = (𝐵 mod 𝐸)) | |
| 7 | 1, 2, 3, 4, 5, 6 | modqadd1 10747 | . 2 ⊢ (𝜑 → ((𝐴 + 𝐶) mod 𝐸) = ((𝐵 + 𝐶) mod 𝐸)) |
| 8 | qcn 9984 | . . . . . 6 ⊢ (𝐵 ∈ ℚ → 𝐵 ∈ ℂ) | |
| 9 | 2, 8 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℂ) |
| 10 | qcn 9984 | . . . . . 6 ⊢ (𝐶 ∈ ℚ → 𝐶 ∈ ℂ) | |
| 11 | 3, 10 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| 12 | 9, 11 | addcomd 8440 | . . . 4 ⊢ (𝜑 → (𝐵 + 𝐶) = (𝐶 + 𝐵)) |
| 13 | 12 | oveq1d 6073 | . . 3 ⊢ (𝜑 → ((𝐵 + 𝐶) mod 𝐸) = ((𝐶 + 𝐵) mod 𝐸)) |
| 14 | modqadd12d.4 | . . . 4 ⊢ (𝜑 → 𝐷 ∈ ℚ) | |
| 15 | modqadd12d.7 | . . . 4 ⊢ (𝜑 → (𝐶 mod 𝐸) = (𝐷 mod 𝐸)) | |
| 16 | 3, 14, 2, 4, 5, 15 | modqadd1 10747 | . . 3 ⊢ (𝜑 → ((𝐶 + 𝐵) mod 𝐸) = ((𝐷 + 𝐵) mod 𝐸)) |
| 17 | qcn 9984 | . . . . . 6 ⊢ (𝐷 ∈ ℚ → 𝐷 ∈ ℂ) | |
| 18 | 14, 17 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝐷 ∈ ℂ) |
| 19 | 18, 9 | addcomd 8440 | . . . 4 ⊢ (𝜑 → (𝐷 + 𝐵) = (𝐵 + 𝐷)) |
| 20 | 19 | oveq1d 6073 | . . 3 ⊢ (𝜑 → ((𝐷 + 𝐵) mod 𝐸) = ((𝐵 + 𝐷) mod 𝐸)) |
| 21 | 13, 16, 20 | 3eqtrd 2271 | . 2 ⊢ (𝜑 → ((𝐵 + 𝐶) mod 𝐸) = ((𝐵 + 𝐷) mod 𝐸)) |
| 22 | 7, 21 | eqtrd 2267 | 1 ⊢ (𝜑 → ((𝐴 + 𝐶) mod 𝐸) = ((𝐵 + 𝐷) mod 𝐸)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2205 class class class wbr 4114 (class class class)co 6058 ℂcc 8141 0cc0 8143 + caddc 8146 < clt 8324 ℚcq 9969 mod cmo 10708 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4233 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-mulrcl 8242 ax-addcom 8243 ax-mulcom 8244 ax-addass 8245 ax-mulass 8246 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-1rid 8250 ax-0id 8251 ax-rnegex 8252 ax-precex 8253 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-apti 8258 ax-pre-ltadd 8259 ax-pre-mulgt0 8260 ax-pre-mulext 8261 ax-arch 8262 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-id 4419 df-po 4422 df-iso 4423 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8462 df-neg 8463 df-reap 8866 df-ap 8873 df-div 8964 df-inn 9255 df-n0 9514 df-z 9595 df-q 9970 df-rp 10005 df-fl 10654 df-mod 10709 |
| This theorem is referenced by: modqsub12d 10767 |
| Copyright terms: Public domain | W3C validator |