| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > 2idlval | GIF version | ||
| Description: Definition of a two-sided ideal. (Contributed by Mario Carneiro, 14-Jun-2015.) |
| Ref | Expression |
|---|---|
| 2idlval.i | ⊢ 𝐼 = (LIdeal‘𝑅) |
| 2idlval.o | ⊢ 𝑂 = (oppr‘𝑅) |
| 2idlval.j | ⊢ 𝐽 = (LIdeal‘𝑂) |
| 2idlval.t | ⊢ 𝑇 = (2Ideal‘𝑅) |
| Ref | Expression |
|---|---|
| 2idlval | ⊢ 𝑇 = (𝐼 ∩ 𝐽) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2idlval.t | . . . 4 ⊢ 𝑇 = (2Ideal‘𝑅) | |
| 2 | 1 | 2idlmex 14539 | . . 3 ⊢ (𝑥 ∈ 𝑇 → 𝑅 ∈ V) |
| 3 | elinel1 3392 | . . . 4 ⊢ (𝑥 ∈ (𝐼 ∩ 𝐽) → 𝑥 ∈ 𝐼) | |
| 4 | 2idlval.i | . . . . 5 ⊢ 𝐼 = (LIdeal‘𝑅) | |
| 5 | 4 | lidlmex 14513 | . . . 4 ⊢ (𝑥 ∈ 𝐼 → 𝑅 ∈ V) |
| 6 | 3, 5 | syl 14 | . . 3 ⊢ (𝑥 ∈ (𝐼 ∩ 𝐽) → 𝑅 ∈ V) |
| 7 | lidlex 14511 | . . . . . . . 8 ⊢ (𝑅 ∈ V → (LIdeal‘𝑅) ∈ V) | |
| 8 | 4, 7 | eqeltrid 2317 | . . . . . . 7 ⊢ (𝑅 ∈ V → 𝐼 ∈ V) |
| 9 | inex1g 4226 | . . . . . . 7 ⊢ (𝐼 ∈ V → (𝐼 ∩ 𝐽) ∈ V) | |
| 10 | 8, 9 | syl 14 | . . . . . 6 ⊢ (𝑅 ∈ V → (𝐼 ∩ 𝐽) ∈ V) |
| 11 | fveq2 5642 | . . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (LIdeal‘𝑟) = (LIdeal‘𝑅)) | |
| 12 | 11, 4 | eqtr4di 2281 | . . . . . . . 8 ⊢ (𝑟 = 𝑅 → (LIdeal‘𝑟) = 𝐼) |
| 13 | fveq2 5642 | . . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (oppr‘𝑟) = (oppr‘𝑅)) | |
| 14 | 2idlval.o | . . . . . . . . . . 11 ⊢ 𝑂 = (oppr‘𝑅) | |
| 15 | 13, 14 | eqtr4di 2281 | . . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (oppr‘𝑟) = 𝑂) |
| 16 | 15 | fveq2d 5646 | . . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (LIdeal‘(oppr‘𝑟)) = (LIdeal‘𝑂)) |
| 17 | 2idlval.j | . . . . . . . . 9 ⊢ 𝐽 = (LIdeal‘𝑂) | |
| 18 | 16, 17 | eqtr4di 2281 | . . . . . . . 8 ⊢ (𝑟 = 𝑅 → (LIdeal‘(oppr‘𝑟)) = 𝐽) |
| 19 | 12, 18 | ineq12d 3408 | . . . . . . 7 ⊢ (𝑟 = 𝑅 → ((LIdeal‘𝑟) ∩ (LIdeal‘(oppr‘𝑟))) = (𝐼 ∩ 𝐽)) |
| 20 | df-2idl 14538 | . . . . . . 7 ⊢ 2Ideal = (𝑟 ∈ V ↦ ((LIdeal‘𝑟) ∩ (LIdeal‘(oppr‘𝑟)))) | |
| 21 | 19, 20 | fvmptg 5725 | . . . . . 6 ⊢ ((𝑅 ∈ V ∧ (𝐼 ∩ 𝐽) ∈ V) → (2Ideal‘𝑅) = (𝐼 ∩ 𝐽)) |
| 22 | 10, 21 | mpdan 421 | . . . . 5 ⊢ (𝑅 ∈ V → (2Ideal‘𝑅) = (𝐼 ∩ 𝐽)) |
| 23 | 1, 22 | eqtrid 2275 | . . . 4 ⊢ (𝑅 ∈ V → 𝑇 = (𝐼 ∩ 𝐽)) |
| 24 | 23 | eleq2d 2300 | . . 3 ⊢ (𝑅 ∈ V → (𝑥 ∈ 𝑇 ↔ 𝑥 ∈ (𝐼 ∩ 𝐽))) |
| 25 | 2, 6, 24 | pm5.21nii 711 | . 2 ⊢ (𝑥 ∈ 𝑇 ↔ 𝑥 ∈ (𝐼 ∩ 𝐽)) |
| 26 | 25 | eqriv 2227 | 1 ⊢ 𝑇 = (𝐼 ∩ 𝐽) |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1397 ∈ wcel 2201 Vcvv 2801 ∩ cin 3198 ‘cfv 5328 opprcoppr 14104 LIdealclidl 14505 2Idealc2idl 14537 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2203 ax-14 2204 ax-ext 2212 ax-coll 4205 ax-sep 4208 ax-pow 4266 ax-pr 4301 ax-un 4532 ax-setind 4637 ax-cnex 8128 ax-resscn 8129 ax-1re 8131 ax-addrcl 8134 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ne 2402 df-ral 2514 df-rex 2515 df-reu 2516 df-rab 2518 df-v 2803 df-sbc 3031 df-csb 3127 df-dif 3201 df-un 3203 df-in 3205 df-ss 3212 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-int 3930 df-iun 3973 df-br 4090 df-opab 4152 df-mpt 4153 df-id 4392 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-ima 4740 df-iota 5288 df-fun 5330 df-fn 5331 df-f 5332 df-f1 5333 df-fo 5334 df-f1o 5335 df-fv 5336 df-ov 6026 df-oprab 6027 df-mpo 6028 df-inn 9149 df-2 9207 df-3 9208 df-4 9209 df-5 9210 df-6 9211 df-7 9212 df-8 9213 df-ndx 13108 df-slot 13109 df-base 13111 df-sets 13112 df-iress 13113 df-mulr 13197 df-sca 13199 df-vsca 13200 df-ip 13201 df-lssm 14391 df-sra 14473 df-rgmod 14474 df-lidl 14507 df-2idl 14538 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |