![]() |
Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > dvrunz | Structured version Visualization version GIF version |
Description: In a division ring the ring unit is different from the zero. (Contributed by FL, 14-Feb-2010.) (Revised by Mario Carneiro, 15-Dec-2013.) (New usage is discouraged.) |
Ref | Expression |
---|---|
dvrunz.1 | ⊢ 𝐺 = (1st ‘𝑅) |
dvrunz.2 | ⊢ 𝐻 = (2nd ‘𝑅) |
dvrunz.3 | ⊢ 𝑋 = ran 𝐺 |
dvrunz.4 | ⊢ 𝑍 = (GId‘𝐺) |
dvrunz.5 | ⊢ 𝑈 = (GId‘𝐻) |
Ref | Expression |
---|---|
dvrunz | ⊢ (𝑅 ∈ DivRingOps → 𝑈 ≠ 𝑍) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dvrunz.4 | . . . 4 ⊢ 𝑍 = (GId‘𝐺) | |
2 | 1 | fvexi 6934 | . . 3 ⊢ 𝑍 ∈ V |
3 | 2 | zrdivrng 37913 | . 2 ⊢ ¬ 〈{〈〈𝑍, 𝑍〉, 𝑍〉}, {〈〈𝑍, 𝑍〉, 𝑍〉}〉 ∈ DivRingOps |
4 | dvrunz.1 | . . . . . . 7 ⊢ 𝐺 = (1st ‘𝑅) | |
5 | dvrunz.2 | . . . . . . 7 ⊢ 𝐻 = (2nd ‘𝑅) | |
6 | dvrunz.3 | . . . . . . 7 ⊢ 𝑋 = ran 𝐺 | |
7 | 4, 5, 6, 1 | drngoi 37911 | . . . . . 6 ⊢ (𝑅 ∈ DivRingOps → (𝑅 ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp)) |
8 | 7 | simpld 494 | . . . . 5 ⊢ (𝑅 ∈ DivRingOps → 𝑅 ∈ RingOps) |
9 | dvrunz.5 | . . . . . 6 ⊢ 𝑈 = (GId‘𝐻) | |
10 | 4, 5, 1, 9, 6 | rngoueqz 37900 | . . . . 5 ⊢ (𝑅 ∈ RingOps → (𝑋 ≈ 1o ↔ 𝑈 = 𝑍)) |
11 | 8, 10 | syl 17 | . . . 4 ⊢ (𝑅 ∈ DivRingOps → (𝑋 ≈ 1o ↔ 𝑈 = 𝑍)) |
12 | 4, 6, 1 | rngosn6 37886 | . . . . . . 7 ⊢ (𝑅 ∈ RingOps → (𝑋 ≈ 1o ↔ 𝑅 = 〈{〈〈𝑍, 𝑍〉, 𝑍〉}, {〈〈𝑍, 𝑍〉, 𝑍〉}〉)) |
13 | 8, 12 | syl 17 | . . . . . 6 ⊢ (𝑅 ∈ DivRingOps → (𝑋 ≈ 1o ↔ 𝑅 = 〈{〈〈𝑍, 𝑍〉, 𝑍〉}, {〈〈𝑍, 𝑍〉, 𝑍〉}〉)) |
14 | eleq1 2832 | . . . . . . 7 ⊢ (𝑅 = 〈{〈〈𝑍, 𝑍〉, 𝑍〉}, {〈〈𝑍, 𝑍〉, 𝑍〉}〉 → (𝑅 ∈ DivRingOps ↔ 〈{〈〈𝑍, 𝑍〉, 𝑍〉}, {〈〈𝑍, 𝑍〉, 𝑍〉}〉 ∈ DivRingOps)) | |
15 | 14 | biimpd 229 | . . . . . 6 ⊢ (𝑅 = 〈{〈〈𝑍, 𝑍〉, 𝑍〉}, {〈〈𝑍, 𝑍〉, 𝑍〉}〉 → (𝑅 ∈ DivRingOps → 〈{〈〈𝑍, 𝑍〉, 𝑍〉}, {〈〈𝑍, 𝑍〉, 𝑍〉}〉 ∈ DivRingOps)) |
16 | 13, 15 | biimtrdi 253 | . . . . 5 ⊢ (𝑅 ∈ DivRingOps → (𝑋 ≈ 1o → (𝑅 ∈ DivRingOps → 〈{〈〈𝑍, 𝑍〉, 𝑍〉}, {〈〈𝑍, 𝑍〉, 𝑍〉}〉 ∈ DivRingOps))) |
17 | 16 | pm2.43a 54 | . . . 4 ⊢ (𝑅 ∈ DivRingOps → (𝑋 ≈ 1o → 〈{〈〈𝑍, 𝑍〉, 𝑍〉}, {〈〈𝑍, 𝑍〉, 𝑍〉}〉 ∈ DivRingOps)) |
18 | 11, 17 | sylbird 260 | . . 3 ⊢ (𝑅 ∈ DivRingOps → (𝑈 = 𝑍 → 〈{〈〈𝑍, 𝑍〉, 𝑍〉}, {〈〈𝑍, 𝑍〉, 𝑍〉}〉 ∈ DivRingOps)) |
19 | 18 | necon3bd 2960 | . 2 ⊢ (𝑅 ∈ DivRingOps → (¬ 〈{〈〈𝑍, 𝑍〉, 𝑍〉}, {〈〈𝑍, 𝑍〉, 𝑍〉}〉 ∈ DivRingOps → 𝑈 ≠ 𝑍)) |
20 | 3, 19 | mpi 20 | 1 ⊢ (𝑅 ∈ DivRingOps → 𝑈 ≠ 𝑍) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 = wceq 1537 ∈ wcel 2108 ≠ wne 2946 ∖ cdif 3973 {csn 4648 〈cop 4654 class class class wbr 5166 × cxp 5698 ran crn 5701 ↾ cres 5702 ‘cfv 6573 1st c1st 8028 2nd c2nd 8029 1oc1o 8515 ≈ cen 9000 GrpOpcgr 30521 GIdcgi 30522 RingOpscrngo 37854 DivRingOpscdrng 37908 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-1st 8030 df-2nd 8031 df-1o 8522 df-en 9004 df-grpo 30525 df-gid 30526 df-ablo 30577 df-ass 37803 df-exid 37805 df-mgmOLD 37809 df-sgrOLD 37821 df-mndo 37827 df-rngo 37855 df-drngo 37909 |
This theorem is referenced by: isdrngo2 37918 divrngpr 38013 isfldidl 38028 |
Copyright terms: Public domain | W3C validator |