Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > 1idl | Structured version Visualization version GIF version |
Description: Two ways of expressing the unit ideal. (Contributed by Jeff Madsen, 10-Jun-2010.) |
Ref | Expression |
---|---|
1idl.1 | ⊢ 𝐺 = (1st ‘𝑅) |
1idl.2 | ⊢ 𝐻 = (2nd ‘𝑅) |
1idl.3 | ⊢ 𝑋 = ran 𝐺 |
1idl.4 | ⊢ 𝑈 = (GId‘𝐻) |
Ref | Expression |
---|---|
1idl | ⊢ ((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) → (𝑈 ∈ 𝐼 ↔ 𝐼 = 𝑋)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 1idl.1 | . . . . . 6 ⊢ 𝐺 = (1st ‘𝑅) | |
2 | 1idl.3 | . . . . . 6 ⊢ 𝑋 = ran 𝐺 | |
3 | 1, 2 | idlss 35309 | . . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) → 𝐼 ⊆ 𝑋) |
4 | 3 | adantr 483 | . . . 4 ⊢ (((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) ∧ 𝑈 ∈ 𝐼) → 𝐼 ⊆ 𝑋) |
5 | 1idl.2 | . . . . . . . . 9 ⊢ 𝐻 = (2nd ‘𝑅) | |
6 | 1 | rneqi 5807 | . . . . . . . . . 10 ⊢ ran 𝐺 = ran (1st ‘𝑅) |
7 | 2, 6 | eqtri 2844 | . . . . . . . . 9 ⊢ 𝑋 = ran (1st ‘𝑅) |
8 | 1idl.4 | . . . . . . . . 9 ⊢ 𝑈 = (GId‘𝐻) | |
9 | 5, 7, 8 | rngolidm 35230 | . . . . . . . 8 ⊢ ((𝑅 ∈ RingOps ∧ 𝑥 ∈ 𝑋) → (𝑈𝐻𝑥) = 𝑥) |
10 | 9 | ad2ant2rl 747 | . . . . . . 7 ⊢ (((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) ∧ (𝑈 ∈ 𝐼 ∧ 𝑥 ∈ 𝑋)) → (𝑈𝐻𝑥) = 𝑥) |
11 | 1, 5, 2 | idlrmulcl 35314 | . . . . . . 7 ⊢ (((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) ∧ (𝑈 ∈ 𝐼 ∧ 𝑥 ∈ 𝑋)) → (𝑈𝐻𝑥) ∈ 𝐼) |
12 | 10, 11 | eqeltrrd 2914 | . . . . . 6 ⊢ (((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) ∧ (𝑈 ∈ 𝐼 ∧ 𝑥 ∈ 𝑋)) → 𝑥 ∈ 𝐼) |
13 | 12 | expr 459 | . . . . 5 ⊢ (((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) ∧ 𝑈 ∈ 𝐼) → (𝑥 ∈ 𝑋 → 𝑥 ∈ 𝐼)) |
14 | 13 | ssrdv 3973 | . . . 4 ⊢ (((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) ∧ 𝑈 ∈ 𝐼) → 𝑋 ⊆ 𝐼) |
15 | 4, 14 | eqssd 3984 | . . 3 ⊢ (((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) ∧ 𝑈 ∈ 𝐼) → 𝐼 = 𝑋) |
16 | 15 | ex 415 | . 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) → (𝑈 ∈ 𝐼 → 𝐼 = 𝑋)) |
17 | 7, 5, 8 | rngo1cl 35232 | . . . 4 ⊢ (𝑅 ∈ RingOps → 𝑈 ∈ 𝑋) |
18 | 17 | adantr 483 | . . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) → 𝑈 ∈ 𝑋) |
19 | eleq2 2901 | . . 3 ⊢ (𝐼 = 𝑋 → (𝑈 ∈ 𝐼 ↔ 𝑈 ∈ 𝑋)) | |
20 | 18, 19 | syl5ibrcom 249 | . 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) → (𝐼 = 𝑋 → 𝑈 ∈ 𝐼)) |
21 | 16, 20 | impbid 214 | 1 ⊢ ((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) → (𝑈 ∈ 𝐼 ↔ 𝐼 = 𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ⊆ wss 3936 ran crn 5556 ‘cfv 6355 (class class class)co 7156 1st c1st 7687 2nd c2nd 7688 GIdcgi 28267 RingOpscrngo 35187 Idlcidl 35300 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-fo 6361 df-fv 6363 df-riota 7114 df-ov 7159 df-1st 7689 df-2nd 7690 df-grpo 28270 df-gid 28271 df-ablo 28322 df-ass 35136 df-exid 35138 df-mgmOLD 35142 df-sgrOLD 35154 df-mndo 35160 df-rngo 35188 df-idl 35303 |
This theorem is referenced by: 0rngo 35320 divrngidl 35321 maxidln1 35337 |
Copyright terms: Public domain | W3C validator |