ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  islidlm Unicode version

Theorem islidlm 14788
Description: Predicate of being a (left) ideal. (Contributed by Stefan O'Rear, 1-Apr-2015.)
Hypotheses
Ref Expression
islidl.s  |-  U  =  (LIdeal `  R )
islidl.b  |-  B  =  ( Base `  R
)
islidl.p  |-  .+  =  ( +g  `  R )
islidl.t  |-  .x.  =  ( .r `  R )
Assertion
Ref Expression
islidlm  |-  ( I  e.  U  <->  ( I  C_  B  /\  E. j 
j  e.  I  /\  A. x  e.  B  A. a  e.  I  A. b  e.  I  (
( x  .x.  a
)  .+  b )  e.  I ) )
Distinct variable groups:    x, B    I,
a, b, j, x    R, a, b, x
Allowed substitution hints:    B( j, a, b)    .+ ( x, j, a, b)    R( j)    .x. ( x, j, a, b)    U( x, j, a, b)

Proof of Theorem islidlm
Dummy variable  k is distinct from all other variables.
StepHypRef Expression
1 islidl.s . . 3  |-  U  =  (LIdeal `  R )
21lidlmex 14784 . 2  |-  ( I  e.  U  ->  R  e.  _V )
3 eleq1w 2299 . . . . . 6  |-  ( j  =  k  ->  (
j  e.  I  <->  k  e.  I ) )
43cbvexv 1974 . . . . 5  |-  ( E. j  j  e.  I  <->  E. k  k  e.  I
)
5 ssel 3242 . . . . . . 7  |-  ( I 
C_  B  ->  (
k  e.  I  -> 
k  e.  B ) )
6 islidl.b . . . . . . . 8  |-  B  =  ( Base `  R
)
76basmex 13390 . . . . . . 7  |-  ( k  e.  B  ->  R  e.  _V )
85, 7syl6 33 . . . . . 6  |-  ( I 
C_  B  ->  (
k  e.  I  ->  R  e.  _V )
)
98exlimdv 1872 . . . . 5  |-  ( I 
C_  B  ->  ( E. k  k  e.  I  ->  R  e.  _V ) )
104, 9biimtrid 152 . . . 4  |-  ( I 
C_  B  ->  ( E. j  j  e.  I  ->  R  e.  _V ) )
1110imp 124 . . 3  |-  ( ( I  C_  B  /\  E. j  j  e.  I
)  ->  R  e.  _V )
12113adant3 1048 . 2  |-  ( ( I  C_  B  /\  E. j  j  e.  I  /\  A. x  e.  B  A. a  e.  I  A. b  e.  I 
( ( x  .x.  a )  .+  b
)  e.  I )  ->  R  e.  _V )
13 eqid 2238 . . . 4  |-  (Scalar `  (ringLMod `  R ) )  =  (Scalar `  (ringLMod `  R ) )
14 eqid 2238 . . . 4  |-  ( Base `  (Scalar `  (ringLMod `  R
) ) )  =  ( Base `  (Scalar `  (ringLMod `  R )
) )
15 eqid 2238 . . . 4  |-  ( Base `  (ringLMod `  R )
)  =  ( Base `  (ringLMod `  R )
)
16 eqid 2238 . . . 4  |-  ( +g  `  (ringLMod `  R )
)  =  ( +g  `  (ringLMod `  R )
)
17 eqid 2238 . . . 4  |-  ( .s
`  (ringLMod `  R )
)  =  ( .s
`  (ringLMod `  R )
)
18 eqid 2238 . . . 4  |-  ( LSubSp `  (ringLMod `  R )
)  =  ( LSubSp `  (ringLMod `  R )
)
1913, 14, 15, 16, 17, 18islssm 14666 . . 3  |-  ( I  e.  ( LSubSp `  (ringLMod `  R ) )  <->  ( I  C_  ( Base `  (ringLMod `  R ) )  /\  E. j  j  e.  I  /\  A. x  e.  (
Base `  (Scalar `  (ringLMod `  R ) ) ) A. a  e.  I  A. b  e.  I 
( ( x ( .s `  (ringLMod `  R
) ) a ) ( +g  `  (ringLMod `  R ) ) b )  e.  I ) )
20 lidlvalg 14780 . . . . . 6  |-  ( R  e.  _V  ->  (LIdeal `  R )  =  (
LSubSp `  (ringLMod `  R
) ) )
211, 20eqtrid 2283 . . . . 5  |-  ( R  e.  _V  ->  U  =  ( LSubSp `  (ringLMod `  R ) ) )
2221eleq2d 2308 . . . 4  |-  ( R  e.  _V  ->  (
I  e.  U  <->  I  e.  ( LSubSp `  (ringLMod `  R
) ) ) )
23 rlmbasg 14764 . . . . . . 7  |-  ( R  e.  _V  ->  ( Base `  R )  =  ( Base `  (ringLMod `  R ) ) )
246, 23eqtrid 2283 . . . . . 6  |-  ( R  e.  _V  ->  B  =  ( Base `  (ringLMod `  R ) ) )
2524sseq2d 3278 . . . . 5  |-  ( R  e.  _V  ->  (
I  C_  B  <->  I  C_  ( Base `  (ringLMod `  R
) ) ) )
26 rlmscabas 14769 . . . . . . 7  |-  ( R  e.  _V  ->  ( Base `  R )  =  ( Base `  (Scalar `  (ringLMod `  R )
) ) )
276, 26eqtrid 2283 . . . . . 6  |-  ( R  e.  _V  ->  B  =  ( Base `  (Scalar `  (ringLMod `  R )
) ) )
28 islidl.p . . . . . . . . . 10  |-  .+  =  ( +g  `  R )
29 rlmplusgg 14765 . . . . . . . . . 10  |-  ( R  e.  _V  ->  ( +g  `  R )  =  ( +g  `  (ringLMod `  R ) ) )
3028, 29eqtrid 2283 . . . . . . . . 9  |-  ( R  e.  _V  ->  .+  =  ( +g  `  (ringLMod `  R
) ) )
31 islidl.t . . . . . . . . . . 11  |-  .x.  =  ( .r `  R )
32 rlmvscag 14770 . . . . . . . . . . 11  |-  ( R  e.  _V  ->  ( .r `  R )  =  ( .s `  (ringLMod `  R ) ) )
3331, 32eqtrid 2283 . . . . . . . . . 10  |-  ( R  e.  _V  ->  .x.  =  ( .s `  (ringLMod `  R
) ) )
3433oveqd 6092 . . . . . . . . 9  |-  ( R  e.  _V  ->  (
x  .x.  a )  =  ( x ( .s `  (ringLMod `  R
) ) a ) )
35 eqidd 2239 . . . . . . . . 9  |-  ( R  e.  _V  ->  b  =  b )
3630, 34, 35oveq123d 6096 . . . . . . . 8  |-  ( R  e.  _V  ->  (
( x  .x.  a
)  .+  b )  =  ( ( x ( .s `  (ringLMod `  R ) ) a ) ( +g  `  (ringLMod `  R ) ) b ) )
3736eleq1d 2307 . . . . . . 7  |-  ( R  e.  _V  ->  (
( ( x  .x.  a )  .+  b
)  e.  I  <->  ( (
x ( .s `  (ringLMod `  R ) ) a ) ( +g  `  (ringLMod `  R )
) b )  e.  I ) )
38372ralbidv 2574 . . . . . 6  |-  ( R  e.  _V  ->  ( A. a  e.  I  A. b  e.  I 
( ( x  .x.  a )  .+  b
)  e.  I  <->  A. a  e.  I  A. b  e.  I  ( (
x ( .s `  (ringLMod `  R ) ) a ) ( +g  `  (ringLMod `  R )
) b )  e.  I ) )
3927, 38raleqbidv 2765 . . . . 5  |-  ( R  e.  _V  ->  ( A. x  e.  B  A. a  e.  I  A. b  e.  I 
( ( x  .x.  a )  .+  b
)  e.  I  <->  A. x  e.  ( Base `  (Scalar `  (ringLMod `  R )
) ) A. a  e.  I  A. b  e.  I  ( (
x ( .s `  (ringLMod `  R ) ) a ) ( +g  `  (ringLMod `  R )
) b )  e.  I ) )
4025, 393anbi13d 1355 . . . 4  |-  ( R  e.  _V  ->  (
( I  C_  B  /\  E. j  j  e.  I  /\  A. x  e.  B  A. a  e.  I  A. b  e.  I  ( (
x  .x.  a )  .+  b )  e.  I
)  <->  ( I  C_  ( Base `  (ringLMod `  R
) )  /\  E. j  j  e.  I  /\  A. x  e.  (
Base `  (Scalar `  (ringLMod `  R ) ) ) A. a  e.  I  A. b  e.  I 
( ( x ( .s `  (ringLMod `  R
) ) a ) ( +g  `  (ringLMod `  R ) ) b )  e.  I ) ) )
4122, 40bibi12d 235 . . 3  |-  ( R  e.  _V  ->  (
( I  e.  U  <->  ( I  C_  B  /\  E. j  j  e.  I  /\  A. x  e.  B  A. a  e.  I  A. b  e.  I 
( ( x  .x.  a )  .+  b
)  e.  I ) )  <->  ( I  e.  ( LSubSp `  (ringLMod `  R
) )  <->  ( I  C_  ( Base `  (ringLMod `  R ) )  /\  E. j  j  e.  I  /\  A. x  e.  (
Base `  (Scalar `  (ringLMod `  R ) ) ) A. a  e.  I  A. b  e.  I 
( ( x ( .s `  (ringLMod `  R
) ) a ) ( +g  `  (ringLMod `  R ) ) b )  e.  I ) ) ) )
4219, 41mpbiri 168 . 2  |-  ( R  e.  _V  ->  (
I  e.  U  <->  ( I  C_  B  /\  E. j 
j  e.  I  /\  A. x  e.  B  A. a  e.  I  A. b  e.  I  (
( x  .x.  a
)  .+  b )  e.  I ) ) )
432, 12, 42pm5.21nii 716 1  |-  ( I  e.  U  <->  ( I  C_  B  /\  E. j 
j  e.  I  /\  A. x  e.  B  A. a  e.  I  A. b  e.  I  (
( x  .x.  a
)  .+  b )  e.  I ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 105    /\ w3a 1009    = wceq 1402   E.wex 1545    e. wcel 2209   A.wral 2528   _Vcvv 2821    C_ wss 3220   ` cfv 5372  (class class class)co 6075   Basecbs 13330   +g cplusg 13408   .rcmulr 13409  Scalarcsca 13411   .scvsca 13412   LSubSpclss 14661  ringLModcrglmod 14743  LIdealclidl 14776
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 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-pre-ltirr 8281  ax-pre-lttrn 8283  ax-pre-ltadd 8285
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-nel 2516  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-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-ltxr 8355  df-inn 9284  df-2 9342  df-3 9343  df-4 9344  df-5 9345  df-6 9346  df-7 9347  df-8 9348  df-ndx 13333  df-slot 13334  df-base 13336  df-sets 13337  df-iress 13338  df-plusg 13421  df-mulr 13422  df-sca 13424  df-vsca 13425  df-ip 13426  df-lssm 14662  df-sra 14744  df-rgmod 14745  df-lidl 14778
This theorem is referenced by:  rnglidlmcl  14789  dflidl2rng  14790
  Copyright terms: Public domain W3C validator