| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > modqsub12d | GIF version | ||
| Description: Subtraction 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 |
|---|---|
| modqsub12d | ⊢ (𝜑 → ((𝐴 − 𝐶) mod 𝐸) = ((𝐵 − 𝐷) mod 𝐸)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | modqadd12d.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℚ) | |
| 2 | modqadd12d.2 | . . 3 ⊢ (𝜑 → 𝐵 ∈ ℚ) | |
| 3 | modqadd12d.3 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℚ) | |
| 4 | qnegcl 9764 | . . . 4 ⊢ (𝐶 ∈ ℚ → -𝐶 ∈ ℚ) | |
| 5 | 3, 4 | syl 14 | . . 3 ⊢ (𝜑 → -𝐶 ∈ ℚ) |
| 6 | modqadd12d.4 | . . . 4 ⊢ (𝜑 → 𝐷 ∈ ℚ) | |
| 7 | qnegcl 9764 | . . . 4 ⊢ (𝐷 ∈ ℚ → -𝐷 ∈ ℚ) | |
| 8 | 6, 7 | syl 14 | . . 3 ⊢ (𝜑 → -𝐷 ∈ ℚ) |
| 9 | modqadd12d.5 | . . 3 ⊢ (𝜑 → 𝐸 ∈ ℚ) | |
| 10 | modqadd12d.egt0 | . . 3 ⊢ (𝜑 → 0 < 𝐸) | |
| 11 | modqadd12d.6 | . . 3 ⊢ (𝜑 → (𝐴 mod 𝐸) = (𝐵 mod 𝐸)) | |
| 12 | modqadd12d.7 | . . . 4 ⊢ (𝜑 → (𝐶 mod 𝐸) = (𝐷 mod 𝐸)) | |
| 13 | 3, 6, 9, 10, 12 | modqnegd 10531 | . . 3 ⊢ (𝜑 → (-𝐶 mod 𝐸) = (-𝐷 mod 𝐸)) |
| 14 | 1, 2, 5, 8, 9, 10, 11, 13 | modqadd12d 10532 | . 2 ⊢ (𝜑 → ((𝐴 + -𝐶) mod 𝐸) = ((𝐵 + -𝐷) mod 𝐸)) |
| 15 | qcn 9762 | . . . . 5 ⊢ (𝐴 ∈ ℚ → 𝐴 ∈ ℂ) | |
| 16 | 1, 15 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| 17 | qcn 9762 | . . . . 5 ⊢ (𝐶 ∈ ℚ → 𝐶 ∈ ℂ) | |
| 18 | 3, 17 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| 19 | 16, 18 | negsubd 8396 | . . 3 ⊢ (𝜑 → (𝐴 + -𝐶) = (𝐴 − 𝐶)) |
| 20 | 19 | oveq1d 5966 | . 2 ⊢ (𝜑 → ((𝐴 + -𝐶) mod 𝐸) = ((𝐴 − 𝐶) mod 𝐸)) |
| 21 | qcn 9762 | . . . . 5 ⊢ (𝐵 ∈ ℚ → 𝐵 ∈ ℂ) | |
| 22 | 2, 21 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℂ) |
| 23 | qcn 9762 | . . . . 5 ⊢ (𝐷 ∈ ℚ → 𝐷 ∈ ℂ) | |
| 24 | 6, 23 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐷 ∈ ℂ) |
| 25 | 22, 24 | negsubd 8396 | . . 3 ⊢ (𝜑 → (𝐵 + -𝐷) = (𝐵 − 𝐷)) |
| 26 | 25 | oveq1d 5966 | . 2 ⊢ (𝜑 → ((𝐵 + -𝐷) mod 𝐸) = ((𝐵 − 𝐷) mod 𝐸)) |
| 27 | 14, 20, 26 | 3eqtr3d 2247 | 1 ⊢ (𝜑 → ((𝐴 − 𝐶) mod 𝐸) = ((𝐵 − 𝐷) mod 𝐸)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1373 ∈ wcel 2177 class class class wbr 4047 (class class class)co 5951 ℂcc 7930 0cc0 7932 + caddc 7935 < clt 8114 − cmin 8250 -cneg 8251 ℚcq 9747 mod cmo 10474 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-sep 4166 ax-pow 4222 ax-pr 4257 ax-un 4484 ax-setind 4589 ax-cnex 8023 ax-resscn 8024 ax-1cn 8025 ax-1re 8026 ax-icn 8027 ax-addcl 8028 ax-addrcl 8029 ax-mulcl 8030 ax-mulrcl 8031 ax-addcom 8032 ax-mulcom 8033 ax-addass 8034 ax-mulass 8035 ax-distr 8036 ax-i2m1 8037 ax-0lt1 8038 ax-1rid 8039 ax-0id 8040 ax-rnegex 8041 ax-precex 8042 ax-cnre 8043 ax-pre-ltirr 8044 ax-pre-ltwlin 8045 ax-pre-lttrn 8046 ax-pre-apti 8047 ax-pre-ltadd 8048 ax-pre-mulgt0 8049 ax-pre-mulext 8050 ax-arch 8051 |
| This theorem depends on definitions: df-bi 117 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-nel 2473 df-ral 2490 df-rex 2491 df-reu 2492 df-rmo 2493 df-rab 2494 df-v 2775 df-sbc 3000 df-csb 3095 df-dif 3169 df-un 3171 df-in 3173 df-ss 3180 df-pw 3619 df-sn 3640 df-pr 3641 df-op 3643 df-uni 3853 df-int 3888 df-iun 3931 df-br 4048 df-opab 4110 df-mpt 4111 df-id 4344 df-po 4347 df-iso 4348 df-xp 4685 df-rel 4686 df-cnv 4687 df-co 4688 df-dm 4689 df-rn 4690 df-res 4691 df-ima 4692 df-iota 5237 df-fun 5278 df-fn 5279 df-f 5280 df-fv 5284 df-riota 5906 df-ov 5954 df-oprab 5955 df-mpo 5956 df-1st 6233 df-2nd 6234 df-pnf 8116 df-mnf 8117 df-xr 8118 df-ltxr 8119 df-le 8120 df-sub 8252 df-neg 8253 df-reap 8655 df-ap 8662 df-div 8753 df-inn 9044 df-n0 9303 df-z 9380 df-q 9748 df-rp 9783 df-fl 10420 df-mod 10475 |
| This theorem is referenced by: modqsubmod 10534 modqsubmodmod 10535 |
| Copyright terms: Public domain | W3C validator |