MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  isdomn2 Structured version   Visualization version   GIF version

Theorem isdomn2 20996
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.)
Hypotheses
Ref Expression
isdomn2.b 𝐵 = (Base‘𝑅)
isdomn2.t 𝐸 = (RLReg‘𝑅)
isdomn2.z 0 = (0g‘𝑅)
Assertion
Ref Expression
isdomn2 (𝑅 ∈ Domn ↔ (𝑅 ∈ NzRing ∧ (𝐵 ∖ { 0 }) ⊆ 𝐸))

Proof of Theorem isdomn2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isdomn2.b . . 3 𝐵 = (Base‘𝑅)
2 eqid 2763 . . 3 (.r‘𝑅) = (.r‘𝑅)
3 isdomn2.z . . 3 0 = (0g‘𝑅)
41, 2, 3isdomn 20990 . 2 (𝑅 ∈ Domn ↔ (𝑅 ∈ NzRing ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 ))))
5 eldifi 4070 . . . . . 6 (𝑥 ∈ (𝐵 ∖ { 0 }) → 𝑥 ∈ 𝐵)
6 isdomn2.t . . . . . . . 8 𝐸 = (RLReg‘𝑅)
76, 1, 2, 3isrrg 20983 . . . . . . 7 (𝑥 ∈ 𝐸 ↔ (𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦) = 0 → 𝑦 = 0 )))
87baib 545 . . . . . 6 (𝑥 ∈ 𝐵 → (𝑥 ∈ 𝐸 ↔ ∀𝑦 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦) = 0 → 𝑦 = 0 )))
95, 8syl 18 . . . . 5 (𝑥 ∈ (𝐵 ∖ { 0 }) → (𝑥 ∈ 𝐸 ↔ ∀𝑦 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦) = 0 → 𝑦 = 0 )))
109ralbiia 3110 . . . 4 (∀𝑥 ∈ (𝐵 ∖ { 0 })𝑥 ∈ 𝐸 ↔ ∀𝑥 ∈ (𝐵 ∖ { 0 })∀𝑦 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦) = 0 → 𝑦 = 0 ))
11 dfss3 3902 . . . 4 ((𝐵 ∖ { 0 }) ⊆ 𝐸 ↔ ∀𝑥 ∈ (𝐵 ∖ { 0 })𝑥 ∈ 𝐸)
12 isdomn5 20995 . . . 4 (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 )) ↔ ∀𝑥 ∈ (𝐵 ∖ { 0 })∀𝑦 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦) = 0 → 𝑦 = 0 ))
1310, 11, 123bitr4ri 307 . . 3 (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 )) ↔ (𝐵 ∖ { 0 }) ⊆ 𝐸)
1413anbi2i 635 . 2 ((𝑅 ∈ NzRing ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 ))) ↔ (𝑅 ∈ NzRing ∧ (𝐵 ∖ { 0 }) ⊆ 𝐸))
154, 14bitri 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 2147  ∀wral 3080   ⊆ wss 3900   ∖ cdif 4048  {csn 4588  ‘cfv 6561  (class class class)co 7446  Basecbs 17419  .rcmulr 17461  0gc0g 17642  NzRingcnzr 20795  RLRegcrlreg 20976  Domncdomn 20977
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pr 5396
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-iota 6515  df-fun 6563  df-fv 6569  df-ov 7449  df-rlreg 20979  df-domn 20980
This theorem is used by:  domnrrg  20997  isdomn6  20998  drngdomn  21036  zringidom  33938
  Copyright terms: Public domain W3C validator