| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > domnlcanb | Structured version Visualization version GIF version | ||
| Description: Left-cancellation law for domains, biconditional version of domnlcan 20804. (Contributed by Thierry Arnoux, 8-Jun-2025.) Shorten this theorem and domnlcan 20804 overall. (Revised by SN, 21-Jun-2025.) |
| Ref | Expression |
|---|---|
| domncan.b | ⊢ 𝐵 = (Base‘𝑅) |
| domncan.0 | ⊢ 0 = (0g‘𝑅) |
| domncan.m | ⊢ · = (.r‘𝑅) |
| domncan.x | ⊢ (𝜑 → 𝑋 ∈ (𝐵 ∖ { 0 })) |
| domncan.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| domncan.z | ⊢ (𝜑 → 𝑍 ∈ 𝐵) |
| domncan.r | ⊢ (𝜑 → 𝑅 ∈ Domn) |
| Ref | Expression |
|---|---|
| domnlcanb | ⊢ (𝜑 → ((𝑋 · 𝑌) = (𝑋 · 𝑍) ↔ 𝑌 = 𝑍)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq1 7418 | . . . . 5 ⊢ (𝑎 = 𝑋 → (𝑎 · 𝑏) = (𝑋 · 𝑏)) | |
| 2 | oveq1 7418 | . . . . 5 ⊢ (𝑎 = 𝑋 → (𝑎 · 𝑐) = (𝑋 · 𝑐)) | |
| 3 | 1, 2 | eqeq12d 2785 | . . . 4 ⊢ (𝑎 = 𝑋 → ((𝑎 · 𝑏) = (𝑎 · 𝑐) ↔ (𝑋 · 𝑏) = (𝑋 · 𝑐))) |
| 4 | 3 | imbi1d 344 | . . 3 ⊢ (𝑎 = 𝑋 → (((𝑎 · 𝑏) = (𝑎 · 𝑐) → 𝑏 = 𝑐) ↔ ((𝑋 · 𝑏) = (𝑋 · 𝑐) → 𝑏 = 𝑐))) |
| 5 | oveq2 7419 | . . . . 5 ⊢ (𝑏 = 𝑌 → (𝑋 · 𝑏) = (𝑋 · 𝑌)) | |
| 6 | 5 | eqeq1d 2771 | . . . 4 ⊢ (𝑏 = 𝑌 → ((𝑋 · 𝑏) = (𝑋 · 𝑐) ↔ (𝑋 · 𝑌) = (𝑋 · 𝑐))) |
| 7 | eqeq1 2773 | . . . 4 ⊢ (𝑏 = 𝑌 → (𝑏 = 𝑐 ↔ 𝑌 = 𝑐)) | |
| 8 | 6, 7 | imbi12d 347 | . . 3 ⊢ (𝑏 = 𝑌 → (((𝑋 · 𝑏) = (𝑋 · 𝑐) → 𝑏 = 𝑐) ↔ ((𝑋 · 𝑌) = (𝑋 · 𝑐) → 𝑌 = 𝑐))) |
| 9 | oveq2 7419 | . . . . 5 ⊢ (𝑐 = 𝑍 → (𝑋 · 𝑐) = (𝑋 · 𝑍)) | |
| 10 | 9 | eqeq2d 2780 | . . . 4 ⊢ (𝑐 = 𝑍 → ((𝑋 · 𝑌) = (𝑋 · 𝑐) ↔ (𝑋 · 𝑌) = (𝑋 · 𝑍))) |
| 11 | eqeq2 2781 | . . . 4 ⊢ (𝑐 = 𝑍 → (𝑌 = 𝑐 ↔ 𝑌 = 𝑍)) | |
| 12 | 10, 11 | imbi12d 347 | . . 3 ⊢ (𝑐 = 𝑍 → (((𝑋 · 𝑌) = (𝑋 · 𝑐) → 𝑌 = 𝑐) ↔ ((𝑋 · 𝑌) = (𝑋 · 𝑍) → 𝑌 = 𝑍))) |
| 13 | domncan.r | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ Domn) | |
| 14 | domncan.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
| 15 | domncan.0 | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
| 16 | domncan.m | . . . . . 6 ⊢ · = (.r‘𝑅) | |
| 17 | 14, 15, 16 | isdomn4 20799 | . . . . 5 ⊢ (𝑅 ∈ Domn ↔ (𝑅 ∈ NzRing ∧ ∀𝑎 ∈ (𝐵 ∖ { 0 })∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ((𝑎 · 𝑏) = (𝑎 · 𝑐) → 𝑏 = 𝑐))) |
| 18 | 13, 17 | sylib 221 | . . . 4 ⊢ (𝜑 → (𝑅 ∈ NzRing ∧ ∀𝑎 ∈ (𝐵 ∖ { 0 })∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ((𝑎 · 𝑏) = (𝑎 · 𝑐) → 𝑏 = 𝑐))) |
| 19 | 18 | simprd 500 | . . 3 ⊢ (𝜑 → ∀𝑎 ∈ (𝐵 ∖ { 0 })∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ((𝑎 · 𝑏) = (𝑎 · 𝑐) → 𝑏 = 𝑐)) |
| 20 | domncan.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ (𝐵 ∖ { 0 })) | |
| 21 | domncan.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 22 | domncan.z | . . 3 ⊢ (𝜑 → 𝑍 ∈ 𝐵) | |
| 23 | 4, 8, 12, 19, 20, 21, 22 | rspc3dv 3609 | . 2 ⊢ (𝜑 → ((𝑋 · 𝑌) = (𝑋 · 𝑍) → 𝑌 = 𝑍)) |
| 24 | oveq2 7419 | . 2 ⊢ (𝑌 = 𝑍 → (𝑋 · 𝑌) = (𝑋 · 𝑍)) | |
| 25 | 23, 24 | impbid1 228 | 1 ⊢ (𝜑 → ((𝑋 · 𝑌) = (𝑋 · 𝑍) ↔ 𝑌 = 𝑍)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∀wral 3085 ∖ cdif 3910 {csn 4594 ‘cfv 6537 (class class class)co 7411 Basecbs 17268 .rcmulr 17310 0gc0g 17491 NzRingcnzr 20594 Domncdomn 20776 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-er 8693 df-en 8943 df-dom 8944 df-sdom 8945 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-nn 12233 df-2 12302 df-sets 17223 df-slot 17241 df-ndx 17253 df-base 17269 df-plusg 17322 df-0g 17493 df-mgm 18697 df-sgrp 18776 df-mnd 18792 df-grp 19002 df-minusg 19003 df-sbg 19004 df-cmn 19851 df-abl 19852 df-mgp 20216 df-rng 20230 df-ur 20263 df-ring 20316 df-nzr 20595 df-domn 20779 |
| This theorem is referenced by: domnlcan 20804 ply1dg1rt 33814 |
| Copyright terms: Public domain | W3C validator |