| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 2idlval | Structured version Visualization version 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 | . 2 ⊢ 𝑇 = (2Ideal‘𝑅) | |
| 2 | fveq2 6881 | . . . . . 6 ⊢ (𝑟 = 𝑅 → (LIdeal‘𝑟) = (LIdeal‘𝑅)) | |
| 3 | 2idlval.i | . . . . . 6 ⊢ 𝐼 = (LIdeal‘𝑅) | |
| 4 | 2, 3 | eqtr4di 2815 | . . . . 5 ⊢ (𝑟 = 𝑅 → (LIdeal‘𝑟) = 𝐼) |
| 5 | fveq2 6881 | . . . . . . . 8 ⊢ (𝑟 = 𝑅 → (oppr‘𝑟) = (oppr‘𝑅)) | |
| 6 | 2idlval.o | . . . . . . . 8 ⊢ 𝑂 = (oppr‘𝑅) | |
| 7 | 5, 6 | eqtr4di 2815 | . . . . . . 7 ⊢ (𝑟 = 𝑅 → (oppr‘𝑟) = 𝑂) |
| 8 | 7 | fveq2d 6885 | . . . . . 6 ⊢ (𝑟 = 𝑅 → (LIdeal‘(oppr‘𝑟)) = (LIdeal‘𝑂)) |
| 9 | 2idlval.j | . . . . . 6 ⊢ 𝐽 = (LIdeal‘𝑂) | |
| 10 | 8, 9 | eqtr4di 2815 | . . . . 5 ⊢ (𝑟 = 𝑅 → (LIdeal‘(oppr‘𝑟)) = 𝐽) |
| 11 | 4, 10 | ineq12d 4173 | . . . 4 ⊢ (𝑟 = 𝑅 → ((LIdeal‘𝑟) ∩ (LIdeal‘(oppr‘𝑟))) = (𝐼 ∩ 𝐽)) |
| 12 | df-2idl 21400 | . . . 4 ⊢ 2Ideal = (𝑟 ∈ V ↦ ((LIdeal‘𝑟) ∩ (LIdeal‘(oppr‘𝑟)))) | |
| 13 | 3 | fvexi 6895 | . . . . 5 ⊢ 𝐼 ∈ V |
| 14 | 13 | inex1 5285 | . . . 4 ⊢ (𝐼 ∩ 𝐽) ∈ V |
| 15 | 11, 12, 14 | fvmpt 6989 | . . 3 ⊢ (𝑅 ∈ V → (2Ideal‘𝑅) = (𝐼 ∩ 𝐽)) |
| 16 | fvprc 6873 | . . . 4 ⊢ (¬ 𝑅 ∈ V → (2Ideal‘𝑅) = ∅) | |
| 17 | inss1 4188 | . . . . 5 ⊢ (𝐼 ∩ 𝐽) ⊆ 𝐼 | |
| 18 | fvprc 6873 | . . . . . 6 ⊢ (¬ 𝑅 ∈ V → (LIdeal‘𝑅) = ∅) | |
| 19 | 3, 18 | eqtrid 2809 | . . . . 5 ⊢ (¬ 𝑅 ∈ V → 𝐼 = ∅) |
| 20 | sseq0 4360 | . . . . 5 ⊢ (((𝐼 ∩ 𝐽) ⊆ 𝐼 ∧ 𝐼 = ∅) → (𝐼 ∩ 𝐽) = ∅) | |
| 21 | 17, 19, 20 | sylancr 598 | . . . 4 ⊢ (¬ 𝑅 ∈ V → (𝐼 ∩ 𝐽) = ∅) |
| 22 | 16, 21 | eqtr4d 2800 | . . 3 ⊢ (¬ 𝑅 ∈ V → (2Ideal‘𝑅) = (𝐼 ∩ 𝐽)) |
| 23 | 15, 22 | pm2.61i 184 | . 2 ⊢ (2Ideal‘𝑅) = (𝐼 ∩ 𝐽) |
| 24 | 1, 23 | eqtri 2785 | 1 ⊢ 𝑇 = (𝐼 ∩ 𝐽) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1569 ∈ wcel 2142 Vcvv 3454 ∩ cin 3903 ⊆ wss 3904 ∅c0 4285 ‘cfv 6536 opprcoppr 20425 LIdealclidl 21341 2Idealc2idl 21399 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pr 5403 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-iota 6492 df-fun 6538 df-fv 6544 df-2idl 21400 |
| This theorem is used by: 2idlelb 21403 2idllidld 21404 2idlridld 21405 2idl0 21410 2idl1 21411 qus1 21424 qusrhm 21426 crng2idl 21431 oppr2idl 33777 qsdrngilem 33785 qsdrngi 33786 |
| Copyright terms: Public domain | W3C validator |