| 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 20551 | . . . . . . . . 9 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵) → ( 1 · 𝑌) = 𝑌) |
| 8 | 2, 3, 7 | syl2anc 596 | . . . . . . . 8 ⊢ (𝜑 → ( 1 · 𝑌) = 𝑌) |
| 9 | 8 | eqcomd 2772 | . . . . . . 7 ⊢ (𝜑 → 𝑌 = ( 1 · 𝑌)) |
| 10 | 9 | ad3antrrr 743 | . . . . . 6 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) ∧ (𝑋 · 𝑌) = 0 ) → 𝑌 = ( 1 · 𝑌)) |
| 11 | oveq1 7457 | . . . . . . . . . 10 ⊢ ( 1 = (𝑎 · 𝑋) → ( 1 · 𝑌) = ((𝑎 · 𝑋) · 𝑌)) | |
| 12 | 11 | eqcoms 2774 | . . . . . . . . 9 ⊢ ((𝑎 · 𝑋) = 1 → ( 1 · 𝑌) = ((𝑎 · 𝑋) · 𝑌)) |
| 13 | 12 | adantl 487 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) → ( 1 · 𝑌) = ((𝑎 · 𝑋) · 𝑌)) |
| 14 | 2 | adantr 486 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝑅 ∈ Ring) |
| 15 | simpr 490 | . . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝑎 ∈ 𝐵) | |
| 16 | ringinvnzdiv.x | . . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 17 | 16 | adantr 486 | . . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝑋 ∈ 𝐵) |
| 18 | 3 | adantr 486 | . . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝑌 ∈ 𝐵) |
| 19 | 15, 17, 18 | 3jca 1147 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝑎 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) |
| 20 | 14, 19 | jca 521 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝑅 ∈ Ring ∧ (𝑎 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵))) |
| 21 | 20 | adantr 486 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) → (𝑅 ∈ Ring ∧ (𝑎 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵))) |
| 22 | 4, 5 | ringass 20533 | . . . . . . . . 9 ⊢ ((𝑅 ∈ Ring ∧ (𝑎 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑎 · 𝑋) · 𝑌) = (𝑎 · (𝑋 · 𝑌))) |
| 23 | 21, 22 | syl 18 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) → ((𝑎 · 𝑋) · 𝑌) = (𝑎 · (𝑋 · 𝑌))) |
| 24 | 13, 23 | eqtrd 2801 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) → ( 1 · 𝑌) = (𝑎 · (𝑋 · 𝑌))) |
| 25 | 24 | adantr 486 | . . . . . 6 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) ∧ (𝑋 · 𝑌) = 0 ) → ( 1 · 𝑌) = (𝑎 · (𝑋 · 𝑌))) |
| 26 | oveq2 7458 | . . . . . . 7 ⊢ ((𝑋 · 𝑌) = 0 → (𝑎 · (𝑋 · 𝑌)) = (𝑎 · 0 )) | |
| 27 | ringinvnzdiv.z | . . . . . . . . . 10 ⊢ 0 = (0g‘𝑅) | |
| 28 | 4, 5, 27 | ringrz 20578 | . . . . . . . . 9 ⊢ ((𝑅 ∈ Ring ∧ 𝑎 ∈ 𝐵) → (𝑎 · 0 ) = 0 ) |
| 29 | 2, 28 | sylan 592 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝑎 · 0 ) = 0 ) |
| 30 | 29 | adantr 486 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) → (𝑎 · 0 ) = 0 ) |
| 31 | 26, 30 | sylan9eqr 2823 | . . . . . 6 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) ∧ (𝑋 · 𝑌) = 0 ) → (𝑎 · (𝑋 · 𝑌)) = 0 ) |
| 32 | 10, 25, 31 | 3eqtrd 2805 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) ∧ (𝑋 · 𝑌) = 0 ) → 𝑌 = 0 ) |
| 33 | 32 | exp31 425 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → ((𝑎 · 𝑋) = 1 → ((𝑋 · 𝑌) = 0 → 𝑌 = 0 ))) |
| 34 | 33 | rexlimdva 3170 | . . 3 ⊢ (𝜑 → (∃𝑎 ∈ 𝐵 (𝑎 · 𝑋) = 1 → ((𝑋 · 𝑌) = 0 → 𝑌 = 0 ))) |
| 35 | 1, 34 | mpd 16 | . 2 ⊢ (𝜑 → ((𝑋 · 𝑌) = 0 → 𝑌 = 0 )) |
| 36 | oveq2 7458 | . . . 4 ⊢ (𝑌 = 0 → (𝑋 · 𝑌) = (𝑋 · 0 )) | |
| 37 | 4, 5, 27 | ringrz 20578 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (𝑋 · 0 ) = 0 ) |
| 38 | 2, 16, 37 | syl2anc 596 | . . . 4 ⊢ (𝜑 → (𝑋 · 0 ) = 0 ) |
| 39 | 36, 38 | sylan9eqr 2823 | . . 3 ⊢ ((𝜑 ∧ 𝑌 = 0 ) → (𝑋 · 𝑌) = 0 ) |
| 40 | 39 | ex 418 | . 2 ⊢ (𝜑 → (𝑌 = 0 → (𝑋 · 𝑌) = 0 )) |
| 41 | 35, 40 | impbid 215 | 1 ⊢ (𝜑 → ((𝑋 · 𝑌) = 0 ↔ 𝑌 = 0 )) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1104 = wceq 1572 ∈ wcel 2150 ∃wrex 3093 ‘cfv 6565 (class class class)co 7450 Basecbs 17433 .rcmulr 17475 0gc0g 17662 1rcur 20460 Ringcrg 20512 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-er 8754 df-en 9011 df-dom 9012 df-sdom 9013 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-nn 12375 df-2 12444 df-sets 17388 df-slot 17406 df-ndx 17418 df-base 17434 df-plusg 17488 df-0g 17664 df-mgm 18868 df-sgrp 18960 df-mnd 18976 df-grp 19199 df-minusg 19200 df-cmn 20049 df-abl 20050 df-mgp 20414 df-rng 20428 df-ur 20461 df-ring 20514 |
| This theorem is used by: ringunitnzdiv 20681 isdrng3lem2 21059 |
| Copyright terms: Public domain | W3C validator |