![]() |
Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > maxidlmax | Structured version Visualization version GIF version |
Description: A maximal ideal is a maximal proper ideal. (Contributed by Jeff Madsen, 16-Jun-2011.) |
Ref | Expression |
---|---|
maxidlnr.1 | ⊢ 𝐺 = (1st ‘𝑅) |
maxidlnr.2 | ⊢ 𝑋 = ran 𝐺 |
Ref | Expression |
---|---|
maxidlmax | ⊢ (((𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅)) ∧ (𝐼 ∈ (Idl‘𝑅) ∧ 𝑀 ⊆ 𝐼)) → (𝐼 = 𝑀 ∨ 𝐼 = 𝑋)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | maxidlnr.1 | . . . . . . 7 ⊢ 𝐺 = (1st ‘𝑅) | |
2 | maxidlnr.2 | . . . . . . 7 ⊢ 𝑋 = ran 𝐺 | |
3 | 1, 2 | ismaxidl 35478 | . . . . . 6 ⊢ (𝑅 ∈ RingOps → (𝑀 ∈ (MaxIdl‘𝑅) ↔ (𝑀 ∈ (Idl‘𝑅) ∧ 𝑀 ≠ 𝑋 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑀 ⊆ 𝑗 → (𝑗 = 𝑀 ∨ 𝑗 = 𝑋))))) |
4 | 3 | biimpa 480 | . . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅)) → (𝑀 ∈ (Idl‘𝑅) ∧ 𝑀 ≠ 𝑋 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑀 ⊆ 𝑗 → (𝑗 = 𝑀 ∨ 𝑗 = 𝑋)))) |
5 | 4 | simp3d 1141 | . . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅)) → ∀𝑗 ∈ (Idl‘𝑅)(𝑀 ⊆ 𝑗 → (𝑗 = 𝑀 ∨ 𝑗 = 𝑋))) |
6 | sseq2 3941 | . . . . . 6 ⊢ (𝑗 = 𝐼 → (𝑀 ⊆ 𝑗 ↔ 𝑀 ⊆ 𝐼)) | |
7 | eqeq1 2802 | . . . . . . 7 ⊢ (𝑗 = 𝐼 → (𝑗 = 𝑀 ↔ 𝐼 = 𝑀)) | |
8 | eqeq1 2802 | . . . . . . 7 ⊢ (𝑗 = 𝐼 → (𝑗 = 𝑋 ↔ 𝐼 = 𝑋)) | |
9 | 7, 8 | orbi12d 916 | . . . . . 6 ⊢ (𝑗 = 𝐼 → ((𝑗 = 𝑀 ∨ 𝑗 = 𝑋) ↔ (𝐼 = 𝑀 ∨ 𝐼 = 𝑋))) |
10 | 6, 9 | imbi12d 348 | . . . . 5 ⊢ (𝑗 = 𝐼 → ((𝑀 ⊆ 𝑗 → (𝑗 = 𝑀 ∨ 𝑗 = 𝑋)) ↔ (𝑀 ⊆ 𝐼 → (𝐼 = 𝑀 ∨ 𝐼 = 𝑋)))) |
11 | 10 | rspcva 3569 | . . . 4 ⊢ ((𝐼 ∈ (Idl‘𝑅) ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑀 ⊆ 𝑗 → (𝑗 = 𝑀 ∨ 𝑗 = 𝑋))) → (𝑀 ⊆ 𝐼 → (𝐼 = 𝑀 ∨ 𝐼 = 𝑋))) |
12 | 5, 11 | sylan2 595 | . . 3 ⊢ ((𝐼 ∈ (Idl‘𝑅) ∧ (𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅))) → (𝑀 ⊆ 𝐼 → (𝐼 = 𝑀 ∨ 𝐼 = 𝑋))) |
13 | 12 | ancoms 462 | . 2 ⊢ (((𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅)) ∧ 𝐼 ∈ (Idl‘𝑅)) → (𝑀 ⊆ 𝐼 → (𝐼 = 𝑀 ∨ 𝐼 = 𝑋))) |
14 | 13 | impr 458 | 1 ⊢ (((𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅)) ∧ (𝐼 ∈ (Idl‘𝑅) ∧ 𝑀 ⊆ 𝐼)) → (𝐼 = 𝑀 ∨ 𝐼 = 𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∨ wo 844 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 ∀wral 3106 ⊆ wss 3881 ran crn 5520 ‘cfv 6324 1st c1st 7669 RingOpscrngo 35332 Idlcidl 35445 MaxIdlcmaxidl 35447 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-iota 6283 df-fun 6326 df-fv 6332 df-maxidl 35450 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |