Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > isfldidl2 | Structured version Visualization version GIF version |
Description: Determine if a ring is a field based on its ideals. (Contributed by Jeff Madsen, 6-Jan-2011.) |
Ref | Expression |
---|---|
isfldidl2.1 | ⊢ 𝐺 = (1st ‘𝐾) |
isfldidl2.2 | ⊢ 𝐻 = (2nd ‘𝐾) |
isfldidl2.3 | ⊢ 𝑋 = ran 𝐺 |
isfldidl2.4 | ⊢ 𝑍 = (GId‘𝐺) |
Ref | Expression |
---|---|
isfldidl2 | ⊢ (𝐾 ∈ Fld ↔ (𝐾 ∈ CRingOps ∧ 𝑋 ≠ {𝑍} ∧ (Idl‘𝐾) = {{𝑍}, 𝑋})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isfldidl2.1 | . . 3 ⊢ 𝐺 = (1st ‘𝐾) | |
2 | isfldidl2.2 | . . 3 ⊢ 𝐻 = (2nd ‘𝐾) | |
3 | isfldidl2.3 | . . 3 ⊢ 𝑋 = ran 𝐺 | |
4 | isfldidl2.4 | . . 3 ⊢ 𝑍 = (GId‘𝐺) | |
5 | eqid 2821 | . . 3 ⊢ (GId‘𝐻) = (GId‘𝐻) | |
6 | 1, 2, 3, 4, 5 | isfldidl 35345 | . 2 ⊢ (𝐾 ∈ Fld ↔ (𝐾 ∈ CRingOps ∧ (GId‘𝐻) ≠ 𝑍 ∧ (Idl‘𝐾) = {{𝑍}, 𝑋})) |
7 | crngorngo 35277 | . . . . . . 7 ⊢ (𝐾 ∈ CRingOps → 𝐾 ∈ RingOps) | |
8 | eqcom 2828 | . . . . . . . 8 ⊢ ((GId‘𝐻) = 𝑍 ↔ 𝑍 = (GId‘𝐻)) | |
9 | 1, 2, 3, 4, 5 | 0rngo 35304 | . . . . . . . 8 ⊢ (𝐾 ∈ RingOps → (𝑍 = (GId‘𝐻) ↔ 𝑋 = {𝑍})) |
10 | 8, 9 | syl5bb 285 | . . . . . . 7 ⊢ (𝐾 ∈ RingOps → ((GId‘𝐻) = 𝑍 ↔ 𝑋 = {𝑍})) |
11 | 7, 10 | syl 17 | . . . . . 6 ⊢ (𝐾 ∈ CRingOps → ((GId‘𝐻) = 𝑍 ↔ 𝑋 = {𝑍})) |
12 | 11 | necon3bid 3060 | . . . . 5 ⊢ (𝐾 ∈ CRingOps → ((GId‘𝐻) ≠ 𝑍 ↔ 𝑋 ≠ {𝑍})) |
13 | 12 | anbi1d 631 | . . . 4 ⊢ (𝐾 ∈ CRingOps → (((GId‘𝐻) ≠ 𝑍 ∧ (Idl‘𝐾) = {{𝑍}, 𝑋}) ↔ (𝑋 ≠ {𝑍} ∧ (Idl‘𝐾) = {{𝑍}, 𝑋}))) |
14 | 13 | pm5.32i 577 | . . 3 ⊢ ((𝐾 ∈ CRingOps ∧ ((GId‘𝐻) ≠ 𝑍 ∧ (Idl‘𝐾) = {{𝑍}, 𝑋})) ↔ (𝐾 ∈ CRingOps ∧ (𝑋 ≠ {𝑍} ∧ (Idl‘𝐾) = {{𝑍}, 𝑋}))) |
15 | 3anass 1091 | . . 3 ⊢ ((𝐾 ∈ CRingOps ∧ (GId‘𝐻) ≠ 𝑍 ∧ (Idl‘𝐾) = {{𝑍}, 𝑋}) ↔ (𝐾 ∈ CRingOps ∧ ((GId‘𝐻) ≠ 𝑍 ∧ (Idl‘𝐾) = {{𝑍}, 𝑋}))) | |
16 | 3anass 1091 | . . 3 ⊢ ((𝐾 ∈ CRingOps ∧ 𝑋 ≠ {𝑍} ∧ (Idl‘𝐾) = {{𝑍}, 𝑋}) ↔ (𝐾 ∈ CRingOps ∧ (𝑋 ≠ {𝑍} ∧ (Idl‘𝐾) = {{𝑍}, 𝑋}))) | |
17 | 14, 15, 16 | 3bitr4i 305 | . 2 ⊢ ((𝐾 ∈ CRingOps ∧ (GId‘𝐻) ≠ 𝑍 ∧ (Idl‘𝐾) = {{𝑍}, 𝑋}) ↔ (𝐾 ∈ CRingOps ∧ 𝑋 ≠ {𝑍} ∧ (Idl‘𝐾) = {{𝑍}, 𝑋})) |
18 | 6, 17 | bitri 277 | 1 ⊢ (𝐾 ∈ Fld ↔ (𝐾 ∈ CRingOps ∧ 𝑋 ≠ {𝑍} ∧ (Idl‘𝐾) = {{𝑍}, 𝑋})) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 ≠ wne 3016 {csn 4566 {cpr 4568 ran crn 5555 ‘cfv 6354 1st c1st 7686 2nd c2nd 7687 GIdcgi 28266 RingOpscrngo 35171 Fldcfld 35268 CRingOpsccring 35270 Idlcidl 35284 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5189 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 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 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-int 4876 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-ord 6193 df-on 6194 df-lim 6195 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-om 7580 df-1st 7688 df-2nd 7689 df-1o 8101 df-er 8288 df-en 8509 df-dom 8510 df-sdom 8511 df-fin 8512 df-grpo 28269 df-gid 28270 df-ginv 28271 df-ablo 28321 df-ass 35120 df-exid 35122 df-mgmOLD 35126 df-sgrOLD 35138 df-mndo 35144 df-rngo 35172 df-drngo 35226 df-com2 35267 df-fld 35269 df-crngo 35271 df-idl 35287 df-igen 35337 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |