| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > divalglemqt | GIF version | ||
| Description: Lemma for divalg 12691. The 𝑄 = 𝑇 case involved in showing uniqueness. (Contributed by Jim Kingdon, 5-Dec-2021.) |
| Ref | Expression |
|---|---|
| divalglemqt.d | ⊢ (𝜑 → 𝐷 ∈ ℤ) |
| divalglemqt.r | ⊢ (𝜑 → 𝑅 ∈ ℤ) |
| divalglemqt.s | ⊢ (𝜑 → 𝑆 ∈ ℤ) |
| divalglemqt.q | ⊢ (𝜑 → 𝑄 ∈ ℤ) |
| divalglemqt.t | ⊢ (𝜑 → 𝑇 ∈ ℤ) |
| divalglemqt.qt | ⊢ (𝜑 → 𝑄 = 𝑇) |
| divalglemqt.eq | ⊢ (𝜑 → ((𝑄 · 𝐷) + 𝑅) = ((𝑇 · 𝐷) + 𝑆)) |
| Ref | Expression |
|---|---|
| divalglemqt | ⊢ (𝜑 → 𝑅 = 𝑆) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | divalglemqt.qt | . . . 4 ⊢ (𝜑 → 𝑄 = 𝑇) | |
| 2 | 1 | oveq1d 6100 | . . 3 ⊢ (𝜑 → (𝑄 · 𝐷) = (𝑇 · 𝐷)) |
| 3 | divalglemqt.q | . . . . 5 ⊢ (𝜑 → 𝑄 ∈ ℤ) | |
| 4 | divalglemqt.d | . . . . 5 ⊢ (𝜑 → 𝐷 ∈ ℤ) | |
| 5 | 3, 4 | zmulcld 9774 | . . . 4 ⊢ (𝜑 → (𝑄 · 𝐷) ∈ ℤ) |
| 6 | 5 | zcnd 9769 | . . 3 ⊢ (𝜑 → (𝑄 · 𝐷) ∈ ℂ) |
| 7 | 2, 6 | eqeltrrd 2316 | . 2 ⊢ (𝜑 → (𝑇 · 𝐷) ∈ ℂ) |
| 8 | divalglemqt.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ ℤ) | |
| 9 | 8 | zcnd 9769 | . 2 ⊢ (𝜑 → 𝑅 ∈ ℂ) |
| 10 | divalglemqt.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ ℤ) | |
| 11 | 10 | zcnd 9769 | . 2 ⊢ (𝜑 → 𝑆 ∈ ℂ) |
| 12 | 2 | oveq1d 6100 | . . 3 ⊢ (𝜑 → ((𝑄 · 𝐷) + 𝑅) = ((𝑇 · 𝐷) + 𝑅)) |
| 13 | divalglemqt.eq | . . 3 ⊢ (𝜑 → ((𝑄 · 𝐷) + 𝑅) = ((𝑇 · 𝐷) + 𝑆)) | |
| 14 | 12, 13 | eqtr3d 2273 | . 2 ⊢ (𝜑 → ((𝑇 · 𝐷) + 𝑅) = ((𝑇 · 𝐷) + 𝑆)) |
| 15 | 7, 9, 11, 14 | addcanad 8512 | 1 ⊢ (𝜑 → 𝑅 = 𝑆) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 ∈ wcel 2209 (class class class)co 6085 ℂcc 8177 + caddc 8182 · cmul 8184 ℤcz 9644 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-mulrcl 8278 ax-addcom 8279 ax-mulcom 8280 ax-addass 8281 ax-mulass 8282 ax-distr 8283 ax-i2m1 8284 ax-1rid 8286 ax-0id 8287 ax-rnegex 8288 ax-cnre 8290 |
| This proof depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-br 4131 df-opab 4193 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-iota 5337 df-fun 5379 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-sub 8499 df-neg 8500 df-inn 9305 df-n0 9564 df-z 9645 |
| This theorem is used by: divalglemeunn 12688 divalglemeuneg 12690 |
| Copyright terms: Public domain | W3C validator |