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

Theorem isdomn2OLD 20741
Description: Obsolete version of isdomn2 20740 as of 21-Jun-2025. (Contributed by Mario Carneiro, 28-Mar-2015.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
isdomn2.b 𝐵 = (Base‘𝑅)
isdomn2.t 𝐸 = (RLReg‘𝑅)
isdomn2.z 0 = (0g𝑅)
Assertion
Ref Expression
isdomn2OLD (𝑅 ∈ Domn ↔ (𝑅 ∈ NzRing ∧ (𝐵 ∖ { 0 }) ⊆ 𝐸))

Proof of Theorem isdomn2OLD
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isdomn2.b . . 3 𝐵 = (Base‘𝑅)
2 eqid 2761 . . 3 (.r𝑅) = (.r𝑅)
3 isdomn2.z . . 3 0 = (0g𝑅)
41, 2, 3isdomn 20734 . 2 (𝑅 ∈ Domn ↔ (𝑅 ∈ NzRing ∧ ∀𝑥𝐵𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0 → (𝑥 = 0𝑦 = 0 ))))
5 dfss3 3925 . . . 4 ((𝐵 ∖ { 0 }) ⊆ 𝐸 ↔ ∀𝑥 ∈ (𝐵 ∖ { 0 })𝑥𝐸)
6 isdomn2.t . . . . . . . . 9 𝐸 = (RLReg‘𝑅)
76, 1, 2, 3isrrg 20727 . . . . . . . 8 (𝑥𝐸 ↔ (𝑥𝐵 ∧ ∀𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )))
87baib 543 . . . . . . 7 (𝑥𝐵 → (𝑥𝐸 ↔ ∀𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )))
98imbi2d 342 . . . . . 6 (𝑥𝐵 → ((𝑥0𝑥𝐸) ↔ (𝑥0 → ∀𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 ))))
109ralbiia 3105 . . . . 5 (∀𝑥𝐵 (𝑥0𝑥𝐸) ↔ ∀𝑥𝐵 (𝑥0 → ∀𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )))
11 eldifsn 4745 . . . . . . . 8 (𝑥 ∈ (𝐵 ∖ { 0 }) ↔ (𝑥𝐵𝑥0 ))
1211imbi1i 351 . . . . . . 7 ((𝑥 ∈ (𝐵 ∖ { 0 }) → 𝑥𝐸) ↔ ((𝑥𝐵𝑥0 ) → 𝑥𝐸))
13 impexp 454 . . . . . . 7 (((𝑥𝐵𝑥0 ) → 𝑥𝐸) ↔ (𝑥𝐵 → (𝑥0𝑥𝐸)))
1412, 13bitri 277 . . . . . 6 ((𝑥 ∈ (𝐵 ∖ { 0 }) → 𝑥𝐸) ↔ (𝑥𝐵 → (𝑥0𝑥𝐸)))
1514ralbii2 3103 . . . . 5 (∀𝑥 ∈ (𝐵 ∖ { 0 })𝑥𝐸 ↔ ∀𝑥𝐵 (𝑥0𝑥𝐸))
16 con34b 318 . . . . . . . . 9 (((𝑥(.r𝑅)𝑦) = 0 → (𝑥 = 0𝑦 = 0 )) ↔ (¬ (𝑥 = 0𝑦 = 0 ) → ¬ (𝑥(.r𝑅)𝑦) = 0 ))
17 impexp 454 . . . . . . . . . 10 (((¬ 𝑥 = 0 ∧ ¬ 𝑦 = 0 ) → ¬ (𝑥(.r𝑅)𝑦) = 0 ) ↔ (¬ 𝑥 = 0 → (¬ 𝑦 = 0 → ¬ (𝑥(.r𝑅)𝑦) = 0 )))
18 ioran 996 . . . . . . . . . . 11 (¬ (𝑥 = 0𝑦 = 0 ) ↔ (¬ 𝑥 = 0 ∧ ¬ 𝑦 = 0 ))
1918imbi1i 351 . . . . . . . . . 10 ((¬ (𝑥 = 0𝑦 = 0 ) → ¬ (𝑥(.r𝑅)𝑦) = 0 ) ↔ ((¬ 𝑥 = 0 ∧ ¬ 𝑦 = 0 ) → ¬ (𝑥(.r𝑅)𝑦) = 0 ))
20 df-ne 2957 . . . . . . . . . . 11 (𝑥0 ↔ ¬ 𝑥 = 0 )
21 con34b 318 . . . . . . . . . . 11 (((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 ) ↔ (¬ 𝑦 = 0 → ¬ (𝑥(.r𝑅)𝑦) = 0 ))
2220, 21imbi12i 352 . . . . . . . . . 10 ((𝑥0 → ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )) ↔ (¬ 𝑥 = 0 → (¬ 𝑦 = 0 → ¬ (𝑥(.r𝑅)𝑦) = 0 )))
2317, 19, 223bitr4i 305 . . . . . . . . 9 ((¬ (𝑥 = 0𝑦 = 0 ) → ¬ (𝑥(.r𝑅)𝑦) = 0 ) ↔ (𝑥0 → ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )))
2416, 23bitri 277 . . . . . . . 8 (((𝑥(.r𝑅)𝑦) = 0 → (𝑥 = 0𝑦 = 0 )) ↔ (𝑥0 → ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )))
2524ralbii 3107 . . . . . . 7 (∀𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0 → (𝑥 = 0𝑦 = 0 )) ↔ ∀𝑦𝐵 (𝑥0 → ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )))
26 r19.21v 3186 . . . . . . 7 (∀𝑦𝐵 (𝑥0 → ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )) ↔ (𝑥0 → ∀𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )))
2725, 26bitri 277 . . . . . 6 (∀𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0 → (𝑥 = 0𝑦 = 0 )) ↔ (𝑥0 → ∀𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )))
2827ralbii 3107 . . . . 5 (∀𝑥𝐵𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0 → (𝑥 = 0𝑦 = 0 )) ↔ ∀𝑥𝐵 (𝑥0 → ∀𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )))
2910, 15, 283bitr4i 305 . . . 4 (∀𝑥 ∈ (𝐵 ∖ { 0 })𝑥𝐸 ↔ ∀𝑥𝐵𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0 → (𝑥 = 0𝑦 = 0 )))
305, 29bitr2i 278 . . 3 (∀𝑥𝐵𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0 → (𝑥 = 0𝑦 = 0 )) ↔ (𝐵 ∖ { 0 }) ⊆ 𝐸)
3130anbi2i 632 . 2 ((𝑅 ∈ NzRing ∧ ∀𝑥𝐵𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0 → (𝑥 = 0𝑦 = 0 ))) ↔ (𝑅 ∈ NzRing ∧ (𝐵 ∖ { 0 }) ⊆ 𝐸))
324, 31bitri 277 1 (𝑅 ∈ Domn ↔ (𝑅 ∈ NzRing ∧ (𝐵 ∖ { 0 }) ⊆ 𝐸))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 399  wo 858   = wceq 1559  wcel 2141  wne 2956  wral 3075  cdif 3901  wss 3904  {csn 4581  cfv 6517  (class class class)co 7392  Basecbs 17228  .rcmulr 17270  0gc0g 17451  NzRingcnzr 20541  RLRegcrlreg 20720  Domncdomn 20721
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-nul 5255  ax-pr 5389
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-sbc 3745  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-iota 6473  df-fun 6519  df-fv 6525  df-ov 7395  df-rlreg 20723  df-domn 20724
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator