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

Theorem abv1z 16840
Description: The absolute value of one is one in a non-trivial ring. (Contributed by Mario Carneiro, 8-Sep-2014.)
Hypotheses
Ref Expression
abv0.a  |-  A  =  (AbsVal `  R )
abv1.p  |-  .1.  =  ( 1r `  R )
abv1z.z  |-  .0.  =  ( 0g `  R )
Assertion
Ref Expression
abv1z  |-  ( ( F  e.  A  /\  .1.  =/=  .0.  )  -> 
( F `  .1.  )  =  1 )

Proof of Theorem abv1z
StepHypRef Expression
1 abv0.a . . . . . . . 8  |-  A  =  (AbsVal `  R )
21abvrcl 16829 . . . . . . 7  |-  ( F  e.  A  ->  R  e.  Ring )
3 eqid 2433 . . . . . . . 8  |-  ( Base `  R )  =  (
Base `  R )
4 abv1.p . . . . . . . 8  |-  .1.  =  ( 1r `  R )
53, 4rngidcl 16600 . . . . . . 7  |-  ( R  e.  Ring  ->  .1.  e.  ( Base `  R )
)
62, 5syl 16 . . . . . 6  |-  ( F  e.  A  ->  .1.  e.  ( Base `  R
) )
71, 3abvcl 16832 . . . . . 6  |-  ( ( F  e.  A  /\  .1.  e.  ( Base `  R
) )  ->  ( F `  .1.  )  e.  RR )
86, 7mpdan 661 . . . . 5  |-  ( F  e.  A  ->  ( F `  .1.  )  e.  RR )
98adantr 462 . . . 4  |-  ( ( F  e.  A  /\  .1.  =/=  .0.  )  -> 
( F `  .1.  )  e.  RR )
109recnd 9399 . . 3  |-  ( ( F  e.  A  /\  .1.  =/=  .0.  )  -> 
( F `  .1.  )  e.  CC )
11 simpl 454 . . . 4  |-  ( ( F  e.  A  /\  .1.  =/=  .0.  )  ->  F  e.  A )
126adantr 462 . . . 4  |-  ( ( F  e.  A  /\  .1.  =/=  .0.  )  ->  .1.  e.  ( Base `  R
) )
13 simpr 458 . . . 4  |-  ( ( F  e.  A  /\  .1.  =/=  .0.  )  ->  .1.  =/=  .0.  )
14 abv1z.z . . . . 5  |-  .0.  =  ( 0g `  R )
151, 3, 14abvne0 16835 . . . 4  |-  ( ( F  e.  A  /\  .1.  e.  ( Base `  R
)  /\  .1.  =/=  .0.  )  ->  ( F `
 .1.  )  =/=  0 )
1611, 12, 13, 15syl3anc 1211 . . 3  |-  ( ( F  e.  A  /\  .1.  =/=  .0.  )  -> 
( F `  .1.  )  =/=  0 )
1710, 10, 16divcan3d 10099 . 2  |-  ( ( F  e.  A  /\  .1.  =/=  .0.  )  -> 
( ( ( F `
 .1.  )  x.  ( F `  .1.  ) )  /  ( F `  .1.  ) )  =  ( F `  .1.  ) )
182adantr 462 . . . . . . 7  |-  ( ( F  e.  A  /\  .1.  =/=  .0.  )  ->  R  e.  Ring )
19 eqid 2433 . . . . . . . 8  |-  ( .r
`  R )  =  ( .r `  R
)
203, 19, 4rnglidm 16603 . . . . . . 7  |-  ( ( R  e.  Ring  /\  .1.  e.  ( Base `  R
) )  ->  (  .1.  ( .r `  R
)  .1.  )  =  .1.  )
2118, 12, 20syl2anc 654 . . . . . 6  |-  ( ( F  e.  A  /\  .1.  =/=  .0.  )  -> 
(  .1.  ( .r
`  R )  .1.  )  =  .1.  )
2221fveq2d 5683 . . . . 5  |-  ( ( F  e.  A  /\  .1.  =/=  .0.  )  -> 
( F `  (  .1.  ( .r `  R
)  .1.  ) )  =  ( F `  .1.  ) )
231, 3, 19abvmul 16837 . . . . . 6  |-  ( ( F  e.  A  /\  .1.  e.  ( Base `  R
)  /\  .1.  e.  ( Base `  R )
)  ->  ( F `  (  .1.  ( .r `  R )  .1.  ) )  =  ( ( F `  .1.  )  x.  ( F `  .1.  ) ) )
2411, 12, 12, 23syl3anc 1211 . . . . 5  |-  ( ( F  e.  A  /\  .1.  =/=  .0.  )  -> 
( F `  (  .1.  ( .r `  R
)  .1.  ) )  =  ( ( F `
 .1.  )  x.  ( F `  .1.  ) ) )
2522, 24eqtr3d 2467 . . . 4  |-  ( ( F  e.  A  /\  .1.  =/=  .0.  )  -> 
( F `  .1.  )  =  ( ( F `  .1.  )  x.  ( F `  .1.  ) ) )
2625oveq1d 6095 . . 3  |-  ( ( F  e.  A  /\  .1.  =/=  .0.  )  -> 
( ( F `  .1.  )  /  ( F `  .1.  ) )  =  ( ( ( F `  .1.  )  x.  ( F `  .1.  ) )  /  ( F `  .1.  ) ) )
2710, 16dividd 10092 . . 3  |-  ( ( F  e.  A  /\  .1.  =/=  .0.  )  -> 
( ( F `  .1.  )  /  ( F `  .1.  ) )  =  1 )
2826, 27eqtr3d 2467 . 2  |-  ( ( F  e.  A  /\  .1.  =/=  .0.  )  -> 
( ( ( F `
 .1.  )  x.  ( F `  .1.  ) )  /  ( F `  .1.  ) )  =  1 )
2917, 28eqtr3d 2467 1  |-  ( ( F  e.  A  /\  .1.  =/=  .0.  )  -> 
( F `  .1.  )  =  1 )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    = wceq 1362    e. wcel 1755    =/= wne 2596   ` cfv 5406  (class class class)co 6080   RRcr 9268   0cc0 9269   1c1 9270    x. cmul 9274    / cdiv 9980   Basecbs 14156   .rcmulr 14221   0gc0g 14360   Ringcrg 16576   1rcur 16578  AbsValcabv 16824
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1594  ax-4 1605  ax-5 1669  ax-6 1707  ax-7 1727  ax-8 1757  ax-9 1759  ax-10 1774  ax-11 1779  ax-12 1791  ax-13 1942  ax-ext 2414  ax-sep 4401  ax-nul 4409  ax-pow 4458  ax-pr 4519  ax-un 6361  ax-cnex 9325  ax-resscn 9326  ax-1cn 9327  ax-icn 9328  ax-addcl 9329  ax-addrcl 9330  ax-mulcl 9331  ax-mulrcl 9332  ax-mulcom 9333  ax-addass 9334  ax-mulass 9335  ax-distr 9336  ax-i2m1 9337  ax-1ne0 9338  ax-1rid 9339  ax-rnegex 9340  ax-rrecex 9341  ax-cnre 9342  ax-pre-lttri 9343  ax-pre-lttrn 9344  ax-pre-ltadd 9345  ax-pre-mulgt0 9346
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 959  df-3an 960  df-tru 1365  df-ex 1590  df-nf 1593  df-sb 1700  df-eu 2258  df-mo 2259  df-clab 2420  df-cleq 2426  df-clel 2429  df-nfc 2558  df-ne 2598  df-nel 2599  df-ral 2710  df-rex 2711  df-reu 2712  df-rmo 2713  df-rab 2714  df-v 2964  df-sbc 3176  df-csb 3277  df-dif 3319  df-un 3321  df-in 3323  df-ss 3330  df-pss 3332  df-nul 3626  df-if 3780  df-pw 3850  df-sn 3866  df-pr 3868  df-tp 3870  df-op 3872  df-uni 4080  df-iun 4161  df-br 4281  df-opab 4339  df-mpt 4340  df-tr 4374  df-eprel 4619  df-id 4623  df-po 4628  df-so 4629  df-fr 4666  df-we 4668  df-ord 4709  df-on 4710  df-lim 4711  df-suc 4712  df-xp 4833  df-rel 4834  df-cnv 4835  df-co 4836  df-dm 4837  df-rn 4838  df-res 4839  df-ima 4840  df-iota 5369  df-fun 5408  df-fn 5409  df-f 5410  df-f1 5411  df-fo 5412  df-f1o 5413  df-fv 5414  df-riota 6039  df-ov 6083  df-oprab 6084  df-mpt2 6085  df-om 6466  df-recs 6818  df-rdg 6852  df-er 7089  df-map 7204  df-en 7299  df-dom 7300  df-sdom 7301  df-pnf 9407  df-mnf 9408  df-xr 9409  df-ltxr 9410  df-le 9411  df-sub 9584  df-neg 9585  df-div 9981  df-nn 10310  df-2 10367  df-ico 11293  df-ndx 14159  df-slot 14160  df-base 14161  df-sets 14162  df-plusg 14233  df-0g 14362  df-mnd 15397  df-mgp 16565  df-rng 16579  df-ur 16581  df-abv 16825
This theorem is referenced by:  abv1  16841  abvneg  16842  nm1  20089  qabvle  22758  qabvexp  22759  ostthlem2  22761  ostth3  22771  ostth  22772
  Copyright terms: Public domain W3C validator