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 10286 | . 2 ⊢ (𝜑 → ((𝐴 + 𝐶) mod 𝐸) = ((𝐵 + 𝐶) mod 𝐸)) |
8 | qcn 9563 | . . . . . 6 ⊢ (𝐵 ∈ ℚ → 𝐵 ∈ ℂ) | |
9 | 2, 8 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℂ) |
10 | qcn 9563 | . . . . . 6 ⊢ (𝐶 ∈ ℚ → 𝐶 ∈ ℂ) | |
11 | 3, 10 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
12 | 9, 11 | addcomd 8040 | . . . 4 ⊢ (𝜑 → (𝐵 + 𝐶) = (𝐶 + 𝐵)) |
13 | 12 | oveq1d 5851 | . . 3 ⊢ (𝜑 → ((𝐵 + 𝐶) mod 𝐸) = ((𝐶 + 𝐵) mod 𝐸)) |
14 | modqadd12d.4 | . . . 4 ⊢ (𝜑 → 𝐷 ∈ ℚ) | |
15 | modqadd12d.7 | . . . 4 ⊢ (𝜑 → (𝐶 mod 𝐸) = (𝐷 mod 𝐸)) | |
16 | 3, 14, 2, 4, 5, 15 | modqadd1 10286 | . . 3 ⊢ (𝜑 → ((𝐶 + 𝐵) mod 𝐸) = ((𝐷 + 𝐵) mod 𝐸)) |
17 | qcn 9563 | . . . . . 6 ⊢ (𝐷 ∈ ℚ → 𝐷 ∈ ℂ) | |
18 | 14, 17 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝐷 ∈ ℂ) |
19 | 18, 9 | addcomd 8040 | . . . 4 ⊢ (𝜑 → (𝐷 + 𝐵) = (𝐵 + 𝐷)) |
20 | 19 | oveq1d 5851 | . . 3 ⊢ (𝜑 → ((𝐷 + 𝐵) mod 𝐸) = ((𝐵 + 𝐷) mod 𝐸)) |
21 | 13, 16, 20 | 3eqtrd 2201 | . 2 ⊢ (𝜑 → ((𝐵 + 𝐶) mod 𝐸) = ((𝐵 + 𝐷) mod 𝐸)) |
22 | 7, 21 | eqtrd 2197 | 1 ⊢ (𝜑 → ((𝐴 + 𝐶) mod 𝐸) = ((𝐵 + 𝐷) mod 𝐸)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1342 ∈ wcel 2135 class class class wbr 3976 (class class class)co 5836 ℂcc 7742 0cc0 7744 + caddc 7747 < clt 7924 ℚcq 9548 mod cmo 10247 |
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 604 ax-in2 605 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-13 2137 ax-14 2138 ax-ext 2146 ax-sep 4094 ax-pow 4147 ax-pr 4181 ax-un 4405 ax-setind 4508 ax-cnex 7835 ax-resscn 7836 ax-1cn 7837 ax-1re 7838 ax-icn 7839 ax-addcl 7840 ax-addrcl 7841 ax-mulcl 7842 ax-mulrcl 7843 ax-addcom 7844 ax-mulcom 7845 ax-addass 7846 ax-mulass 7847 ax-distr 7848 ax-i2m1 7849 ax-0lt1 7850 ax-1rid 7851 ax-0id 7852 ax-rnegex 7853 ax-precex 7854 ax-cnre 7855 ax-pre-ltirr 7856 ax-pre-ltwlin 7857 ax-pre-lttrn 7858 ax-pre-apti 7859 ax-pre-ltadd 7860 ax-pre-mulgt0 7861 ax-pre-mulext 7862 ax-arch 7863 |
This theorem depends on definitions: df-bi 116 df-3or 968 df-3an 969 df-tru 1345 df-fal 1348 df-nf 1448 df-sb 1750 df-eu 2016 df-mo 2017 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ne 2335 df-nel 2430 df-ral 2447 df-rex 2448 df-reu 2449 df-rmo 2450 df-rab 2451 df-v 2723 df-sbc 2947 df-csb 3041 df-dif 3113 df-un 3115 df-in 3117 df-ss 3124 df-pw 3555 df-sn 3576 df-pr 3577 df-op 3579 df-uni 3784 df-int 3819 df-iun 3862 df-br 3977 df-opab 4038 df-mpt 4039 df-id 4265 df-po 4268 df-iso 4269 df-xp 4604 df-rel 4605 df-cnv 4606 df-co 4607 df-dm 4608 df-rn 4609 df-res 4610 df-ima 4611 df-iota 5147 df-fun 5184 df-fn 5185 df-f 5186 df-fv 5190 df-riota 5792 df-ov 5839 df-oprab 5840 df-mpo 5841 df-1st 6100 df-2nd 6101 df-pnf 7926 df-mnf 7927 df-xr 7928 df-ltxr 7929 df-le 7930 df-sub 8062 df-neg 8063 df-reap 8464 df-ap 8471 df-div 8560 df-inn 8849 df-n0 9106 df-z 9183 df-q 9549 df-rp 9581 df-fl 10195 df-mod 10248 |
This theorem is referenced by: modqsub12d 10306 |
Copyright terms: Public domain | W3C validator |