| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ringinvnzdiv | Structured version Visualization version GIF version | ||
| Description: In a unital ring, a left invertible element is not a zero divisor. (Contributed by FL, 18-Apr-2010.) (Revised by Jeff Madsen, 18-Apr-2010.) (Revised by AV, 24-Aug-2021.) |
| Ref | Expression |
|---|---|
| ringinvnzdiv.b | ⊢ 𝐵 = (Base‘𝑅) |
| ringinvnzdiv.t | ⊢ · = (.r‘𝑅) |
| ringinvnzdiv.u | ⊢ 1 = (1r‘𝑅) |
| ringinvnzdiv.z | ⊢ 0 = (0g‘𝑅) |
| ringinvnzdiv.r | ⊢ (𝜑 → 𝑅 ∈ Ring) |
| ringinvnzdiv.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| ringinvnzdiv.a | ⊢ (𝜑 → ∃𝑎 ∈ 𝐵 (𝑎 · 𝑋) = 1 ) |
| ringinvnzdiv.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| ringinvnzdiv | ⊢ (𝜑 → ((𝑋 · 𝑌) = 0 ↔ 𝑌 = 0 )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ringinvnzdiv.a | . . 3 ⊢ (𝜑 → ∃𝑎 ∈ 𝐵 (𝑎 · 𝑋) = 1 ) | |
| 2 | ringinvnzdiv.r | . . . . . . . . 9 ⊢ (𝜑 → 𝑅 ∈ Ring) | |
| 3 | ringinvnzdiv.y | . . . . . . . . 9 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 4 | ringinvnzdiv.b | . . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝑅) | |
| 5 | ringinvnzdiv.t | . . . . . . . . . 10 ⊢ · = (.r‘𝑅) | |
| 6 | ringinvnzdiv.u | . . . . . . . . . 10 ⊢ 1 = (1r‘𝑅) | |
| 7 | 4, 5, 6 | ringlidm 20204 | . . . . . . . . 9 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵) → ( 1 · 𝑌) = 𝑌) |
| 8 | 2, 3, 7 | syl2anc 584 | . . . . . . . 8 ⊢ (𝜑 → ( 1 · 𝑌) = 𝑌) |
| 9 | 8 | eqcomd 2742 | . . . . . . 7 ⊢ (𝜑 → 𝑌 = ( 1 · 𝑌)) |
| 10 | 9 | ad3antrrr 730 | . . . . . 6 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) ∧ (𝑋 · 𝑌) = 0 ) → 𝑌 = ( 1 · 𝑌)) |
| 11 | oveq1 7365 | . . . . . . . . . 10 ⊢ ( 1 = (𝑎 · 𝑋) → ( 1 · 𝑌) = ((𝑎 · 𝑋) · 𝑌)) | |
| 12 | 11 | eqcoms 2744 | . . . . . . . . 9 ⊢ ((𝑎 · 𝑋) = 1 → ( 1 · 𝑌) = ((𝑎 · 𝑋) · 𝑌)) |
| 13 | 12 | adantl 481 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) → ( 1 · 𝑌) = ((𝑎 · 𝑋) · 𝑌)) |
| 14 | 2 | adantr 480 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝑅 ∈ Ring) |
| 15 | simpr 484 | . . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝑎 ∈ 𝐵) | |
| 16 | ringinvnzdiv.x | . . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 17 | 16 | adantr 480 | . . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝑋 ∈ 𝐵) |
| 18 | 3 | adantr 480 | . . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝑌 ∈ 𝐵) |
| 19 | 15, 17, 18 | 3jca 1128 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝑎 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) |
| 20 | 14, 19 | jca 511 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝑅 ∈ Ring ∧ (𝑎 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵))) |
| 21 | 20 | adantr 480 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) → (𝑅 ∈ Ring ∧ (𝑎 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵))) |
| 22 | 4, 5 | ringass 20188 | . . . . . . . . 9 ⊢ ((𝑅 ∈ Ring ∧ (𝑎 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑎 · 𝑋) · 𝑌) = (𝑎 · (𝑋 · 𝑌))) |
| 23 | 21, 22 | syl 17 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) → ((𝑎 · 𝑋) · 𝑌) = (𝑎 · (𝑋 · 𝑌))) |
| 24 | 13, 23 | eqtrd 2771 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) → ( 1 · 𝑌) = (𝑎 · (𝑋 · 𝑌))) |
| 25 | 24 | adantr 480 | . . . . . 6 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) ∧ (𝑋 · 𝑌) = 0 ) → ( 1 · 𝑌) = (𝑎 · (𝑋 · 𝑌))) |
| 26 | oveq2 7366 | . . . . . . 7 ⊢ ((𝑋 · 𝑌) = 0 → (𝑎 · (𝑋 · 𝑌)) = (𝑎 · 0 )) | |
| 27 | ringinvnzdiv.z | . . . . . . . . . 10 ⊢ 0 = (0g‘𝑅) | |
| 28 | 4, 5, 27 | ringrz 20229 | . . . . . . . . 9 ⊢ ((𝑅 ∈ Ring ∧ 𝑎 ∈ 𝐵) → (𝑎 · 0 ) = 0 ) |
| 29 | 2, 28 | sylan 580 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝑎 · 0 ) = 0 ) |
| 30 | 29 | adantr 480 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) → (𝑎 · 0 ) = 0 ) |
| 31 | 26, 30 | sylan9eqr 2793 | . . . . . 6 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) ∧ (𝑋 · 𝑌) = 0 ) → (𝑎 · (𝑋 · 𝑌)) = 0 ) |
| 32 | 10, 25, 31 | 3eqtrd 2775 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) ∧ (𝑋 · 𝑌) = 0 ) → 𝑌 = 0 ) |
| 33 | 32 | exp31 419 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → ((𝑎 · 𝑋) = 1 → ((𝑋 · 𝑌) = 0 → 𝑌 = 0 ))) |
| 34 | 33 | rexlimdva 3137 | . . 3 ⊢ (𝜑 → (∃𝑎 ∈ 𝐵 (𝑎 · 𝑋) = 1 → ((𝑋 · 𝑌) = 0 → 𝑌 = 0 ))) |
| 35 | 1, 34 | mpd 15 | . 2 ⊢ (𝜑 → ((𝑋 · 𝑌) = 0 → 𝑌 = 0 )) |
| 36 | oveq2 7366 | . . . 4 ⊢ (𝑌 = 0 → (𝑋 · 𝑌) = (𝑋 · 0 )) | |
| 37 | 4, 5, 27 | ringrz 20229 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (𝑋 · 0 ) = 0 ) |
| 38 | 2, 16, 37 | syl2anc 584 | . . . 4 ⊢ (𝜑 → (𝑋 · 0 ) = 0 ) |
| 39 | 36, 38 | sylan9eqr 2793 | . . 3 ⊢ ((𝜑 ∧ 𝑌 = 0 ) → (𝑋 · 𝑌) = 0 ) |
| 40 | 39 | ex 412 | . 2 ⊢ (𝜑 → (𝑌 = 0 → (𝑋 · 𝑌) = 0 )) |
| 41 | 35, 40 | impbid 212 | 1 ⊢ (𝜑 → ((𝑋 · 𝑌) = 0 ↔ 𝑌 = 0 )) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ∃wrex 3060 ‘cfv 6492 (class class class)co 7358 Basecbs 17136 .rcmulr 17178 0gc0g 17359 1rcur 20116 Ringcrg 20168 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-2 12208 df-sets 17091 df-slot 17109 df-ndx 17121 df-base 17137 df-plusg 17190 df-0g 17361 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-grp 18866 df-minusg 18867 df-cmn 19711 df-abl 19712 df-mgp 20076 df-rng 20088 df-ur 20117 df-ring 20170 |
| This theorem is referenced by: ringunitnzdiv 20334 |
| Copyright terms: Public domain | W3C validator |