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 33873
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 33854 . 2 (𝑅 ∈ Dmn ↔ (𝑅 ∈ PrRing ∧ 𝑅 ∈ CRingOps))
2 isdmn3.1 . . . . . 6 𝐺 = (1st𝑅)
3 isdmn3.4 . . . . . 6 𝑍 = (GId‘𝐺)
42, 3isprrngo 33849 . . . . 5 (𝑅 ∈ PrRing ↔ (𝑅 ∈ RingOps ∧ {𝑍} ∈ (PrIdl‘𝑅)))
5 isdmn3.2 . . . . . . 7 𝐻 = (2nd𝑅)
6 isdmn3.3 . . . . . . 7 𝑋 = ran 𝐺
72, 5, 6ispridlc 33869 . . . . . 6 (𝑅 ∈ CRingOps → ({𝑍} ∈ (PrIdl‘𝑅) ↔ ({𝑍} ∈ (Idl‘𝑅) ∧ {𝑍} ≠ 𝑋 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍})))))
8 crngorngo 33799 . . . . . . 7 (𝑅 ∈ CRingOps → 𝑅 ∈ RingOps)
98biantrurd 529 . . . . . 6 (𝑅 ∈ CRingOps → ({𝑍} ∈ (PrIdl‘𝑅) ↔ (𝑅 ∈ RingOps ∧ {𝑍} ∈ (PrIdl‘𝑅))))
10 3anass 1042 . . . . . . 7 (({𝑍} ∈ (Idl‘𝑅) ∧ {𝑍} ≠ 𝑋 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍}))) ↔ ({𝑍} ∈ (Idl‘𝑅) ∧ ({𝑍} ≠ 𝑋 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍})))))
112, 30idl 33824 . . . . . . . . . 10 (𝑅 ∈ RingOps → {𝑍} ∈ (Idl‘𝑅))
128, 11syl 17 . . . . . . . . 9 (𝑅 ∈ CRingOps → {𝑍} ∈ (Idl‘𝑅))
1312biantrurd 529 . . . . . . . 8 (𝑅 ∈ CRingOps → (({𝑍} ≠ 𝑋 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍}))) ↔ ({𝑍} ∈ (Idl‘𝑅) ∧ ({𝑍} ≠ 𝑋 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍}))))))
142rneqi 5352 . . . . . . . . . . . . . . 15 ran 𝐺 = ran (1st𝑅)
156, 14eqtri 2644 . . . . . . . . . . . . . 14 𝑋 = ran (1st𝑅)
16 isdmn3.5 . . . . . . . . . . . . . 14 𝑈 = (GId‘𝐻)
1715, 5, 16rngo1cl 33738 . . . . . . . . . . . . 13 (𝑅 ∈ RingOps → 𝑈𝑋)
18 eleq2 2690 . . . . . . . . . . . . . 14 ({𝑍} = 𝑋 → (𝑈 ∈ {𝑍} ↔ 𝑈𝑋))
19 elsni 4194 . . . . . . . . . . . . . 14 (𝑈 ∈ {𝑍} → 𝑈 = 𝑍)
2018, 19syl6bir 244 . . . . . . . . . . . . 13 ({𝑍} = 𝑋 → (𝑈𝑋𝑈 = 𝑍))
2117, 20syl5com 31 . . . . . . . . . . . 12 (𝑅 ∈ RingOps → ({𝑍} = 𝑋𝑈 = 𝑍))
222, 5, 3, 16, 6rngoueqz 33739 . . . . . . . . . . . . 13 (𝑅 ∈ RingOps → (𝑋 ≈ 1𝑜𝑈 = 𝑍))
232, 6, 3rngo0cl 33718 . . . . . . . . . . . . . 14 (𝑅 ∈ RingOps → 𝑍𝑋)
24 en1eqsn 8190 . . . . . . . . . . . . . . . 16 ((𝑍𝑋𝑋 ≈ 1𝑜) → 𝑋 = {𝑍})
2524eqcomd 2628 . . . . . . . . . . . . . . 15 ((𝑍𝑋𝑋 ≈ 1𝑜) → {𝑍} = 𝑋)
2625ex 450 . . . . . . . . . . . . . 14 (𝑍𝑋 → (𝑋 ≈ 1𝑜 → {𝑍} = 𝑋))
2723, 26syl 17 . . . . . . . . . . . . 13 (𝑅 ∈ RingOps → (𝑋 ≈ 1𝑜 → {𝑍} = 𝑋))
2822, 27sylbird 250 . . . . . . . . . . . 12 (𝑅 ∈ RingOps → (𝑈 = 𝑍 → {𝑍} = 𝑋))
2921, 28impbid 202 . . . . . . . . . . 11 (𝑅 ∈ RingOps → ({𝑍} = 𝑋𝑈 = 𝑍))
308, 29syl 17 . . . . . . . . . 10 (𝑅 ∈ CRingOps → ({𝑍} = 𝑋𝑈 = 𝑍))
3130necon3bid 2838 . . . . . . . . 9 (𝑅 ∈ CRingOps → ({𝑍} ≠ 𝑋𝑈𝑍))
32 ovex 6678 . . . . . . . . . . . . 13 (𝑎𝐻𝑏) ∈ V
3332elsn 4192 . . . . . . . . . . . 12 ((𝑎𝐻𝑏) ∈ {𝑍} ↔ (𝑎𝐻𝑏) = 𝑍)
34 velsn 4193 . . . . . . . . . . . . 13 (𝑎 ∈ {𝑍} ↔ 𝑎 = 𝑍)
35 velsn 4193 . . . . . . . . . . . . 13 (𝑏 ∈ {𝑍} ↔ 𝑏 = 𝑍)
3634, 35orbi12i 543 . . . . . . . . . . . 12 ((𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍}) ↔ (𝑎 = 𝑍𝑏 = 𝑍))
3733, 36imbi12i 340 . . . . . . . . . . 11 (((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍})) ↔ ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍)))
3837a1i 11 . . . . . . . . . 10 (𝑅 ∈ CRingOps → (((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍})) ↔ ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍))))
39382ralbidv 2989 . . . . . . . . 9 (𝑅 ∈ CRingOps → (∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍})) ↔ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍))))
4031, 39anbi12d 747 . . . . . . . 8 (𝑅 ∈ CRingOps → (({𝑍} ≠ 𝑋 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍}))) ↔ (𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍)))))
4113, 40bitr3d 270 . . . . . . 7 (𝑅 ∈ CRingOps → (({𝑍} ∈ (Idl‘𝑅) ∧ ({𝑍} ≠ 𝑋 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍})))) ↔ (𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍)))))
4210, 41syl5bb 272 . . . . . 6 (𝑅 ∈ CRingOps → (({𝑍} ∈ (Idl‘𝑅) ∧ {𝑍} ≠ 𝑋 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍}))) ↔ (𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍)))))
437, 9, 423bitr3d 298 . . . . 5 (𝑅 ∈ CRingOps → ((𝑅 ∈ RingOps ∧ {𝑍} ∈ (PrIdl‘𝑅)) ↔ (𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍)))))
444, 43syl5bb 272 . . . 4 (𝑅 ∈ CRingOps → (𝑅 ∈ PrRing ↔ (𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍)))))
4544pm5.32i 669 . . 3 ((𝑅 ∈ CRingOps ∧ 𝑅 ∈ PrRing) ↔ (𝑅 ∈ CRingOps ∧ (𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍)))))
46 ancom 466 . . 3 ((𝑅 ∈ PrRing ∧ 𝑅 ∈ CRingOps) ↔ (𝑅 ∈ CRingOps ∧ 𝑅 ∈ PrRing))
47 3anass 1042 . . 3 ((𝑅 ∈ CRingOps ∧ 𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍))) ↔ (𝑅 ∈ CRingOps ∧ (𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍)))))
4845, 46, 473bitr4i 292 . 2 ((𝑅 ∈ PrRing ∧ 𝑅 ∈ CRingOps) ↔ (𝑅 ∈ CRingOps ∧ 𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍))))
491, 48bitri 264 1 (𝑅 ∈ Dmn ↔ (𝑅 ∈ CRingOps ∧ 𝑈𝑍 ∧ ∀𝑎𝑋𝑏𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍𝑏 = 𝑍))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wo 383  wa 384  w3a 1037   = wceq 1483  wcel 1990  wne 2794  wral 2912  {csn 4177   class class class wbr 4653  ran crn 5115  cfv 5888  (class class class)co 6650  1st c1st 7166  2nd c2nd 7167  1𝑜c1o 7553  cen 7952  GIdcgi 27344  RingOpscrngo 33693  CRingOpsccring 33792  Idlcidl 33806  PrIdlcpridl 33807  PrRingcprrng 33845  Dmncdmn 33846
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-1st 7168  df-2nd 7169  df-1o 7560  df-er 7742  df-en 7956  df-dom 7957  df-sdom 7958  df-fin 7959  df-grpo 27347  df-gid 27348  df-ginv 27349  df-ablo 27399  df-ass 33642  df-exid 33644  df-mgmOLD 33648  df-sgrOLD 33660  df-mndo 33666  df-rngo 33694  df-com2 33789  df-crngo 33793  df-idl 33809  df-pridl 33810  df-prrngo 33847  df-dmn 33848  df-igen 33859
This theorem is referenced by:  dmnnzd  33874
  Copyright terms: Public domain W3C validator