divrngpr - Mathbox for Jeff Madsen

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

Theorem divrngpr 38374

Description: A division ring is a prime ring. (Contributed by Jeff Madsen, 6-Jan-2011.)

**Assertion**
Ref	Expression
divrngpr	⊢ (𝑅 ∈ DivRingOps → 𝑅 ∈ PrRing)

**Proof of Theorem divrngpr**
Step	Hyp	Ref	Expression
1		eqid 2736	. . . 4 ⊢ (1^st ‘𝑅) = (1^st ‘𝑅)
2		eqid 2736	. . . 4 ⊢ (2^nd ‘𝑅) = (2^nd ‘𝑅)
3		eqid 2736	. . . 4 ⊢ (GId‘(1^st ‘𝑅)) = (GId‘(1^st ‘𝑅))
4		eqid 2736	. . . 4 ⊢ ran (1^st ‘𝑅) = ran (1^st ‘𝑅)
5	1, 2, 3, 4	isdrngo1 38277	. . 3 ⊢ (𝑅 ∈ DivRingOps ↔ (𝑅 ∈ RingOps ∧ ((2^nd ‘𝑅) ↾ ((ran (1^st ‘𝑅) ∖ {(GId‘(1^st ‘𝑅))}) × (ran (1^st ‘𝑅) ∖ {(GId‘(1^st ‘𝑅))}))) ∈ GrpOp))
6	5	simplbi 496	. 2 ⊢ (𝑅 ∈ DivRingOps → 𝑅 ∈ RingOps)
7		eqid 2736	. . 3 ⊢ (GId‘(2^nd ‘𝑅)) = (GId‘(2^nd ‘𝑅))
8	1, 2, 4, 3, 7	dvrunz 38275	. 2 ⊢ (𝑅 ∈ DivRingOps → (GId‘(2^nd ‘𝑅)) ≠ (GId‘(1^st ‘𝑅)))
9	1, 2, 4, 3	divrngidl 38349	. 2 ⊢ (𝑅 ∈ DivRingOps → (Idl‘𝑅) = {{(GId‘(1^st ‘𝑅))}, ran (1^st ‘𝑅)})
10	1, 2, 4, 3, 7	smprngopr 38373	. 2 ⊢ ((𝑅 ∈ RingOps ∧ (GId‘(2^nd ‘𝑅)) ≠ (GId‘(1^st ‘𝑅)) ∧ (Idl‘𝑅) = {{(GId‘(1^st ‘𝑅))}, ran (1^st ‘𝑅)}) → 𝑅 ∈ PrRing)
11	6, 8, 9, 10	syl3anc 1374	1 ⊢ (𝑅 ∈ DivRingOps → 𝑅 ∈ PrRing)

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ≠ wne 2932 ∖ cdif 3886 {csn 4567 {cpr 4569 × cxp 5629 ran crn 5632 ↾ cres 5633 ‘cfv 6498 1^st c1st 7940 2^nd c2nd 7941 GrpOpcgr 30560 GIdcgi 30561 RingOpscrngo 38215 DivRingOpscdrng 38269 Idlcidl 38328 PrRingcprrng 38367

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 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689

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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-1st 7942 df-2nd 7943 df-1o 8405 df-en 8894 df-grpo 30564 df-gid 30565 df-ginv 30566 df-ablo 30616 df-ass 38164 df-exid 38166 df-mgmOLD 38170 df-sgrOLD 38182 df-mndo 38188 df-rngo 38216 df-drngo 38270 df-idl 38331 df-pridl 38332 df-prrngo 38369

This theorem is referenced by: flddmn 38379

W3C validator