drngoi - Mathbox for Jeff Madsen

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

Theorem drngoi 35795

Description: The properties of a division ring. (Contributed by NM, 4-Apr-2009.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
drngi.1	⊢ 𝐺 = (1^st ‘𝑅)
drngi.2	⊢ 𝐻 = (2^nd ‘𝑅)
drngi.3	⊢ 𝑋 = ran 𝐺
drngi.4	⊢ 𝑍 = (GId‘𝐺)

**Assertion**
Ref	Expression
drngoi	⊢ (𝑅 ∈ DivRingOps → (𝑅 ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp))

Proof of Theorem drngoi Dummy variables 𝑔 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		opeq1 4770	. . . . . 6 ⊢ (𝑔 = (1^st ‘𝑅) → ⟨𝑔, ℎ⟩ = ⟨(1^st ‘𝑅), ℎ⟩)
2	1	eleq1d 2815	. . . . 5 ⊢ (𝑔 = (1^st ‘𝑅) → (⟨𝑔, ℎ⟩ ∈ RingOps ↔ ⟨(1^st ‘𝑅), ℎ⟩ ∈ RingOps))
3		id 22	. . . . . . . . . . . 12 ⊢ (𝑔 = (1^st ‘𝑅) → 𝑔 = (1^st ‘𝑅))
4		drngi.1	. . . . . . . . . . . 12 ⊢ 𝐺 = (1^st ‘𝑅)
5	3, 4	eqtr4di 2789	. . . . . . . . . . 11 ⊢ (𝑔 = (1^st ‘𝑅) → 𝑔 = 𝐺)
6	5	rneqd 5792	. . . . . . . . . 10 ⊢ (𝑔 = (1^st ‘𝑅) → ran 𝑔 = ran 𝐺)
7		drngi.3	. . . . . . . . . 10 ⊢ 𝑋 = ran 𝐺
8	6, 7	eqtr4di 2789	. . . . . . . . 9 ⊢ (𝑔 = (1^st ‘𝑅) → ran 𝑔 = 𝑋)
9	5	fveq2d 6699	. . . . . . . . . . 11 ⊢ (𝑔 = (1^st ‘𝑅) → (GId‘𝑔) = (GId‘𝐺))
10		drngi.4	. . . . . . . . . . 11 ⊢ 𝑍 = (GId‘𝐺)
11	9, 10	eqtr4di 2789	. . . . . . . . . 10 ⊢ (𝑔 = (1^st ‘𝑅) → (GId‘𝑔) = 𝑍)
12	11	sneqd 4539	. . . . . . . . 9 ⊢ (𝑔 = (1^st ‘𝑅) → {(GId‘𝑔)} = {𝑍})
13	8, 12	difeq12d 4024	. . . . . . . 8 ⊢ (𝑔 = (1^st ‘𝑅) → (ran 𝑔 ∖ {(GId‘𝑔)}) = (𝑋 ∖ {𝑍}))
14	13	sqxpeqd 5568	. . . . . . 7 ⊢ (𝑔 = (1^st ‘𝑅) → ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)})) = ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍})))
15	14	reseq2d 5836	. . . . . 6 ⊢ (𝑔 = (1^st ‘𝑅) → (ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) = (ℎ ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))))
16	15	eleq1d 2815	. . . . 5 ⊢ (𝑔 = (1^st ‘𝑅) → ((ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) ∈ GrpOp ↔ (ℎ ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp))
17	2, 16	anbi12d 634	. . . 4 ⊢ (𝑔 = (1^st ‘𝑅) → ((⟨𝑔, ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) ∈ GrpOp) ↔ (⟨(1^st ‘𝑅), ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp)))
18		opeq2 4771	. . . . . . 7 ⊢ (ℎ = (2^nd ‘𝑅) → ⟨(1^st ‘𝑅), ℎ⟩ = ⟨(1^st ‘𝑅), (2^nd ‘𝑅)⟩)
19	18	eleq1d 2815	. . . . . 6 ⊢ (ℎ = (2^nd ‘𝑅) → (⟨(1^st ‘𝑅), ℎ⟩ ∈ RingOps ↔ ⟨(1^st ‘𝑅), (2^nd ‘𝑅)⟩ ∈ RingOps))
20	19	anbi1d 633	. . . . 5 ⊢ (ℎ = (2^nd ‘𝑅) → ((⟨(1^st ‘𝑅), ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp) ↔ (⟨(1^st ‘𝑅), (2^nd ‘𝑅)⟩ ∈ RingOps ∧ (ℎ ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp)))
21		drngi.2	. . . . . . . . 9 ⊢ 𝐻 = (2^nd ‘𝑅)
22		id 22	. . . . . . . . 9 ⊢ (ℎ = (2^nd ‘𝑅) → ℎ = (2^nd ‘𝑅))
23	21, 22	eqtr4id 2790	. . . . . . . 8 ⊢ (ℎ = (2^nd ‘𝑅) → 𝐻 = ℎ)
24	23	reseq1d 5835	. . . . . . 7 ⊢ (ℎ = (2^nd ‘𝑅) → (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) = (ℎ ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))))
25	24	eleq1d 2815	. . . . . 6 ⊢ (ℎ = (2^nd ‘𝑅) → ((𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp ↔ (ℎ ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp))
26	25	anbi2d 632	. . . . 5 ⊢ (ℎ = (2^nd ‘𝑅) → ((⟨(1^st ‘𝑅), (2^nd ‘𝑅)⟩ ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp) ↔ (⟨(1^st ‘𝑅), (2^nd ‘𝑅)⟩ ∈ RingOps ∧ (ℎ ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp)))
27	20, 26	bitr4d 285	. . . 4 ⊢ (ℎ = (2^nd ‘𝑅) → ((⟨(1^st ‘𝑅), ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp) ↔ (⟨(1^st ‘𝑅), (2^nd ‘𝑅)⟩ ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp)))
28	17, 27	elopabi 7810	. . 3 ⊢ (𝑅 ∈ {⟨𝑔, ℎ⟩ ∣ (⟨𝑔, ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) ∈ GrpOp)} → (⟨(1^st ‘𝑅), (2^nd ‘𝑅)⟩ ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp))
29		df-drngo 35793	. . 3 ⊢ DivRingOps = {⟨𝑔, ℎ⟩ ∣ (⟨𝑔, ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) ∈ GrpOp)}
30	28, 29	eleq2s 2849	. 2 ⊢ (𝑅 ∈ DivRingOps → (⟨(1^st ‘𝑅), (2^nd ‘𝑅)⟩ ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp))
31	29	relopabiv 5675	. . . . 5 ⊢ Rel DivRingOps
32		1st2nd 7788	. . . . 5 ⊢ ((Rel DivRingOps ∧ 𝑅 ∈ DivRingOps) → 𝑅 = ⟨(1^st ‘𝑅), (2^nd ‘𝑅)⟩)
33	31, 32	mpan 690	. . . 4 ⊢ (𝑅 ∈ DivRingOps → 𝑅 = ⟨(1^st ‘𝑅), (2^nd ‘𝑅)⟩)
34	33	eleq1d 2815	. . 3 ⊢ (𝑅 ∈ DivRingOps → (𝑅 ∈ RingOps ↔ ⟨(1^st ‘𝑅), (2^nd ‘𝑅)⟩ ∈ RingOps))
35	34	anbi1d 633	. 2 ⊢ (𝑅 ∈ DivRingOps → ((𝑅 ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp) ↔ (⟨(1^st ‘𝑅), (2^nd ‘𝑅)⟩ ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp)))
36	30, 35	mpbird 260	1 ⊢ (𝑅 ∈ DivRingOps → (𝑅 ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 = wceq 1543 ∈ wcel 2112 ∖ cdif 3850 {csn 4527 ⟨cop 4533 {copab 5101 × cxp 5534 ran crn 5537 ↾ cres 5538 Rel wrel 5541 ‘cfv 6358 1^st c1st 7737 2^nd c2nd 7738 GrpOpcgr 28524 GIdcgi 28525 RingOpscrngo 35738 DivRingOpscdrng 35792

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2708 ax-sep 5177 ax-nul 5184 ax-pr 5307 ax-un 7501

This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2728 df-clel 2809 df-nfc 2879 df-ne 2933 df-ral 3056 df-rex 3057 df-rab 3060 df-v 3400 df-sbc 3684 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-nul 4224 df-if 4426 df-sn 4528 df-pr 4530 df-op 4534 df-uni 4806 df-br 5040 df-opab 5102 df-mpt 5121 df-id 5440 df-xp 5542 df-rel 5543 df-cnv 5544 df-co 5545 df-dm 5546 df-rn 5547 df-res 5548 df-iota 6316 df-fun 6360 df-fv 6366 df-1st 7739 df-2nd 7740 df-drngo 35793

This theorem is referenced by: dvrunz 35798 fldcrng 35848

W3C validator