| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > domnrcanb | Structured version Visualization version GIF version | ||
| Description: Right-cancellation law for domains, biconditional version of domnrcan 20660. (Contributed by SN, 21-Jun-2025.) |
| Ref | Expression |
|---|---|
| domnrcan.b | ⊢ 𝐵 = (Base‘𝑅) |
| domnrcan.0 | ⊢ 0 = (0g‘𝑅) |
| domnrcan.m | ⊢ · = (.r‘𝑅) |
| domnrcan.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| domnrcan.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| domnrcan.z | ⊢ (𝜑 → 𝑍 ∈ (𝐵 ∖ { 0 })) |
| domnrcan.r | ⊢ (𝜑 → 𝑅 ∈ Domn) |
| Ref | Expression |
|---|---|
| domnrcanb | ⊢ (𝜑 → ((𝑋 · 𝑍) = (𝑌 · 𝑍) ↔ 𝑋 = 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq1 7367 | . . . . 5 ⊢ (𝑎 = 𝑋 → (𝑎 · 𝑐) = (𝑋 · 𝑐)) | |
| 2 | 1 | eqeq1d 2739 | . . . 4 ⊢ (𝑎 = 𝑋 → ((𝑎 · 𝑐) = (𝑏 · 𝑐) ↔ (𝑋 · 𝑐) = (𝑏 · 𝑐))) |
| 3 | eqeq1 2741 | . . . 4 ⊢ (𝑎 = 𝑋 → (𝑎 = 𝑏 ↔ 𝑋 = 𝑏)) | |
| 4 | 2, 3 | imbi12d 344 | . . 3 ⊢ (𝑎 = 𝑋 → (((𝑎 · 𝑐) = (𝑏 · 𝑐) → 𝑎 = 𝑏) ↔ ((𝑋 · 𝑐) = (𝑏 · 𝑐) → 𝑋 = 𝑏))) |
| 5 | oveq1 7367 | . . . . 5 ⊢ (𝑏 = 𝑌 → (𝑏 · 𝑐) = (𝑌 · 𝑐)) | |
| 6 | 5 | eqeq2d 2748 | . . . 4 ⊢ (𝑏 = 𝑌 → ((𝑋 · 𝑐) = (𝑏 · 𝑐) ↔ (𝑋 · 𝑐) = (𝑌 · 𝑐))) |
| 7 | eqeq2 2749 | . . . 4 ⊢ (𝑏 = 𝑌 → (𝑋 = 𝑏 ↔ 𝑋 = 𝑌)) | |
| 8 | 6, 7 | imbi12d 344 | . . 3 ⊢ (𝑏 = 𝑌 → (((𝑋 · 𝑐) = (𝑏 · 𝑐) → 𝑋 = 𝑏) ↔ ((𝑋 · 𝑐) = (𝑌 · 𝑐) → 𝑋 = 𝑌))) |
| 9 | oveq2 7368 | . . . . 5 ⊢ (𝑐 = 𝑍 → (𝑋 · 𝑐) = (𝑋 · 𝑍)) | |
| 10 | oveq2 7368 | . . . . 5 ⊢ (𝑐 = 𝑍 → (𝑌 · 𝑐) = (𝑌 · 𝑍)) | |
| 11 | 9, 10 | eqeq12d 2753 | . . . 4 ⊢ (𝑐 = 𝑍 → ((𝑋 · 𝑐) = (𝑌 · 𝑐) ↔ (𝑋 · 𝑍) = (𝑌 · 𝑍))) |
| 12 | 11 | imbi1d 341 | . . 3 ⊢ (𝑐 = 𝑍 → (((𝑋 · 𝑐) = (𝑌 · 𝑐) → 𝑋 = 𝑌) ↔ ((𝑋 · 𝑍) = (𝑌 · 𝑍) → 𝑋 = 𝑌))) |
| 13 | domnrcan.r | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ Domn) | |
| 14 | domnrcan.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
| 15 | domnrcan.0 | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
| 16 | domnrcan.m | . . . . . 6 ⊢ · = (.r‘𝑅) | |
| 17 | 14, 15, 16 | isdomn4r 20656 | . . . . 5 ⊢ (𝑅 ∈ Domn ↔ (𝑅 ∈ NzRing ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ (𝐵 ∖ { 0 })((𝑎 · 𝑐) = (𝑏 · 𝑐) → 𝑎 = 𝑏))) |
| 18 | 13, 17 | sylib 218 | . . . 4 ⊢ (𝜑 → (𝑅 ∈ NzRing ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ (𝐵 ∖ { 0 })((𝑎 · 𝑐) = (𝑏 · 𝑐) → 𝑎 = 𝑏))) |
| 19 | 18 | simprd 495 | . . 3 ⊢ (𝜑 → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ (𝐵 ∖ { 0 })((𝑎 · 𝑐) = (𝑏 · 𝑐) → 𝑎 = 𝑏)) |
| 20 | domnrcan.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 21 | domnrcan.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 22 | domnrcan.z | . . 3 ⊢ (𝜑 → 𝑍 ∈ (𝐵 ∖ { 0 })) | |
| 23 | 4, 8, 12, 19, 20, 21, 22 | rspc3dv 3596 | . 2 ⊢ (𝜑 → ((𝑋 · 𝑍) = (𝑌 · 𝑍) → 𝑋 = 𝑌)) |
| 24 | oveq1 7367 | . 2 ⊢ (𝑋 = 𝑌 → (𝑋 · 𝑍) = (𝑌 · 𝑍)) | |
| 25 | 23, 24 | impbid1 225 | 1 ⊢ (𝜑 → ((𝑋 · 𝑍) = (𝑌 · 𝑍) ↔ 𝑋 = 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ∖ cdif 3899 {csn 4581 ‘cfv 6493 (class class class)co 7360 Basecbs 17140 .rcmulr 17182 0gc0g 17363 NzRingcnzr 20449 Domncdomn 20629 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-tpos 8170 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12150 df-2 12212 df-3 12213 df-sets 17095 df-slot 17113 df-ndx 17125 df-base 17141 df-plusg 17194 df-mulr 17195 df-0g 17365 df-mgm 18569 df-sgrp 18648 df-mnd 18664 df-grp 18870 df-minusg 18871 df-sbg 18872 df-cmn 19715 df-abl 19716 df-mgp 20080 df-rng 20092 df-ur 20121 df-ring 20174 df-oppr 20277 df-nzr 20450 df-domn 20632 |
| This theorem is referenced by: domnrcan 20660 domneq0r 20661 |
| Copyright terms: Public domain | W3C validator |