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

Theorem isdomn2OLD 20734
Description: Obsolete version of isdomn2 20733 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 2740 . . 3 (.r𝑅) = (.r𝑅)
3 isdomn2.z . . 3 0 = (0g𝑅)
41, 2, 3isdomn 20727 . 2 (𝑅 ∈ Domn ↔ (𝑅 ∈ NzRing ∧ ∀𝑥𝐵𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0 → (𝑥 = 0𝑦 = 0 ))))
5 dfss3 3997 . . . 4 ((𝐵 ∖ { 0 }) ⊆ 𝐸 ↔ ∀𝑥 ∈ (𝐵 ∖ { 0 })𝑥𝐸)
6 isdomn2.t . . . . . . . . 9 𝐸 = (RLReg‘𝑅)
76, 1, 2, 3isrrg 20720 . . . . . . . 8 (𝑥𝐸 ↔ (𝑥𝐵 ∧ ∀𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )))
87baib 535 . . . . . . 7 (𝑥𝐵 → (𝑥𝐸 ↔ ∀𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )))
98imbi2d 340 . . . . . 6 (𝑥𝐵 → ((𝑥0𝑥𝐸) ↔ (𝑥0 → ∀𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 ))))
109ralbiia 3097 . . . . 5 (∀𝑥𝐵 (𝑥0𝑥𝐸) ↔ ∀𝑥𝐵 (𝑥0 → ∀𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )))
11 eldifsn 4811 . . . . . . . 8 (𝑥 ∈ (𝐵 ∖ { 0 }) ↔ (𝑥𝐵𝑥0 ))
1211imbi1i 349 . . . . . . 7 ((𝑥 ∈ (𝐵 ∖ { 0 }) → 𝑥𝐸) ↔ ((𝑥𝐵𝑥0 ) → 𝑥𝐸))
13 impexp 450 . . . . . . 7 (((𝑥𝐵𝑥0 ) → 𝑥𝐸) ↔ (𝑥𝐵 → (𝑥0𝑥𝐸)))
1412, 13bitri 275 . . . . . 6 ((𝑥 ∈ (𝐵 ∖ { 0 }) → 𝑥𝐸) ↔ (𝑥𝐵 → (𝑥0𝑥𝐸)))
1514ralbii2 3095 . . . . 5 (∀𝑥 ∈ (𝐵 ∖ { 0 })𝑥𝐸 ↔ ∀𝑥𝐵 (𝑥0𝑥𝐸))
16 con34b 316 . . . . . . . . 9 (((𝑥(.r𝑅)𝑦) = 0 → (𝑥 = 0𝑦 = 0 )) ↔ (¬ (𝑥 = 0𝑦 = 0 ) → ¬ (𝑥(.r𝑅)𝑦) = 0 ))
17 impexp 450 . . . . . . . . . 10 (((¬ 𝑥 = 0 ∧ ¬ 𝑦 = 0 ) → ¬ (𝑥(.r𝑅)𝑦) = 0 ) ↔ (¬ 𝑥 = 0 → (¬ 𝑦 = 0 → ¬ (𝑥(.r𝑅)𝑦) = 0 )))
18 ioran 984 . . . . . . . . . . 11 (¬ (𝑥 = 0𝑦 = 0 ) ↔ (¬ 𝑥 = 0 ∧ ¬ 𝑦 = 0 ))
1918imbi1i 349 . . . . . . . . . 10 ((¬ (𝑥 = 0𝑦 = 0 ) → ¬ (𝑥(.r𝑅)𝑦) = 0 ) ↔ ((¬ 𝑥 = 0 ∧ ¬ 𝑦 = 0 ) → ¬ (𝑥(.r𝑅)𝑦) = 0 ))
20 df-ne 2947 . . . . . . . . . . 11 (𝑥0 ↔ ¬ 𝑥 = 0 )
21 con34b 316 . . . . . . . . . . 11 (((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 ) ↔ (¬ 𝑦 = 0 → ¬ (𝑥(.r𝑅)𝑦) = 0 ))
2220, 21imbi12i 350 . . . . . . . . . 10 ((𝑥0 → ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )) ↔ (¬ 𝑥 = 0 → (¬ 𝑦 = 0 → ¬ (𝑥(.r𝑅)𝑦) = 0 )))
2317, 19, 223bitr4i 303 . . . . . . . . 9 ((¬ (𝑥 = 0𝑦 = 0 ) → ¬ (𝑥(.r𝑅)𝑦) = 0 ) ↔ (𝑥0 → ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )))
2416, 23bitri 275 . . . . . . . 8 (((𝑥(.r𝑅)𝑦) = 0 → (𝑥 = 0𝑦 = 0 )) ↔ (𝑥0 → ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )))
2524ralbii 3099 . . . . . . 7 (∀𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0 → (𝑥 = 0𝑦 = 0 )) ↔ ∀𝑦𝐵 (𝑥0 → ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )))
26 r19.21v 3186 . . . . . . 7 (∀𝑦𝐵 (𝑥0 → ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )) ↔ (𝑥0 → ∀𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )))
2725, 26bitri 275 . . . . . 6 (∀𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0 → (𝑥 = 0𝑦 = 0 )) ↔ (𝑥0 → ∀𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )))
2827ralbii 3099 . . . . 5 (∀𝑥𝐵𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0 → (𝑥 = 0𝑦 = 0 )) ↔ ∀𝑥𝐵 (𝑥0 → ∀𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0𝑦 = 0 )))
2910, 15, 283bitr4i 303 . . . 4 (∀𝑥 ∈ (𝐵 ∖ { 0 })𝑥𝐸 ↔ ∀𝑥𝐵𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0 → (𝑥 = 0𝑦 = 0 )))
305, 29bitr2i 276 . . 3 (∀𝑥𝐵𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0 → (𝑥 = 0𝑦 = 0 )) ↔ (𝐵 ∖ { 0 }) ⊆ 𝐸)
3130anbi2i 622 . 2 ((𝑅 ∈ NzRing ∧ ∀𝑥𝐵𝑦𝐵 ((𝑥(.r𝑅)𝑦) = 0 → (𝑥 = 0𝑦 = 0 ))) ↔ (𝑅 ∈ NzRing ∧ (𝐵 ∖ { 0 }) ⊆ 𝐸))
324, 31bitri 275 1 (𝑅 ∈ Domn ↔ (𝑅 ∈ NzRing ∧ (𝐵 ∖ { 0 }) ⊆ 𝐸))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wo 846   = wceq 1537  wcel 2108  wne 2946  wral 3067  cdif 3973  wss 3976  {csn 4648  cfv 6573  (class class class)co 7448  Basecbs 17258  .rcmulr 17312  0gc0g 17499  NzRingcnzr 20538  RLRegcrlreg 20713  Domncdomn 20714
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-iota 6525  df-fun 6575  df-fv 6581  df-ov 7451  df-rlreg 20716  df-domn 20717
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator