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

Theorem ring1eq0 13680
Description: If one and zero are equal, then any two elements of a ring are equal. Alternately, every ring has one distinct from zero except the zero ring containing the single element  { 0 }. (Contributed by Mario Carneiro, 10-Sep-2014.)
Hypotheses
Ref Expression
ring1eq0.b  |-  B  =  ( Base `  R
)
ring1eq0.u  |-  .1.  =  ( 1r `  R )
ring1eq0.z  |-  .0.  =  ( 0g `  R )
Assertion
Ref Expression
ring1eq0  |-  ( ( R  e.  Ring  /\  X  e.  B  /\  Y  e.  B )  ->  (  .1.  =  .0.  ->  X  =  Y ) )

Proof of Theorem ring1eq0
StepHypRef Expression
1 simpr 110 . . . . 5  |-  ( ( ( R  e.  Ring  /\  X  e.  B  /\  Y  e.  B )  /\  .1.  =  .0.  )  ->  .1.  =  .0.  )
21oveq1d 5940 . . . 4  |-  ( ( ( R  e.  Ring  /\  X  e.  B  /\  Y  e.  B )  /\  .1.  =  .0.  )  ->  (  .1.  ( .r
`  R ) X )  =  (  .0.  ( .r `  R
) X ) )
31oveq1d 5940 . . . . 5  |-  ( ( ( R  e.  Ring  /\  X  e.  B  /\  Y  e.  B )  /\  .1.  =  .0.  )  ->  (  .1.  ( .r
`  R ) Y )  =  (  .0.  ( .r `  R
) Y ) )
4 simpl1 1002 . . . . . . 7  |-  ( ( ( R  e.  Ring  /\  X  e.  B  /\  Y  e.  B )  /\  .1.  =  .0.  )  ->  R  e.  Ring )
5 simpl2 1003 . . . . . . 7  |-  ( ( ( R  e.  Ring  /\  X  e.  B  /\  Y  e.  B )  /\  .1.  =  .0.  )  ->  X  e.  B )
6 ring1eq0.b . . . . . . . 8  |-  B  =  ( Base `  R
)
7 eqid 2196 . . . . . . . 8  |-  ( .r
`  R )  =  ( .r `  R
)
8 ring1eq0.z . . . . . . . 8  |-  .0.  =  ( 0g `  R )
96, 7, 8ringlz 13675 . . . . . . 7  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  (  .0.  ( .r `  R
) X )  =  .0.  )
104, 5, 9syl2anc 411 . . . . . 6  |-  ( ( ( R  e.  Ring  /\  X  e.  B  /\  Y  e.  B )  /\  .1.  =  .0.  )  ->  (  .0.  ( .r
`  R ) X )  =  .0.  )
11 simpl3 1004 . . . . . . 7  |-  ( ( ( R  e.  Ring  /\  X  e.  B  /\  Y  e.  B )  /\  .1.  =  .0.  )  ->  Y  e.  B )
126, 7, 8ringlz 13675 . . . . . . 7  |-  ( ( R  e.  Ring  /\  Y  e.  B )  ->  (  .0.  ( .r `  R
) Y )  =  .0.  )
134, 11, 12syl2anc 411 . . . . . 6  |-  ( ( ( R  e.  Ring  /\  X  e.  B  /\  Y  e.  B )  /\  .1.  =  .0.  )  ->  (  .0.  ( .r
`  R ) Y )  =  .0.  )
1410, 13eqtr4d 2232 . . . . 5  |-  ( ( ( R  e.  Ring  /\  X  e.  B  /\  Y  e.  B )  /\  .1.  =  .0.  )  ->  (  .0.  ( .r
`  R ) X )  =  (  .0.  ( .r `  R
) Y ) )
153, 14eqtr4d 2232 . . . 4  |-  ( ( ( R  e.  Ring  /\  X  e.  B  /\  Y  e.  B )  /\  .1.  =  .0.  )  ->  (  .1.  ( .r
`  R ) Y )  =  (  .0.  ( .r `  R
) X ) )
162, 15eqtr4d 2232 . . 3  |-  ( ( ( R  e.  Ring  /\  X  e.  B  /\  Y  e.  B )  /\  .1.  =  .0.  )  ->  (  .1.  ( .r
`  R ) X )  =  (  .1.  ( .r `  R
) Y ) )
17 ring1eq0.u . . . . 5  |-  .1.  =  ( 1r `  R )
186, 7, 17ringlidm 13655 . . . 4  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  (  .1.  ( .r `  R
) X )  =  X )
194, 5, 18syl2anc 411 . . 3  |-  ( ( ( R  e.  Ring  /\  X  e.  B  /\  Y  e.  B )  /\  .1.  =  .0.  )  ->  (  .1.  ( .r
`  R ) X )  =  X )
206, 7, 17ringlidm 13655 . . . 4  |-  ( ( R  e.  Ring  /\  Y  e.  B )  ->  (  .1.  ( .r `  R
) Y )  =  Y )
214, 11, 20syl2anc 411 . . 3  |-  ( ( ( R  e.  Ring  /\  X  e.  B  /\  Y  e.  B )  /\  .1.  =  .0.  )  ->  (  .1.  ( .r
`  R ) Y )  =  Y )
2216, 19, 213eqtr3d 2237 . 2  |-  ( ( ( R  e.  Ring  /\  X  e.  B  /\  Y  e.  B )  /\  .1.  =  .0.  )  ->  X  =  Y )
2322ex 115 1  |-  ( ( R  e.  Ring  /\  X  e.  B  /\  Y  e.  B )  ->  (  .1.  =  .0.  ->  X  =  Y ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 980    = wceq 1364    e. wcel 2167   ` cfv 5259  (class class class)co 5925   Basecbs 12703   .rcmulr 12781   0gc0g 12958   1rcur 13591   Ringcrg 13628
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-addass 7998  ax-i2m1 8001  ax-0lt1 8002  ax-0id 8004  ax-rnegex 8005  ax-pre-ltirr 8008  ax-pre-ltadd 8012
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-pnf 8080  df-mnf 8081  df-ltxr 8083  df-inn 9008  df-2 9066  df-3 9067  df-ndx 12706  df-slot 12707  df-base 12709  df-sets 12710  df-plusg 12793  df-mulr 12794  df-0g 12960  df-mgm 13058  df-sgrp 13104  df-mnd 13119  df-grp 13205  df-minusg 13206  df-mgp 13553  df-ur 13592  df-ring 13630
This theorem is referenced by:  isnzr2  13816  ringelnzr  13819  01eq0ring  13821
  Copyright terms: Public domain W3C validator