MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  2idlval Structured version   Visualization version   GIF version

Theorem 2idlval 21454
Description: Definition of a two-sided ideal. (Contributed by Mario Carneiro, 14-Jun-2015.)
Hypotheses
Ref Expression
2idlval.i 𝐼 = (LIdeal‘𝑅)
2idlval.o 𝑂 = (oppr𝑅)
2idlval.j 𝐽 = (LIdeal‘𝑂)
2idlval.t 𝑇 = (2Ideal‘𝑅)
Assertion
Ref Expression
2idlval 𝑇 = (𝐼𝐽)

Proof of Theorem 2idlval
Dummy variable 𝑟 is distinct from all other variables.
StepHypRef Expression
1 2idlval.t . 2 𝑇 = (2Ideal‘𝑅)
2 fveq2 6882 . . . . . 6 (𝑟 = 𝑅 → (LIdeal‘𝑟) = (LIdeal‘𝑅))
3 2idlval.i . . . . . 6 𝐼 = (LIdeal‘𝑅)
42, 3eqtr4di 2815 . . . . 5 (𝑟 = 𝑅 → (LIdeal‘𝑟) = 𝐼)
5 fveq2 6882 . . . . . . . 8 (𝑟 = 𝑅 → (oppr𝑟) = (oppr𝑅))
6 2idlval.o . . . . . . . 8 𝑂 = (oppr𝑅)
75, 6eqtr4di 2815 . . . . . . 7 (𝑟 = 𝑅 → (oppr𝑟) = 𝑂)
87fveq2d 6886 . . . . . 6 (𝑟 = 𝑅 → (LIdeal‘(oppr𝑟)) = (LIdeal‘𝑂))
9 2idlval.j . . . . . 6 𝐽 = (LIdeal‘𝑂)
108, 9eqtr4di 2815 . . . . 5 (𝑟 = 𝑅 → (LIdeal‘(oppr𝑟)) = 𝐽)
114, 10ineq12d 4170 . . . 4 (𝑟 = 𝑅 → ((LIdeal‘𝑟) ∩ (LIdeal‘(oppr𝑟))) = (𝐼𝐽))
12 df-2idl 21453 . . . 4 2Ideal = (𝑟 ∈ V ↦ ((LIdeal‘𝑟) ∩ (LIdeal‘(oppr𝑟))))
133fvexi 6896 . . . . 5 𝐼 ∈ V
1413inex1 5284 . . . 4 (𝐼𝐽) ∈ V
1511, 12, 14fvmpt 6990 . . 3 (𝑅 ∈ V → (2Ideal‘𝑅) = (𝐼𝐽))
16 fvprc 6874 . . . 4 𝑅 ∈ V → (2Ideal‘𝑅) = ∅)
17 inss1 4185 . . . . 5 (𝐼𝐽) ⊆ 𝐼
18 fvprc 6874 . . . . . 6 𝑅 ∈ V → (LIdeal‘𝑅) = ∅)
193, 18eqtrid 2809 . . . . 5 𝑅 ∈ V → 𝐼 = ∅)
20 sseq0 4357 . . . . 5 (((𝐼𝐽) ⊆ 𝐼𝐼 = ∅) → (𝐼𝐽) = ∅)
2117, 19, 20sylancr 599 . . . 4 𝑅 ∈ V → (𝐼𝐽) = ∅)
2216, 21eqtr4d 2800 . . 3 𝑅 ∈ V → (2Ideal‘𝑅) = (𝐼𝐽))
2315, 22pm2.61i 184 . 2 (2Ideal‘𝑅) = (𝐼𝐽)
241, 23eqtri 2785 1 𝑇 = (𝐼𝐽)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570  wcel 2145  Vcvv 3453  cin 3901  wss 3902  c0 4282  cfv 6537  opprcoppr 20478  LIdealclidl 21394  2Idealc2idl 21452
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  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 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6493  df-fun 6539  df-fv 6545  df-2idl 21453
This theorem is used by:  2idlelb  21456  2idllidld  21457  2idlridld  21458  2idl0  21463  2idl1  21464  qus1  21477  qusrhm  21479  crng2idl  21484  oppr2idl  33875  qsdrngilem  33883  qsdrngi  33884
  Copyright terms: Public domain W3C validator