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

Theorem rrgeq0i 14574
Description: Property of a left-regular element. (Contributed by Stefan O'Rear, 22-Mar-2015.)
Hypotheses
Ref Expression
rrgval.e  |-  E  =  (RLReg `  R )
rrgval.b  |-  B  =  ( Base `  R
)
rrgval.t  |-  .x.  =  ( .r `  R )
rrgval.z  |-  .0.  =  ( 0g `  R )
Assertion
Ref Expression
rrgeq0i  |-  ( ( X  e.  E  /\  Y  e.  B )  ->  ( ( X  .x.  Y )  =  .0. 
->  Y  =  .0.  ) )

Proof of Theorem rrgeq0i
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 rrgval.e . . . 4  |-  E  =  (RLReg `  R )
2 rrgval.b . . . 4  |-  B  =  ( Base `  R
)
3 rrgval.t . . . 4  |-  .x.  =  ( .r `  R )
4 rrgval.z . . . 4  |-  .0.  =  ( 0g `  R )
51, 2, 3, 4isrrg 14573 . . 3  |-  ( X  e.  E  <->  ( X  e.  B  /\  A. y  e.  B  ( ( X  .x.  y )  =  .0.  ->  y  =  .0.  ) ) )
65simprbi 275 . 2  |-  ( X  e.  E  ->  A. y  e.  B  ( ( X  .x.  y )  =  .0.  ->  y  =  .0.  ) )
7 oveq2 6093 . . . . 5  |-  ( y  =  Y  ->  ( X  .x.  y )  =  ( X  .x.  Y
) )
87eqeq1d 2247 . . . 4  |-  ( y  =  Y  ->  (
( X  .x.  y
)  =  .0.  <->  ( X  .x.  Y )  =  .0.  ) )
9 eqeq1 2245 . . . 4  |-  ( y  =  Y  ->  (
y  =  .0.  <->  Y  =  .0.  ) )
108, 9imbi12d 234 . . 3  |-  ( y  =  Y  ->  (
( ( X  .x.  y )  =  .0. 
->  y  =  .0.  ) 
<->  ( ( X  .x.  Y )  =  .0. 
->  Y  =  .0.  ) ) )
1110rspcv 2925 . 2  |-  ( Y  e.  B  ->  ( A. y  e.  B  ( ( X  .x.  y )  =  .0. 
->  y  =  .0.  )  ->  ( ( X 
.x.  Y )  =  .0.  ->  Y  =  .0.  ) ) )
126, 11mpan9 281 1  |-  ( ( X  e.  E  /\  Y  e.  B )  ->  ( ( X  .x.  Y )  =  .0. 
->  Y  =  .0.  ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   A.wral 2528   ` cfv 5377  (class class class)co 6085   Basecbs 13354   .rcmulr 13434   0gc0g 13612  RLRegcrlreg 14565
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  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-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  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-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-ov 6088  df-inn 9306  df-ndx 13357  df-slot 13358  df-base 13360  df-rlreg 14568
This theorem is used by:  rrgeq0  14575  znrrg  14997
  Copyright terms: Public domain W3C validator