Theorem isdmn3 38081

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

Step	Hyp	Ref	Expression
1		isdmn2 38062	. 2 ⊢ (𝑅 ∈ Dmn ↔ (𝑅 ∈ PrRing ∧ 𝑅 ∈ CRingOps))
2		isdmn3.1	. . . . . 6 ⊢ 𝐺 = (1st ‘𝑅)
3		isdmn3.4	. . . . . 6 ⊢ 𝑍 = (GId‘𝐺)
4	2, 3	isprrngo 38057	. . . . 5 ⊢ (𝑅 ∈ PrRing ↔ (𝑅 ∈ RingOps ∧ {𝑍} ∈ (PrIdl‘𝑅)))
5		isdmn3.2	. . . . . . 7 ⊢ 𝐻 = (2nd ‘𝑅)
6		isdmn3.3	. . . . . . 7 ⊢ 𝑋 = ran 𝐺
7	2, 5, 6	ispridlc 38077	. . . . . 6 ⊢ (𝑅 ∈ CRingOps → ({𝑍} ∈ (PrIdl‘𝑅) ↔ ({𝑍} ∈ (Idl‘𝑅) ∧ {𝑍} ≠ 𝑋 ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍})))))
8		crngorngo 38007	. . . . . . 7 ⊢ (𝑅 ∈ CRingOps → 𝑅 ∈ RingOps)
9	8	biantrurd 532	. . . . . 6 ⊢ (𝑅 ∈ CRingOps → ({𝑍} ∈ (PrIdl‘𝑅) ↔ (𝑅 ∈ RingOps ∧ {𝑍} ∈ (PrIdl‘𝑅))))
10		3anass 1095	. . . . . . 7 ⊢ (({𝑍} ∈ (Idl‘𝑅) ∧ {𝑍} ≠ 𝑋 ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍}))) ↔ ({𝑍} ∈ (Idl‘𝑅) ∧ ({𝑍} ≠ 𝑋 ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍})))))
11	2, 3	0idl 38032	. . . . . . . . . 10 ⊢ (𝑅 ∈ RingOps → {𝑍} ∈ (Idl‘𝑅))
12	8, 11	syl 17	. . . . . . . . 9 ⊢ (𝑅 ∈ CRingOps → {𝑍} ∈ (Idl‘𝑅))
13	12	biantrurd 532	. . . . . . . 8 ⊢ (𝑅 ∈ CRingOps → (({𝑍} ≠ 𝑋 ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍}))) ↔ ({𝑍} ∈ (Idl‘𝑅) ∧ ({𝑍} ≠ 𝑋 ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍}))))))
14	2	rneqi 5948	. . . . . . . . . . . . . . 15 ⊢ ran 𝐺 = ran (1st ‘𝑅)
15	6, 14	eqtri 2765	. . . . . . . . . . . . . 14 ⊢ 𝑋 = ran (1st ‘𝑅)
16		isdmn3.5	. . . . . . . . . . . . . 14 ⊢ 𝑈 = (GId‘𝐻)
17	15, 5, 16	rngo1cl 37946	. . . . . . . . . . . . 13 ⊢ (𝑅 ∈ RingOps → 𝑈 ∈ 𝑋)
18		eleq2 2830	. . . . . . . . . . . . . 14 ⊢ ({𝑍} = 𝑋 → (𝑈 ∈ {𝑍} ↔ 𝑈 ∈ 𝑋))
19		elsni 4643	. . . . . . . . . . . . . 14 ⊢ (𝑈 ∈ {𝑍} → 𝑈 = 𝑍)
20	18, 19	biimtrrdi 254	. . . . . . . . . . . . 13 ⊢ ({𝑍} = 𝑋 → (𝑈 ∈ 𝑋 → 𝑈 = 𝑍))
21	17, 20	syl5com 31	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ RingOps → ({𝑍} = 𝑋 → 𝑈 = 𝑍))
22	2, 5, 3, 16, 6	rngoueqz 37947	. . . . . . . . . . . . 13 ⊢ (𝑅 ∈ RingOps → (𝑋 ≈ 1o ↔ 𝑈 = 𝑍))
23	2, 6, 3	rngo0cl 37926	. . . . . . . . . . . . . 14 ⊢ (𝑅 ∈ RingOps → 𝑍 ∈ 𝑋)
24		en1eqsn 9308	. . . . . . . . . . . . . . . 16 ⊢ ((𝑍 ∈ 𝑋 ∧ 𝑋 ≈ 1o) → 𝑋 = {𝑍})
25	24	eqcomd 2743	. . . . . . . . . . . . . . 15 ⊢ ((𝑍 ∈ 𝑋 ∧ 𝑋 ≈ 1o) → {𝑍} = 𝑋)
26	25	ex 412	. . . . . . . . . . . . . 14 ⊢ (𝑍 ∈ 𝑋 → (𝑋 ≈ 1o → {𝑍} = 𝑋))
27	23, 26	syl 17	. . . . . . . . . . . . 13 ⊢ (𝑅 ∈ RingOps → (𝑋 ≈ 1o → {𝑍} = 𝑋))
28	22, 27	sylbird 260	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ RingOps → (𝑈 = 𝑍 → {𝑍} = 𝑋))
29	21, 28	impbid 212	. . . . . . . . . . 11 ⊢ (𝑅 ∈ RingOps → ({𝑍} = 𝑋 ↔ 𝑈 = 𝑍))
30	8, 29	syl 17	. . . . . . . . . 10 ⊢ (𝑅 ∈ CRingOps → ({𝑍} = 𝑋 ↔ 𝑈 = 𝑍))
31	30	necon3bid 2985	. . . . . . . . 9 ⊢ (𝑅 ∈ CRingOps → ({𝑍} ≠ 𝑋 ↔ 𝑈 ≠ 𝑍))
32		ovex 7464	. . . . . . . . . . . . 13 ⊢ (𝑎𝐻𝑏) ∈ V
33	32	elsn 4641	. . . . . . . . . . . 12 ⊢ ((𝑎𝐻𝑏) ∈ {𝑍} ↔ (𝑎𝐻𝑏) = 𝑍)
34		velsn 4642	. . . . . . . . . . . . 13 ⊢ (𝑎 ∈ {𝑍} ↔ 𝑎 = 𝑍)
35		velsn 4642	. . . . . . . . . . . . 13 ⊢ (𝑏 ∈ {𝑍} ↔ 𝑏 = 𝑍)
36	34, 35	orbi12i 915	. . . . . . . . . . . 12 ⊢ ((𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍}) ↔ (𝑎 = 𝑍 ∨ 𝑏 = 𝑍))
37	33, 36	imbi12i 350	. . . . . . . . . . 11 ⊢ (((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍})) ↔ ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍 ∨ 𝑏 = 𝑍)))
38	37	a1i 11	. . . . . . . . . 10 ⊢ (𝑅 ∈ CRingOps → (((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍})) ↔ ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍 ∨ 𝑏 = 𝑍))))
39	38	2ralbidv 3221	. . . . . . . . 9 ⊢ (𝑅 ∈ CRingOps → (∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍})) ↔ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍 ∨ 𝑏 = 𝑍))))
40	31, 39	anbi12d 632	. . . . . . . 8 ⊢ (𝑅 ∈ CRingOps → (({𝑍} ≠ 𝑋 ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍}))) ↔ (𝑈 ≠ 𝑍 ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍 ∨ 𝑏 = 𝑍)))))
41	13, 40	bitr3d 281	. . . . . . 7 ⊢ (𝑅 ∈ CRingOps → (({𝑍} ∈ (Idl‘𝑅) ∧ ({𝑍} ≠ 𝑋 ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍})))) ↔ (𝑈 ≠ 𝑍 ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍 ∨ 𝑏 = 𝑍)))))
42	10, 41	bitrid 283	. . . . . 6 ⊢ (𝑅 ∈ CRingOps → (({𝑍} ∈ (Idl‘𝑅) ∧ {𝑍} ≠ 𝑋 ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ((𝑎𝐻𝑏) ∈ {𝑍} → (𝑎 ∈ {𝑍} ∨ 𝑏 ∈ {𝑍}))) ↔ (𝑈 ≠ 𝑍 ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍 ∨ 𝑏 = 𝑍)))))
43	7, 9, 42	3bitr3d 309	. . . . 5 ⊢ (𝑅 ∈ CRingOps → ((𝑅 ∈ RingOps ∧ {𝑍} ∈ (PrIdl‘𝑅)) ↔ (𝑈 ≠ 𝑍 ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍 ∨ 𝑏 = 𝑍)))))
44	4, 43	bitrid 283	. . . 4 ⊢ (𝑅 ∈ CRingOps → (𝑅 ∈ PrRing ↔ (𝑈 ≠ 𝑍 ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍 ∨ 𝑏 = 𝑍)))))
45	44	pm5.32i 574	. . 3 ⊢ ((𝑅 ∈ CRingOps ∧ 𝑅 ∈ PrRing) ↔ (𝑅 ∈ CRingOps ∧ (𝑈 ≠ 𝑍 ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍 ∨ 𝑏 = 𝑍)))))
46		ancom 460	. . 3 ⊢ ((𝑅 ∈ PrRing ∧ 𝑅 ∈ CRingOps) ↔ (𝑅 ∈ CRingOps ∧ 𝑅 ∈ PrRing))
47		3anass 1095	. . 3 ⊢ ((𝑅 ∈ CRingOps ∧ 𝑈 ≠ 𝑍 ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍 ∨ 𝑏 = 𝑍))) ↔ (𝑅 ∈ CRingOps ∧ (𝑈 ≠ 𝑍 ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍 ∨ 𝑏 = 𝑍)))))
48	45, 46, 47	3bitr4i 303	. 2 ⊢ ((𝑅 ∈ PrRing ∧ 𝑅 ∈ CRingOps) ↔ (𝑅 ∈ CRingOps ∧ 𝑈 ≠ 𝑍 ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍 ∨ 𝑏 = 𝑍))))
49	1, 48	bitri 275	1 ⊢ (𝑅 ∈ Dmn ↔ (𝑅 ∈ CRingOps ∧ 𝑈 ≠ 𝑍 ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 ((𝑎𝐻𝑏) = 𝑍 → (𝑎 = 𝑍 ∨ 𝑏 = 𝑍))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 848   ∧ w3a 1087   = wceq 1540   ∈ wcel 2108   ≠ wne 2940  ∀wral 3061  {csn 4626   class class class wbr 5143  ran crn 5686  ‘cfv 6561  (class class class)co 7431  1^st c1st 8012  2^nd c2nd 8013  1_oc1o 8499   ≈ cen 8982  GIdcgi 30509  RingOpscrngo 37901  CRingOpsccring 38000  Idlcidl 38014  PrIdlcpridl 38015  PrRingcprrng 38053  Dmncdmn 38054

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3380  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-int 4947  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-1st 8014  df-2nd 8015  df-1o 8506  df-en 8986  df-grpo 30512  df-gid 30513  df-ginv 30514  df-ablo 30564  df-ass 37850  df-exid 37852  df-mgmOLD 37856  df-sgrOLD 37868  df-mndo 37874  df-rngo 37902  df-com2 37997  df-crngo 38001  df-idl 38017  df-pridl 38018  df-prrngo 38055  df-dmn 38056  df-igen 38067

This theorem is referenced by:  dmnnzd  38082