| 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 14821 | . . 3 ⊢ (𝑥 ∈ 𝑇 → 𝑅 ∈ V) |
| 3 | elinel1 3415 | . . . 4 ⊢ (𝑥 ∈ (𝐼 ∩ 𝐽) → 𝑥 ∈ 𝐼) | |
| 4 | 2idlval.i | . . . . 5 ⊢ 𝐼 = (LIdeal‘𝑅) | |
| 5 | 4 | lidlmex 14795 | . . . 4 ⊢ (𝑥 ∈ 𝐼 → 𝑅 ∈ V) |
| 6 | 3, 5 | syl 14 | . . 3 ⊢ (𝑥 ∈ (𝐼 ∩ 𝐽) → 𝑅 ∈ V) |
| 7 | lidlex 14793 | . . . . . . . 8 ⊢ (𝑅 ∈ V → (LIdeal‘𝑅) ∈ V) | |
| 8 | 4, 7 | eqeltrid 2325 | . . . . . . 7 ⊢ (𝑅 ∈ V → 𝐼 ∈ V) |
| 9 | inex1g 4267 | . . . . . . 7 ⊢ (𝐼 ∈ V → (𝐼 ∩ 𝐽) ∈ V) | |
| 10 | 8, 9 | syl 14 | . . . . . 6 ⊢ (𝑅 ∈ V → (𝐼 ∩ 𝐽) ∈ V) |
| 11 | fveq2 5693 | . . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (LIdeal‘𝑟) = (LIdeal‘𝑅)) | |
| 12 | 11, 4 | eqtr4di 2289 | . . . . . . . 8 ⊢ (𝑟 = 𝑅 → (LIdeal‘𝑟) = 𝐼) |
| 13 | fveq2 5693 | . . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (oppr‘𝑟) = (oppr‘𝑅)) | |
| 14 | 2idlval.o | . . . . . . . . . . 11 ⊢ 𝑂 = (oppr‘𝑅) | |
| 15 | 13, 14 | eqtr4di 2289 | . . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (oppr‘𝑟) = 𝑂) |
| 16 | 15 | fveq2d 5697 | . . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (LIdeal‘(oppr‘𝑟)) = (LIdeal‘𝑂)) |
| 17 | 2idlval.j | . . . . . . . . 9 ⊢ 𝐽 = (LIdeal‘𝑂) | |
| 18 | 16, 17 | eqtr4di 2289 | . . . . . . . 8 ⊢ (𝑟 = 𝑅 → (LIdeal‘(oppr‘𝑟)) = 𝐽) |
| 19 | 12, 18 | ineq12d 3433 | . . . . . . 7 ⊢ (𝑟 = 𝑅 → ((LIdeal‘𝑟) ∩ (LIdeal‘(oppr‘𝑟))) = (𝐼 ∩ 𝐽)) |
| 20 | df-2idl 14820 | . . . . . . 7 ⊢ 2Ideal = (𝑟 ∈ V ↦ ((LIdeal‘𝑟) ∩ (LIdeal‘(oppr‘𝑟)))) | |
| 21 | 19, 20 | fvmptg 5778 | . . . . . 6 ⊢ ((𝑅 ∈ V ∧ (𝐼 ∩ 𝐽) ∈ V) → (2Ideal‘𝑅) = (𝐼 ∩ 𝐽)) |
| 22 | 10, 21 | mpdan 425 | . . . . 5 ⊢ (𝑅 ∈ V → (2Ideal‘𝑅) = (𝐼 ∩ 𝐽)) |
| 23 | 1, 22 | eqtrid 2283 | . . . 4 ⊢ (𝑅 ∈ V → 𝑇 = (𝐼 ∩ 𝐽)) |
| 24 | 23 | eleq2d 2308 | . . 3 ⊢ (𝑅 ∈ V → (𝑥 ∈ 𝑇 ↔ 𝑥 ∈ (𝐼 ∩ 𝐽))) |
| 25 | 2, 6, 24 | pm5.21nii 716 | . 2 ⊢ (𝑥 ∈ 𝑇 ↔ 𝑥 ∈ (𝐼 ∩ 𝐽)) |
| 26 | 25 | eqriv 2235 | 1 ⊢ 𝑇 = (𝐼 ∩ 𝐽) |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1402 ∈ wcel 2209 Vcvv 2821 ∩ cin 3219 ‘cfv 5375 opprcoppr 14355 LIdealclidl 14787 2Idealc2idl 14819 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4244 ax-sep 4247 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-cnex 8264 ax-resscn 8265 ax-1re 8267 ax-addrcl 8270 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-ov 6082 df-oprab 6083 df-mpo 6084 df-inn 9288 df-2 9346 df-3 9347 df-4 9348 df-5 9349 df-6 9350 df-7 9351 df-8 9352 df-ndx 13338 df-slot 13339 df-base 13341 df-sets 13342 df-iress 13343 df-mulr 13428 df-sca 13430 df-vsca 13431 df-ip 13432 df-lssm 14673 df-sra 14755 df-rgmod 14756 df-lidl 14789 df-2idl 14820 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |