Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > idlnegcl | Structured version Visualization version GIF version |
Description: An ideal is closed under negation. (Contributed by Jeff Madsen, 10-Jun-2010.) |
Ref | Expression |
---|---|
idlnegcl.1 | ⊢ 𝐺 = (1st ‘𝑅) |
idlnegcl.2 | ⊢ 𝑁 = (inv‘𝐺) |
Ref | Expression |
---|---|
idlnegcl | ⊢ (((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) ∧ 𝐴 ∈ 𝐼) → (𝑁‘𝐴) ∈ 𝐼) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | idlnegcl.1 | . . . 4 ⊢ 𝐺 = (1st ‘𝑅) | |
2 | eqid 2622 | . . . 4 ⊢ ran 𝐺 = ran 𝐺 | |
3 | 1, 2 | idlss 33815 | . . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) → 𝐼 ⊆ ran 𝐺) |
4 | ssel2 3598 | . . . . 5 ⊢ ((𝐼 ⊆ ran 𝐺 ∧ 𝐴 ∈ 𝐼) → 𝐴 ∈ ran 𝐺) | |
5 | eqid 2622 | . . . . . 6 ⊢ (2nd ‘𝑅) = (2nd ‘𝑅) | |
6 | idlnegcl.2 | . . . . . 6 ⊢ 𝑁 = (inv‘𝐺) | |
7 | eqid 2622 | . . . . . 6 ⊢ (GId‘(2nd ‘𝑅)) = (GId‘(2nd ‘𝑅)) | |
8 | 1, 5, 2, 6, 7 | rngonegmn1l 33740 | . . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ ran 𝐺) → (𝑁‘𝐴) = ((𝑁‘(GId‘(2nd ‘𝑅)))(2nd ‘𝑅)𝐴)) |
9 | 4, 8 | sylan2 491 | . . . 4 ⊢ ((𝑅 ∈ RingOps ∧ (𝐼 ⊆ ran 𝐺 ∧ 𝐴 ∈ 𝐼)) → (𝑁‘𝐴) = ((𝑁‘(GId‘(2nd ‘𝑅)))(2nd ‘𝑅)𝐴)) |
10 | 9 | anassrs 680 | . . 3 ⊢ (((𝑅 ∈ RingOps ∧ 𝐼 ⊆ ran 𝐺) ∧ 𝐴 ∈ 𝐼) → (𝑁‘𝐴) = ((𝑁‘(GId‘(2nd ‘𝑅)))(2nd ‘𝑅)𝐴)) |
11 | 3, 10 | syldanl 735 | . 2 ⊢ (((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) ∧ 𝐴 ∈ 𝐼) → (𝑁‘𝐴) = ((𝑁‘(GId‘(2nd ‘𝑅)))(2nd ‘𝑅)𝐴)) |
12 | 1 | rneqi 5352 | . . . . . 6 ⊢ ran 𝐺 = ran (1st ‘𝑅) |
13 | 12, 5, 7 | rngo1cl 33738 | . . . . 5 ⊢ (𝑅 ∈ RingOps → (GId‘(2nd ‘𝑅)) ∈ ran 𝐺) |
14 | 1, 2, 6 | rngonegcl 33726 | . . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ (GId‘(2nd ‘𝑅)) ∈ ran 𝐺) → (𝑁‘(GId‘(2nd ‘𝑅))) ∈ ran 𝐺) |
15 | 13, 14 | mpdan 702 | . . . 4 ⊢ (𝑅 ∈ RingOps → (𝑁‘(GId‘(2nd ‘𝑅))) ∈ ran 𝐺) |
16 | 15 | ad2antrr 762 | . . 3 ⊢ (((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) ∧ 𝐴 ∈ 𝐼) → (𝑁‘(GId‘(2nd ‘𝑅))) ∈ ran 𝐺) |
17 | 1, 5, 2 | idllmulcl 33819 | . . . 4 ⊢ (((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) ∧ (𝐴 ∈ 𝐼 ∧ (𝑁‘(GId‘(2nd ‘𝑅))) ∈ ran 𝐺)) → ((𝑁‘(GId‘(2nd ‘𝑅)))(2nd ‘𝑅)𝐴) ∈ 𝐼) |
18 | 17 | anassrs 680 | . . 3 ⊢ ((((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) ∧ 𝐴 ∈ 𝐼) ∧ (𝑁‘(GId‘(2nd ‘𝑅))) ∈ ran 𝐺) → ((𝑁‘(GId‘(2nd ‘𝑅)))(2nd ‘𝑅)𝐴) ∈ 𝐼) |
19 | 16, 18 | mpdan 702 | . 2 ⊢ (((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) ∧ 𝐴 ∈ 𝐼) → ((𝑁‘(GId‘(2nd ‘𝑅)))(2nd ‘𝑅)𝐴) ∈ 𝐼) |
20 | 11, 19 | eqeltrd 2701 | 1 ⊢ (((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) ∧ 𝐴 ∈ 𝐼) → (𝑁‘𝐴) ∈ 𝐼) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ⊆ wss 3574 ran crn 5115 ‘cfv 5888 (class class class)co 6650 1st c1st 7166 2nd c2nd 7167 GIdcgi 27344 invcgn 27345 RingOpscrngo 33693 Idlcidl 33806 |
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-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-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 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-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-1st 7168 df-2nd 7169 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-idl 33809 |
This theorem is referenced by: idlsubcl 33822 |
Copyright terms: Public domain | W3C validator |