| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isdomn2 | Structured version Visualization version GIF version | ||
| Description: A ring is a domain iff all nonzero elements are regular elements. (Contributed by Mario Carneiro, 28-Mar-2015.) (Proof shortened by SN, 21-Jun-2025.) |
| Ref | Expression |
|---|---|
| isdomn2.b | ⊢ 𝐵 = (Base‘𝑅) |
| isdomn2.t | ⊢ 𝐸 = (RLReg‘𝑅) |
| isdomn2.z | ⊢ 0 = (0g‘𝑅) |
| Ref | Expression |
|---|---|
| isdomn2 | ⊢ (𝑅 ∈ Domn ↔ (𝑅 ∈ NzRing ∧ (𝐵 ∖ { 0 }) ⊆ 𝐸)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isdomn2.b | . . 3 ⊢ 𝐵 = (Base‘𝑅) | |
| 2 | eqid 2761 | . . 3 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 3 | isdomn2.z | . . 3 ⊢ 0 = (0g‘𝑅) | |
| 4 | 1, 2, 3 | isdomn 20937 | . 2 ⊢ (𝑅 ∈ Domn ↔ (𝑅 ∈ NzRing ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 )))) |
| 5 | eldifi 4078 | . . . . . 6 ⊢ (𝑥 ∈ (𝐵 ∖ { 0 }) → 𝑥 ∈ 𝐵) | |
| 6 | isdomn2.t | . . . . . . . 8 ⊢ 𝐸 = (RLReg‘𝑅) | |
| 7 | 6, 1, 2, 3 | isrrg 20930 | . . . . . . 7 ⊢ (𝑥 ∈ 𝐸 ↔ (𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦) = 0 → 𝑦 = 0 ))) |
| 8 | 7 | baib 545 | . . . . . 6 ⊢ (𝑥 ∈ 𝐵 → (𝑥 ∈ 𝐸 ↔ ∀𝑦 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦) = 0 → 𝑦 = 0 ))) |
| 9 | 5, 8 | syl 18 | . . . . 5 ⊢ (𝑥 ∈ (𝐵 ∖ { 0 }) → (𝑥 ∈ 𝐸 ↔ ∀𝑦 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦) = 0 → 𝑦 = 0 ))) |
| 10 | 9 | ralbiia 3107 | . . . 4 ⊢ (∀𝑥 ∈ (𝐵 ∖ { 0 })𝑥 ∈ 𝐸 ↔ ∀𝑥 ∈ (𝐵 ∖ { 0 })∀𝑦 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦) = 0 → 𝑦 = 0 )) |
| 11 | dfss3 3920 | . . . 4 ⊢ ((𝐵 ∖ { 0 }) ⊆ 𝐸 ↔ ∀𝑥 ∈ (𝐵 ∖ { 0 })𝑥 ∈ 𝐸) | |
| 12 | isdomn5 20942 | . . . 4 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 )) ↔ ∀𝑥 ∈ (𝐵 ∖ { 0 })∀𝑦 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦) = 0 → 𝑦 = 0 )) | |
| 13 | 10, 11, 12 | 3bitr4ri 307 | . . 3 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 )) ↔ (𝐵 ∖ { 0 }) ⊆ 𝐸) |
| 14 | 13 | anbi2i 635 | . 2 ⊢ ((𝑅 ∈ NzRing ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 ))) ↔ (𝑅 ∈ NzRing ∧ (𝐵 ∖ { 0 }) ⊆ 𝐸)) |
| 15 | 4, 14 | bitri 278 | 1 ⊢ (𝑅 ∈ Domn ↔ (𝑅 ∈ NzRing ∧ (𝐵 ∖ { 0 }) ⊆ 𝐸)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2145 ∀wral 3077 ∖ cdif 3896 ⊆ wss 3899 {csn 4584 ‘cfv 6531 (class class class)co 7412 Basecbs 17367 .rcmulr 17409 0gc0g 17590 NzRingcnzr 20742 RLRegcrlreg 20923 Domncdomn 20924 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-iota 6487 df-fun 6533 df-fv 6539 df-ov 7415 df-rlreg 20926 df-domn 20927 |
| This theorem is used by: domnrrg 20944 isdomn6 20945 drngdomn 20983 zringidom 34065 |
| Copyright terms: Public domain | W3C validator |