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

Theorem fidomndrnglem 18068
Description: Lemma for fidomndrng 18069. (Contributed by Mario Carneiro, 15-Jun-2015.)
Hypotheses
Ref Expression
fidomndrng.b  |-  B  =  ( Base `  R
)
fidomndrng.z  |-  .0.  =  ( 0g `  R )
fidomndrng.o  |-  .1.  =  ( 1r `  R )
fidomndrng.d  |-  .||  =  (
||r `  R )
fidomndrng.t  |-  .x.  =  ( .r `  R )
fidomndrng.r  |-  ( ph  ->  R  e. Domn )
fidomndrng.x  |-  ( ph  ->  B  e.  Fin )
fidomndrng.a  |-  ( ph  ->  A  e.  ( B 
\  {  .0.  }
) )
fidomndrng.f  |-  F  =  ( x  e.  B  |->  ( x  .x.  A
) )
Assertion
Ref Expression
fidomndrnglem  |-  ( ph  ->  A  .||  .1.  )
Distinct variable groups:    x, A    x, B    x, R    x,  .x.
Allowed substitution hints:    ph( x)    .|| ( x)    .1. ( x)    F( x)    .0. ( x)

Proof of Theorem fidomndrnglem
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 fidomndrng.a . . . 4  |-  ( ph  ->  A  e.  ( B 
\  {  .0.  }
) )
21eldifad 3401 . . 3  |-  ( ph  ->  A  e.  B )
3 eldifsni 4070 . . . . . . . . . . . 12  |-  ( A  e.  ( B  \  {  .0.  } )  ->  A  =/=  .0.  )
41, 3syl 16 . . . . . . . . . . 11  |-  ( ph  ->  A  =/=  .0.  )
54ad2antrr 723 . . . . . . . . . 10  |-  ( ( ( ph  /\  y  e.  B )  /\  ( F `  y )  =  .0.  )  ->  A  =/=  .0.  )
6 oveq1 6203 . . . . . . . . . . . . . . . . 17  |-  ( x  =  y  ->  (
x  .x.  A )  =  ( y  .x.  A ) )
7 fidomndrng.f . . . . . . . . . . . . . . . . 17  |-  F  =  ( x  e.  B  |->  ( x  .x.  A
) )
8 ovex 6224 . . . . . . . . . . . . . . . . 17  |-  ( y 
.x.  A )  e. 
_V
96, 7, 8fvmpt 5857 . . . . . . . . . . . . . . . 16  |-  ( y  e.  B  ->  ( F `  y )  =  ( y  .x.  A ) )
109adantl 464 . . . . . . . . . . . . . . 15  |-  ( (
ph  /\  y  e.  B )  ->  ( F `  y )  =  ( y  .x.  A ) )
1110eqeq1d 2384 . . . . . . . . . . . . . 14  |-  ( (
ph  /\  y  e.  B )  ->  (
( F `  y
)  =  .0.  <->  ( y  .x.  A )  =  .0.  ) )
12 fidomndrng.r . . . . . . . . . . . . . . . 16  |-  ( ph  ->  R  e. Domn )
1312adantr 463 . . . . . . . . . . . . . . 15  |-  ( (
ph  /\  y  e.  B )  ->  R  e. Domn )
14 simpr 459 . . . . . . . . . . . . . . 15  |-  ( (
ph  /\  y  e.  B )  ->  y  e.  B )
152adantr 463 . . . . . . . . . . . . . . 15  |-  ( (
ph  /\  y  e.  B )  ->  A  e.  B )
16 fidomndrng.b . . . . . . . . . . . . . . . 16  |-  B  =  ( Base `  R
)
17 fidomndrng.t . . . . . . . . . . . . . . . 16  |-  .x.  =  ( .r `  R )
18 fidomndrng.z . . . . . . . . . . . . . . . 16  |-  .0.  =  ( 0g `  R )
1916, 17, 18domneq0 18059 . . . . . . . . . . . . . . 15  |-  ( ( R  e. Domn  /\  y  e.  B  /\  A  e.  B )  ->  (
( y  .x.  A
)  =  .0.  <->  ( y  =  .0.  \/  A  =  .0.  ) ) )
2013, 14, 15, 19syl3anc 1226 . . . . . . . . . . . . . 14  |-  ( (
ph  /\  y  e.  B )  ->  (
( y  .x.  A
)  =  .0.  <->  ( y  =  .0.  \/  A  =  .0.  ) ) )
2111, 20bitrd 253 . . . . . . . . . . . . 13  |-  ( (
ph  /\  y  e.  B )  ->  (
( F `  y
)  =  .0.  <->  ( y  =  .0.  \/  A  =  .0.  ) ) )
2221biimpa 482 . . . . . . . . . . . 12  |-  ( ( ( ph  /\  y  e.  B )  /\  ( F `  y )  =  .0.  )  ->  (
y  =  .0.  \/  A  =  .0.  )
)
2322ord 375 . . . . . . . . . . 11  |-  ( ( ( ph  /\  y  e.  B )  /\  ( F `  y )  =  .0.  )  ->  ( -.  y  =  .0.  ->  A  =  .0.  )
)
2423necon1ad 2598 . . . . . . . . . 10  |-  ( ( ( ph  /\  y  e.  B )  /\  ( F `  y )  =  .0.  )  ->  ( A  =/=  .0.  ->  y  =  .0.  ) )
255, 24mpd 15 . . . . . . . . 9  |-  ( ( ( ph  /\  y  e.  B )  /\  ( F `  y )  =  .0.  )  ->  y  =  .0.  )
2625ex 432 . . . . . . . 8  |-  ( (
ph  /\  y  e.  B )  ->  (
( F `  y
)  =  .0.  ->  y  =  .0.  ) )
2726ralrimiva 2796 . . . . . . 7  |-  ( ph  ->  A. y  e.  B  ( ( F `  y )  =  .0. 
->  y  =  .0.  ) )
28 domnring 18058 . . . . . . . . . . 11  |-  ( R  e. Domn  ->  R  e.  Ring )
2912, 28syl 16 . . . . . . . . . 10  |-  ( ph  ->  R  e.  Ring )
3016, 17ringrghm 17364 . . . . . . . . . 10  |-  ( ( R  e.  Ring  /\  A  e.  B )  ->  (
x  e.  B  |->  ( x  .x.  A ) )  e.  ( R 
GrpHom  R ) )
3129, 2, 30syl2anc 659 . . . . . . . . 9  |-  ( ph  ->  ( x  e.  B  |->  ( x  .x.  A
) )  e.  ( R  GrpHom  R ) )
327, 31syl5eqel 2474 . . . . . . . 8  |-  ( ph  ->  F  e.  ( R 
GrpHom  R ) )
3316, 16, 18, 18ghmf1 16412 . . . . . . . 8  |-  ( F  e.  ( R  GrpHom  R )  ->  ( F : B -1-1-> B  <->  A. y  e.  B  ( ( F `  y )  =  .0. 
->  y  =  .0.  ) ) )
3432, 33syl 16 . . . . . . 7  |-  ( ph  ->  ( F : B -1-1-> B  <->  A. y  e.  B  ( ( F `  y )  =  .0. 
->  y  =  .0.  ) ) )
3527, 34mpbird 232 . . . . . 6  |-  ( ph  ->  F : B -1-1-> B
)
36 fidomndrng.x . . . . . . . 8  |-  ( ph  ->  B  e.  Fin )
37 enrefg 7466 . . . . . . . 8  |-  ( B  e.  Fin  ->  B  ~~  B )
3836, 37syl 16 . . . . . . 7  |-  ( ph  ->  B  ~~  B )
39 f1finf1o 7662 . . . . . . 7  |-  ( ( B  ~~  B  /\  B  e.  Fin )  ->  ( F : B -1-1-> B  <-> 
F : B -1-1-onto-> B ) )
4038, 36, 39syl2anc 659 . . . . . 6  |-  ( ph  ->  ( F : B -1-1-> B  <-> 
F : B -1-1-onto-> B ) )
4135, 40mpbid 210 . . . . 5  |-  ( ph  ->  F : B -1-1-onto-> B )
42 f1ocnv 5736 . . . . 5  |-  ( F : B -1-1-onto-> B  ->  `' F : B -1-1-onto-> B )
43 f1of 5724 . . . . 5  |-  ( `' F : B -1-1-onto-> B  ->  `' F : B --> B )
4441, 42, 433syl 20 . . . 4  |-  ( ph  ->  `' F : B --> B )
45 fidomndrng.o . . . . . 6  |-  .1.  =  ( 1r `  R )
4616, 45ringidcl 17332 . . . . 5  |-  ( R  e.  Ring  ->  .1.  e.  B )
4729, 46syl 16 . . . 4  |-  ( ph  ->  .1.  e.  B )
4844, 47ffvelrnd 5934 . . 3  |-  ( ph  ->  ( `' F `  .1.  )  e.  B
)
49 fidomndrng.d . . . 4  |-  .||  =  (
||r `  R )
5016, 49, 17dvdsrmul 17410 . . 3  |-  ( ( A  e.  B  /\  ( `' F `  .1.  )  e.  B )  ->  A  .||  ( ( `' F `  .1.  )  .x.  A
) )
512, 48, 50syl2anc 659 . 2  |-  ( ph  ->  A  .||  ( ( `' F `  .1.  )  .x.  A ) )
52 oveq1 6203 . . . . 5  |-  ( y  =  ( `' F `  .1.  )  ->  (
y  .x.  A )  =  ( ( `' F `  .1.  )  .x.  A ) )
536cbvmptv 4458 . . . . . 6  |-  ( x  e.  B  |->  ( x 
.x.  A ) )  =  ( y  e.  B  |->  ( y  .x.  A ) )
547, 53eqtri 2411 . . . . 5  |-  F  =  ( y  e.  B  |->  ( y  .x.  A
) )
55 ovex 6224 . . . . 5  |-  ( ( `' F `  .1.  )  .x.  A )  e.  _V
5652, 54, 55fvmpt 5857 . . . 4  |-  ( ( `' F `  .1.  )  e.  B  ->  ( F `
 ( `' F `  .1.  ) )  =  ( ( `' F `  .1.  )  .x.  A
) )
5748, 56syl 16 . . 3  |-  ( ph  ->  ( F `  ( `' F `  .1.  )
)  =  ( ( `' F `  .1.  )  .x.  A ) )
58 f1ocnvfv2 6084 . . . 4  |-  ( ( F : B -1-1-onto-> B  /\  .1.  e.  B )  -> 
( F `  ( `' F `  .1.  )
)  =  .1.  )
5941, 47, 58syl2anc 659 . . 3  |-  ( ph  ->  ( F `  ( `' F `  .1.  )
)  =  .1.  )
6057, 59eqtr3d 2425 . 2  |-  ( ph  ->  ( ( `' F `  .1.  )  .x.  A
)  =  .1.  )
6151, 60breqtrd 4391 1  |-  ( ph  ->  A  .||  .1.  )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    \/ wo 366    /\ wa 367    = wceq 1399    e. wcel 1826    =/= wne 2577   A.wral 2732    \ cdif 3386   {csn 3944   class class class wbr 4367    |-> cmpt 4425   `'ccnv 4912   -->wf 5492   -1-1->wf1 5493   -1-1-onto->wf1o 5495   ` cfv 5496  (class class class)co 6196    ~~ cen 7432   Fincfn 7435   Basecbs 14634   .rcmulr 14703   0gc0g 14847    GrpHom cghm 16381   1rcur 17266   Ringcrg 17311   ||rcdsr 17400  Domncdomn 18041
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1626  ax-4 1639  ax-5 1712  ax-6 1755  ax-7 1798  ax-8 1828  ax-9 1830  ax-10 1845  ax-11 1850  ax-12 1862  ax-13 2006  ax-ext 2360  ax-rep 4478  ax-sep 4488  ax-nul 4496  ax-pow 4543  ax-pr 4601  ax-un 6491  ax-cnex 9459  ax-resscn 9460  ax-1cn 9461  ax-icn 9462  ax-addcl 9463  ax-addrcl 9464  ax-mulcl 9465  ax-mulrcl 9466  ax-mulcom 9467  ax-addass 9468  ax-mulass 9469  ax-distr 9470  ax-i2m1 9471  ax-1ne0 9472  ax-1rid 9473  ax-rnegex 9474  ax-rrecex 9475  ax-cnre 9476  ax-pre-lttri 9477  ax-pre-lttrn 9478  ax-pre-ltadd 9479  ax-pre-mulgt0 9480
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3or 972  df-3an 973  df-tru 1402  df-ex 1621  df-nf 1625  df-sb 1748  df-eu 2222  df-mo 2223  df-clab 2368  df-cleq 2374  df-clel 2377  df-nfc 2532  df-ne 2579  df-nel 2580  df-ral 2737  df-rex 2738  df-reu 2739  df-rmo 2740  df-rab 2741  df-v 3036  df-sbc 3253  df-csb 3349  df-dif 3392  df-un 3394  df-in 3396  df-ss 3403  df-pss 3405  df-nul 3712  df-if 3858  df-pw 3929  df-sn 3945  df-pr 3947  df-tp 3949  df-op 3951  df-uni 4164  df-iun 4245  df-br 4368  df-opab 4426  df-mpt 4427  df-tr 4461  df-eprel 4705  df-id 4709  df-po 4714  df-so 4715  df-fr 4752  df-we 4754  df-ord 4795  df-on 4796  df-lim 4797  df-suc 4798  df-xp 4919  df-rel 4920  df-cnv 4921  df-co 4922  df-dm 4923  df-rn 4924  df-res 4925  df-ima 4926  df-iota 5460  df-fun 5498  df-fn 5499  df-f 5500  df-f1 5501  df-fo 5502  df-f1o 5503  df-fv 5504  df-riota 6158  df-ov 6199  df-oprab 6200  df-mpt2 6201  df-om 6600  df-1st 6699  df-2nd 6700  df-recs 6960  df-rdg 6994  df-er 7229  df-map 7340  df-en 7436  df-dom 7437  df-sdom 7438  df-fin 7439  df-pnf 9541  df-mnf 9542  df-xr 9543  df-ltxr 9544  df-le 9545  df-sub 9720  df-neg 9721  df-nn 10453  df-2 10511  df-ndx 14637  df-slot 14638  df-base 14639  df-sets 14640  df-plusg 14715  df-0g 14849  df-mgm 15989  df-sgrp 16028  df-mnd 16038  df-grp 16174  df-minusg 16175  df-sbg 16176  df-ghm 16382  df-mgp 17255  df-ur 17267  df-ring 17313  df-dvdsr 17403  df-nzr 18019  df-domn 18045
This theorem is referenced by:  fidomndrng  18069
  Copyright terms: Public domain W3C validator