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

Theorem 2idlval 19233
Description: Definition of a two-sided ideal. (Contributed by Mario Carneiro, 14-Jun-2015.)
Hypotheses
Ref Expression
2idlval.i  |-  I  =  (LIdeal `  R )
2idlval.o  |-  O  =  (oppr
`  R )
2idlval.j  |-  J  =  (LIdeal `  O )
2idlval.t  |-  T  =  (2Ideal `  R )
Assertion
Ref Expression
2idlval  |-  T  =  ( I  i^i  J
)

Proof of Theorem 2idlval
Dummy variable  r is distinct from all other variables.
StepHypRef Expression
1 2idlval.t . 2  |-  T  =  (2Ideal `  R )
2 fveq2 6191 . . . . . 6  |-  ( r  =  R  ->  (LIdeal `  r )  =  (LIdeal `  R ) )
3 2idlval.i . . . . . 6  |-  I  =  (LIdeal `  R )
42, 3syl6eqr 2674 . . . . 5  |-  ( r  =  R  ->  (LIdeal `  r )  =  I )
5 fveq2 6191 . . . . . . . 8  |-  ( r  =  R  ->  (oppr `  r
)  =  (oppr `  R
) )
6 2idlval.o . . . . . . . 8  |-  O  =  (oppr
`  R )
75, 6syl6eqr 2674 . . . . . . 7  |-  ( r  =  R  ->  (oppr `  r
)  =  O )
87fveq2d 6195 . . . . . 6  |-  ( r  =  R  ->  (LIdeal `  (oppr
`  r ) )  =  (LIdeal `  O
) )
9 2idlval.j . . . . . 6  |-  J  =  (LIdeal `  O )
108, 9syl6eqr 2674 . . . . 5  |-  ( r  =  R  ->  (LIdeal `  (oppr
`  r ) )  =  J )
114, 10ineq12d 3815 . . . 4  |-  ( r  =  R  ->  (
(LIdeal `  r )  i^i  (LIdeal `  (oppr
`  r ) ) )  =  ( I  i^i  J ) )
12 df-2idl 19232 . . . 4  |- 2Ideal  =  ( r  e.  _V  |->  ( (LIdeal `  r )  i^i  (LIdeal `  (oppr
`  r ) ) ) )
13 fvex 6201 . . . . . 6  |-  (LIdeal `  R )  e.  _V
143, 13eqeltri 2697 . . . . 5  |-  I  e. 
_V
1514inex1 4799 . . . 4  |-  ( I  i^i  J )  e. 
_V
1611, 12, 15fvmpt 6282 . . 3  |-  ( R  e.  _V  ->  (2Ideal `  R )  =  ( I  i^i  J ) )
17 fvprc 6185 . . . 4  |-  ( -.  R  e.  _V  ->  (2Ideal `  R )  =  (/) )
18 inss1 3833 . . . . 5  |-  ( I  i^i  J )  C_  I
19 fvprc 6185 . . . . . 6  |-  ( -.  R  e.  _V  ->  (LIdeal `  R )  =  (/) )
203, 19syl5eq 2668 . . . . 5  |-  ( -.  R  e.  _V  ->  I  =  (/) )
21 sseq0 3975 . . . . 5  |-  ( ( ( I  i^i  J
)  C_  I  /\  I  =  (/) )  -> 
( I  i^i  J
)  =  (/) )
2218, 20, 21sylancr 695 . . . 4  |-  ( -.  R  e.  _V  ->  ( I  i^i  J )  =  (/) )
2317, 22eqtr4d 2659 . . 3  |-  ( -.  R  e.  _V  ->  (2Ideal `  R )  =  ( I  i^i  J ) )
2416, 23pm2.61i 176 . 2  |-  (2Ideal `  R )  =  ( I  i^i  J )
251, 24eqtri 2644 1  |-  T  =  ( I  i^i  J
)
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    = wceq 1483    e. wcel 1990   _Vcvv 3200    i^i cin 3573    C_ wss 3574   (/)c0 3915   ` cfv 5888  opprcoppr 18622  LIdealclidl 19170  2Idealc2idl 19231
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-iota 5851  df-fun 5890  df-fv 5896  df-2idl 19232
This theorem is referenced by:  2idlcpbl  19234  qus1  19235  qusrhm  19237  crng2idl  19239
  Copyright terms: Public domain W3C validator