Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  isdmn3 Structured version   Visualization version   GIF version

Theorem isdmn3 38325
Description: The predicate "is a domain", alternate expression. (Contributed by Jeff Madsen, 19-Jun-2010.)
Hypotheses
Ref Expression
isdmn3.1 𝐺 = (1st𝑅)
isdmn3.2 𝐻 = (2nd𝑅)
isdmn3.3 𝑋 = ran 𝐺
isdmn3.4 𝑍 = (GId‘𝐺)
isdmn3.5 𝑈 = (GId‘𝐻)
Assertion
Ref Expression
isdmn3 (𝑅 ∈ Dmn ↔ (𝑅 ∈ CRingOps ∧ 𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍))))
Distinct variable groups:   𝑅,𝑎,𝑏   𝑍,𝑎,𝑏   𝐻,𝑎,𝑏   𝑋,𝑎,𝑏
Allowed substitution hints:   𝑈(𝑎,𝑏)   𝐺(𝑎,𝑏)

Proof of Theorem isdmn3
StepHypRef Expression
1 isdmn2 38306 . 2 (𝑅 ∈ Dmn ↔ (𝑅 ∈ PrRing ∧ 𝑅 ∈ CRingOps))
2 isdmn3.1 . . . . . 6 𝐺 = (1st𝑅)
3 isdmn3.4 . . . . . 6 𝑍 = (GId‘𝐺)
42, 3isprrngo 38301 . . . . 5 (𝑅 ∈ PrRing ↔ (𝑅 ∈ RingOps ∧ {𝑍} ∈ (PrIdl‘𝑅)))
5 isdmn3.2 . . . . . . 7 𝐻 = (2nd𝑅)
6 isdmn3.3 . . . . . . 7 𝑋 = ran 𝐺
72, 5, 6ispridlc 38321 . . . . . 6 (𝑅 ∈ CRingOps → ({𝑍} ∈ (PrIdl‘𝑅) ↔ ({𝑍} ∈ (Idl‘𝑅) ∧ {𝑍} ≠ 𝑋 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍})))))
8 crngorngo 38251 . . . . . . 7 (𝑅 ∈ CRingOps → 𝑅 ∈ RingOps)
98biantrurd 532 . . . . . 6 (𝑅 ∈ CRingOps → ({𝑍} ∈ (PrIdl‘𝑅) ↔ (𝑅 ∈ RingOps ∧ {𝑍} ∈ (PrIdl‘𝑅))))
10 3anass 1095 . . . . . . 7 (({𝑍} ∈ (Idl‘𝑅) ∧ {𝑍} ≠ 𝑋 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍}))) ↔ ({𝑍} ∈ (Idl‘𝑅) ∧ ({𝑍} ≠ 𝑋 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍})))))
112, 30idl 38276 . . . . . . . . . 10 (𝑅 ∈ RingOps → {𝑍} ∈ (Idl‘𝑅))
128, 11syl 17 . . . . . . . . 9 (𝑅 ∈ CRingOps → {𝑍} ∈ (Idl‘𝑅))
1312biantrurd 532 . . . . . . . 8 (𝑅 ∈ CRingOps → (({𝑍} ≠ 𝑋 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍}))) ↔ ({𝑍} ∈ (Idl‘𝑅) ∧ ({𝑍} ≠ 𝑋 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍}))))))
142rneqi 5894 . . . . . . . . . . . . . . 15 ran 𝐺 = ran (1st𝑅)
156, 14eqtri 2760 . . . . . . . . . . . . . 14 𝑋 = ran (1st𝑅)
16 isdmn3.5 . . . . . . . . . . . . . 14 𝑈 = (GId‘𝐻)
1715, 5, 16rngo1cl 38190 . . . . . . . . . . . . 13 (𝑅 ∈ RingOps → 𝑈𝑋)
18 eleq2 2826 . . . . . . . . . . . . . 14 ({𝑍} = 𝑋 → (𝑈 ∈ {𝑍} ↔ 𝑈𝑋))
19 elsni 4599 . . . . . . . . . . . . . 14 (𝑈 ∈ {𝑍} → 𝑈 = 𝑍)
2018, 19biimtrrdi 254 . . . . . . . . . . . . 13 ({𝑍} = 𝑋 → (𝑈𝑋𝑈 = 𝑍))
2117, 20syl5com 31 . . . . . . . . . . . 12 (𝑅 ∈ RingOps → ({𝑍} = 𝑋𝑈 = 𝑍))
222, 5, 3, 16, 6rngoueqz 38191 . . . . . . . . . . . . 13 (𝑅 ∈ RingOps → (𝑋 ≈ 1o𝑈 = 𝑍))
232, 6, 3rngo0cl 38170 . . . . . . . . . . . . . 14 (𝑅 ∈ RingOps → 𝑍𝑋)
24 en1eqsn 9187 . . . . . . . . . . . . . . . 16 ((𝑍𝑋𝑋 ≈ 1o) → 𝑋 = {𝑍})
2524eqcomd 2743 . . . . . . . . . . . . . . 15 ((𝑍𝑋𝑋 ≈ 1o) → {𝑍} = 𝑋)
2625ex 412 . . . . . . . . . . . . . 14 (𝑍𝑋 → (𝑋 ≈ 1o → {𝑍} = 𝑋))
2723, 26syl 17 . . . . . . . . . . . . 13 (𝑅 ∈ RingOps → (𝑋 ≈ 1o → {𝑍} = 𝑋))
2822, 27sylbird 260 . . . . . . . . . . . 12 (𝑅 ∈ RingOps → (𝑈 = 𝑍 → {𝑍} = 𝑋))
2921, 28impbid 212 . . . . . . . . . . 11 (𝑅 ∈ RingOps → ({𝑍} = 𝑋𝑈 = 𝑍))
308, 29syl 17 . . . . . . . . . 10 (𝑅 ∈ CRingOps → ({𝑍} = 𝑋𝑈 = 𝑍))
3130necon3bid 2977 . . . . . . . . 9 (𝑅 ∈ CRingOps → ({𝑍} ≠ 𝑋𝑈𝑍))
32 ovex 7401 . . . . . . . . . . . . 13 (𝑎𝐻𝑏) ∈ V
3332elsn 4597 . . . . . . . . . . . 12 ((𝑎𝐻𝑏) ∈ {𝑍} ↔ (𝑎𝐻𝑏) = 𝑍)
34 velsn 4598 . . . . . . . . . . . . 13 (𝑎 ∈ {𝑍} ↔ 𝑎 = 𝑍)
35 velsn 4598 . . . . . . . . . . . . 13 (𝑏 ∈ {𝑍} ↔ 𝑏 = 𝑍)
3634, 35orbi12i 915 . . . . . . . . . . . 12 ((𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍}) ↔ (𝑎 = 𝑍𝑏 = 𝑍))
3733, 36imbi12i 350 . . . . . . . . . . 11 (((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍})) ↔ ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍)))
3837a1i 11 . . . . . . . . . 10 (𝑅 ∈ CRingOps → (((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍})) ↔ ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍))))
39382ralbidv 3202 . . . . . . . . 9 (𝑅 ∈ CRingOps → (∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍})) ↔ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍))))
4031, 39anbi12d 633 . . . . . . . 8 (𝑅 ∈ CRingOps → (({𝑍} ≠ 𝑋 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍}))) ↔ (𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍)))))
4113, 40bitr3d 281 . . . . . . 7 (𝑅 ∈ CRingOps → (({𝑍} ∈ (Idl‘𝑅) ∧ ({𝑍} ≠ 𝑋 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍})))) ↔ (𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍)))))
4210, 41bitrid 283 . . . . . 6 (𝑅 ∈ CRingOps → (({𝑍} ∈ (Idl‘𝑅) ∧ {𝑍} ≠ 𝑋 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍}))) ↔ (𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍)))))
437, 9, 423bitr3d 309 . . . . 5 (𝑅 ∈ CRingOps → ((𝑅 ∈ RingOps ∧ {𝑍} ∈ (PrIdl‘𝑅)) ↔ (𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍)))))
444, 43bitrid 283 . . . 4 (𝑅 ∈ CRingOps → (𝑅 ∈ PrRing ↔ (𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍)))))
4544pm5.32i 574 . . 3 ((𝑅 ∈ CRingOps ∧ 𝑅 ∈ PrRing) ↔ (𝑅 ∈ CRingOps ∧ (𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍)))))
46 ancom 460 . . 3 ((𝑅 ∈ PrRing ∧ 𝑅 ∈ CRingOps) ↔ (𝑅 ∈ CRingOps ∧ 𝑅 ∈ PrRing))
47 3anass 1095 . . 3 ((𝑅 ∈ CRingOps ∧ 𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍))) ↔ (𝑅 ∈ CRingOps ∧ (𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍)))))
4845, 46, 473bitr4i 303 . 2 ((𝑅 ∈ PrRing ∧ 𝑅 ∈ CRingOps) ↔ (𝑅 ∈ CRingOps ∧ 𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍))))
491, 48bitri 275 1 (𝑅 ∈ Dmn ↔ (𝑅 ∈ CRingOps ∧ 𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wo 848  w3a 1087   = wceq 1542  wcel 2114  wne 2933  wral 3052  {csn 4582   class class class wbr 5100  ran crn 5633  cfv 6500  (class class class)co 7368  1st c1st 7941  2nd c2nd 7942  1oc1o 8400  cen 8892  GIdcgi 30578  RingOpscrngo 38145  CRingOpsccring 38244  Idlcidl 38258  PrIdlcpridl 38259  PrRingcprrng 38297  Dmncdmn 38298
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1st 7943  df-2nd 7944  df-1o 8407  df-en 8896  df-grpo 30581  df-gid 30582  df-ginv 30583  df-ablo 30633  df-ass 38094  df-exid 38096  df-mgmOLD 38100  df-sgrOLD 38112  df-mndo 38118  df-rngo 38146  df-com2 38241  df-crngo 38245  df-idl 38261  df-pridl 38262  df-prrngo 38299  df-dmn 38300  df-igen 38311
This theorem is referenced by:  dmnnzd  38326
  Copyright terms: Public domain W3C validator