Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  islmodfg Structured version   Visualization version   Unicode version

Theorem islmodfg 35998
Description: Property of a finitely generated left module. (Contributed by Stefan O'Rear, 1-Jan-2015.)
Hypotheses
Ref Expression
islmodfg.b  |-  B  =  ( Base `  W
)
islmodfg.n  |-  N  =  ( LSpan `  W )
Assertion
Ref Expression
islmodfg  |-  ( W  e.  LMod  ->  ( W  e. LFinGen 
<->  E. b  e.  ~P  B ( b  e. 
Fin  /\  ( N `  b )  =  B ) ) )
Distinct variable groups:    W, b    B, b    N, b

Proof of Theorem islmodfg
Dummy variable  a is distinct from all other variables.
StepHypRef Expression
1 df-lfig 35997 . . . 4  |- LFinGen  =  {
a  e.  LMod  |  (
Base `  a )  e.  ( ( LSpan `  a
) " ( ~P ( Base `  a
)  i^i  Fin )
) }
21eleq2i 2541 . . 3  |-  ( W  e. LFinGen 
<->  W  e.  { a  e.  LMod  |  ( Base `  a )  e.  ( ( LSpan `  a
) " ( ~P ( Base `  a
)  i^i  Fin )
) } )
3 fveq2 5879 . . . . 5  |-  ( a  =  W  ->  ( Base `  a )  =  ( Base `  W
) )
4 fveq2 5879 . . . . . . 7  |-  ( a  =  W  ->  ( LSpan `  a )  =  ( LSpan `  W )
)
5 islmodfg.n . . . . . . 7  |-  N  =  ( LSpan `  W )
64, 5syl6eqr 2523 . . . . . 6  |-  ( a  =  W  ->  ( LSpan `  a )  =  N )
73pweqd 3947 . . . . . . 7  |-  ( a  =  W  ->  ~P ( Base `  a )  =  ~P ( Base `  W
) )
87ineq1d 3624 . . . . . 6  |-  ( a  =  W  ->  ( ~P ( Base `  a
)  i^i  Fin )  =  ( ~P ( Base `  W )  i^i 
Fin ) )
96, 8imaeq12d 5175 . . . . 5  |-  ( a  =  W  ->  (
( LSpan `  a ) " ( ~P ( Base `  a )  i^i 
Fin ) )  =  ( N " ( ~P ( Base `  W
)  i^i  Fin )
) )
103, 9eleq12d 2543 . . . 4  |-  ( a  =  W  ->  (
( Base `  a )  e.  ( ( LSpan `  a
) " ( ~P ( Base `  a
)  i^i  Fin )
)  <->  ( Base `  W
)  e.  ( N
" ( ~P ( Base `  W )  i^i 
Fin ) ) ) )
1110elrab3 3185 . . 3  |-  ( W  e.  LMod  ->  ( W  e.  { a  e. 
LMod  |  ( Base `  a )  e.  ( ( LSpan `  a ) " ( ~P ( Base `  a )  i^i 
Fin ) ) }  <-> 
( Base `  W )  e.  ( N " ( ~P ( Base `  W
)  i^i  Fin )
) ) )
122, 11syl5bb 265 . 2  |-  ( W  e.  LMod  ->  ( W  e. LFinGen 
<->  ( Base `  W
)  e.  ( N
" ( ~P ( Base `  W )  i^i 
Fin ) ) ) )
13 eqid 2471 . . . . . 6  |-  ( Base `  W )  =  (
Base `  W )
14 eqid 2471 . . . . . 6  |-  ( LSubSp `  W )  =  (
LSubSp `  W )
1513, 14, 5lspf 18275 . . . . 5  |-  ( W  e.  LMod  ->  N : ~P ( Base `  W
) --> ( LSubSp `  W
) )
16 ffn 5739 . . . . 5  |-  ( N : ~P ( Base `  W ) --> ( LSubSp `  W )  ->  N  Fn  ~P ( Base `  W
) )
1715, 16syl 17 . . . 4  |-  ( W  e.  LMod  ->  N  Fn  ~P ( Base `  W
) )
18 inss1 3643 . . . 4  |-  ( ~P ( Base `  W
)  i^i  Fin )  C_ 
~P ( Base `  W
)
19 fvelimab 5936 . . . 4  |-  ( ( N  Fn  ~P ( Base `  W )  /\  ( ~P ( Base `  W
)  i^i  Fin )  C_ 
~P ( Base `  W
) )  ->  (
( Base `  W )  e.  ( N " ( ~P ( Base `  W
)  i^i  Fin )
)  <->  E. b  e.  ( ~P ( Base `  W
)  i^i  Fin )
( N `  b
)  =  ( Base `  W ) ) )
2017, 18, 19sylancl 675 . . 3  |-  ( W  e.  LMod  ->  ( (
Base `  W )  e.  ( N " ( ~P ( Base `  W
)  i^i  Fin )
)  <->  E. b  e.  ( ~P ( Base `  W
)  i^i  Fin )
( N `  b
)  =  ( Base `  W ) ) )
21 elin 3608 . . . . . . 7  |-  ( b  e.  ( ~P ( Base `  W )  i^i 
Fin )  <->  ( b  e.  ~P ( Base `  W
)  /\  b  e.  Fin ) )
22 islmodfg.b . . . . . . . . . . 11  |-  B  =  ( Base `  W
)
2322eqcomi 2480 . . . . . . . . . 10  |-  ( Base `  W )  =  B
2423pweqi 3946 . . . . . . . . 9  |-  ~P ( Base `  W )  =  ~P B
2524eleq2i 2541 . . . . . . . 8  |-  ( b  e.  ~P ( Base `  W )  <->  b  e.  ~P B )
2625anbi1i 709 . . . . . . 7  |-  ( ( b  e.  ~P ( Base `  W )  /\  b  e.  Fin )  <->  ( b  e.  ~P B  /\  b  e.  Fin ) )
2721, 26bitri 257 . . . . . 6  |-  ( b  e.  ( ~P ( Base `  W )  i^i 
Fin )  <->  ( b  e.  ~P B  /\  b  e.  Fin ) )
2823eqeq2i 2483 . . . . . 6  |-  ( ( N `  b )  =  ( Base `  W
)  <->  ( N `  b )  =  B )
2927, 28anbi12i 711 . . . . 5  |-  ( ( b  e.  ( ~P ( Base `  W
)  i^i  Fin )  /\  ( N `  b
)  =  ( Base `  W ) )  <->  ( (
b  e.  ~P B  /\  b  e.  Fin )  /\  ( N `  b )  =  B ) )
30 anass 661 . . . . 5  |-  ( ( ( b  e.  ~P B  /\  b  e.  Fin )  /\  ( N `  b )  =  B )  <->  ( b  e. 
~P B  /\  (
b  e.  Fin  /\  ( N `  b )  =  B ) ) )
3129, 30bitri 257 . . . 4  |-  ( ( b  e.  ( ~P ( Base `  W
)  i^i  Fin )  /\  ( N `  b
)  =  ( Base `  W ) )  <->  ( b  e.  ~P B  /\  (
b  e.  Fin  /\  ( N `  b )  =  B ) ) )
3231rexbii2 2879 . . 3  |-  ( E. b  e.  ( ~P ( Base `  W
)  i^i  Fin )
( N `  b
)  =  ( Base `  W )  <->  E. b  e.  ~P  B ( b  e.  Fin  /\  ( N `  b )  =  B ) )
3320, 32syl6bb 269 . 2  |-  ( W  e.  LMod  ->  ( (
Base `  W )  e.  ( N " ( ~P ( Base `  W
)  i^i  Fin )
)  <->  E. b  e.  ~P  B ( b  e. 
Fin  /\  ( N `  b )  =  B ) ) )
3412, 33bitrd 261 1  |-  ( W  e.  LMod  ->  ( W  e. LFinGen 
<->  E. b  e.  ~P  B ( b  e. 
Fin  /\  ( N `  b )  =  B ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 189    /\ wa 376    = wceq 1452    e. wcel 1904   E.wrex 2757   {crab 2760    i^i cin 3389    C_ wss 3390   ~Pcpw 3942   "cima 4842    Fn wfn 5584   -->wf 5585   ` cfv 5589   Fincfn 7587   Basecbs 15199   LModclmod 18169   LSubSpclss 18233   LSpanclspn 18272  LFinGenclfig 35996
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1677  ax-4 1690  ax-5 1766  ax-6 1813  ax-7 1859  ax-8 1906  ax-9 1913  ax-10 1932  ax-11 1937  ax-12 1950  ax-13 2104  ax-ext 2451  ax-rep 4508  ax-sep 4518  ax-nul 4527  ax-pow 4579  ax-pr 4639  ax-un 6602  ax-cnex 9613  ax-resscn 9614  ax-1cn 9615  ax-icn 9616  ax-addcl 9617  ax-addrcl 9618  ax-mulcl 9619  ax-mulrcl 9620  ax-mulcom 9621  ax-addass 9622  ax-mulass 9623  ax-distr 9624  ax-i2m1 9625  ax-1ne0 9626  ax-1rid 9627  ax-rnegex 9628  ax-rrecex 9629  ax-cnre 9630  ax-pre-lttri 9631  ax-pre-lttrn 9632  ax-pre-ltadd 9633  ax-pre-mulgt0 9634
This theorem depends on definitions:  df-bi 190  df-or 377  df-an 378  df-3or 1008  df-3an 1009  df-tru 1455  df-ex 1672  df-nf 1676  df-sb 1806  df-eu 2323  df-mo 2324  df-clab 2458  df-cleq 2464  df-clel 2467  df-nfc 2601  df-ne 2643  df-nel 2644  df-ral 2761  df-rex 2762  df-reu 2763  df-rmo 2764  df-rab 2765  df-v 3033  df-sbc 3256  df-csb 3350  df-dif 3393  df-un 3395  df-in 3397  df-ss 3404  df-pss 3406  df-nul 3723  df-if 3873  df-pw 3944  df-sn 3960  df-pr 3962  df-tp 3964  df-op 3966  df-uni 4191  df-int 4227  df-iun 4271  df-br 4396  df-opab 4455  df-mpt 4456  df-tr 4491  df-eprel 4750  df-id 4754  df-po 4760  df-so 4761  df-fr 4798  df-we 4800  df-xp 4845  df-rel 4846  df-cnv 4847  df-co 4848  df-dm 4849  df-rn 4850  df-res 4851  df-ima 4852  df-pred 5387  df-ord 5433  df-on 5434  df-lim 5435  df-suc 5436  df-iota 5553  df-fun 5591  df-fn 5592  df-f 5593  df-f1 5594  df-fo 5595  df-f1o 5596  df-fv 5597  df-riota 6270  df-ov 6311  df-oprab 6312  df-mpt2 6313  df-om 6712  df-1st 6812  df-2nd 6813  df-wrecs 7046  df-recs 7108  df-rdg 7146  df-er 7381  df-en 7588  df-dom 7589  df-sdom 7590  df-pnf 9695  df-mnf 9696  df-xr 9697  df-ltxr 9698  df-le 9699  df-sub 9882  df-neg 9883  df-nn 10632  df-2 10690  df-ndx 15202  df-slot 15203  df-base 15204  df-sets 15205  df-plusg 15281  df-0g 15418  df-mgm 16566  df-sgrp 16605  df-mnd 16615  df-grp 16751  df-minusg 16752  df-sbg 16753  df-mgp 17802  df-ur 17814  df-ring 17860  df-lmod 18171  df-lss 18234  df-lsp 18273  df-lfig 35997
This theorem is referenced by:  islssfg  35999  lnrfg  36049
  Copyright terms: Public domain W3C validator