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

Theorem reldvdsrsrg 14050
Description: The divides relation is a relation. (Contributed by Mario Carneiro, 1-Dec-2014.) (Revised by Jim Kingdon, 24-Jan-2025.)
Assertion
Ref Expression
reldvdsrsrg  |-  ( R  e. SRing  ->  Rel  ( ||r `  R
) )

Proof of Theorem reldvdsrsrg
Dummy variables  x  w  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-dvdsr 14047 . . . . 5  |-  ||r  =  (
w  e.  _V  |->  {
<. x ,  y >.  |  ( x  e.  ( Base `  w
)  /\  E. z  e.  ( Base `  w
) ( z ( .r `  w ) x )  =  y ) } )
2 fveq2 5626 . . . . . . . 8  |-  ( w  =  R  ->  ( Base `  w )  =  ( Base `  R
) )
32eleq2d 2299 . . . . . . 7  |-  ( w  =  R  ->  (
x  e.  ( Base `  w )  <->  x  e.  ( Base `  R )
) )
4 fveq2 5626 . . . . . . . . . 10  |-  ( w  =  R  ->  ( .r `  w )  =  ( .r `  R
) )
54oveqd 6017 . . . . . . . . 9  |-  ( w  =  R  ->  (
z ( .r `  w ) x )  =  ( z ( .r `  R ) x ) )
65eqeq1d 2238 . . . . . . . 8  |-  ( w  =  R  ->  (
( z ( .r
`  w ) x )  =  y  <->  ( z
( .r `  R
) x )  =  y ) )
72, 6rexeqbidv 2745 . . . . . . 7  |-  ( w  =  R  ->  ( E. z  e.  ( Base `  w ) ( z ( .r `  w ) x )  =  y  <->  E. z  e.  ( Base `  R
) ( z ( .r `  R ) x )  =  y ) )
83, 7anbi12d 473 . . . . . 6  |-  ( w  =  R  ->  (
( x  e.  (
Base `  w )  /\  E. z  e.  (
Base `  w )
( z ( .r
`  w ) x )  =  y )  <-> 
( x  e.  (
Base `  R )  /\  E. z  e.  (
Base `  R )
( z ( .r
`  R ) x )  =  y ) ) )
98opabbidv 4149 . . . . 5  |-  ( w  =  R  ->  { <. x ,  y >.  |  ( x  e.  ( Base `  w )  /\  E. z  e.  ( Base `  w ) ( z ( .r `  w
) x )  =  y ) }  =  { <. x ,  y
>.  |  ( x  e.  ( Base `  R
)  /\  E. z  e.  ( Base `  R
) ( z ( .r `  R ) x )  =  y ) } )
10 elex 2811 . . . . 5  |-  ( R  e. SRing  ->  R  e.  _V )
11 basfn 13086 . . . . . . . 8  |-  Base  Fn  _V
12 funfvex 5643 . . . . . . . . 9  |-  ( ( Fun  Base  /\  R  e. 
dom  Base )  ->  ( Base `  R )  e. 
_V )
1312funfni 5422 . . . . . . . 8  |-  ( (
Base  Fn  _V  /\  R  e.  _V )  ->  ( Base `  R )  e. 
_V )
1411, 10, 13sylancr 414 . . . . . . 7  |-  ( R  e. SRing  ->  ( Base `  R
)  e.  _V )
15 xpexg 4832 . . . . . . 7  |-  ( ( ( Base `  R
)  e.  _V  /\  ( Base `  R )  e.  _V )  ->  (
( Base `  R )  X.  ( Base `  R
) )  e.  _V )
1614, 14, 15syl2anc 411 . . . . . 6  |-  ( R  e. SRing  ->  ( ( Base `  R )  X.  ( Base `  R ) )  e.  _V )
17 simpr 110 . . . . . . . . . . 11  |-  ( ( ( ( R  e. SRing  /\  x  e.  ( Base `  R ) )  /\  z  e.  (
Base `  R )
)  /\  ( z
( .r `  R
) x )  =  y )  ->  (
z ( .r `  R ) x )  =  y )
18 simplll 533 . . . . . . . . . . . 12  |-  ( ( ( ( R  e. SRing  /\  x  e.  ( Base `  R ) )  /\  z  e.  (
Base `  R )
)  /\  ( z
( .r `  R
) x )  =  y )  ->  R  e. SRing )
19 simplr 528 . . . . . . . . . . . 12  |-  ( ( ( ( R  e. SRing  /\  x  e.  ( Base `  R ) )  /\  z  e.  (
Base `  R )
)  /\  ( z
( .r `  R
) x )  =  y )  ->  z  e.  ( Base `  R
) )
20 simpllr 534 . . . . . . . . . . . 12  |-  ( ( ( ( R  e. SRing  /\  x  e.  ( Base `  R ) )  /\  z  e.  (
Base `  R )
)  /\  ( z
( .r `  R
) x )  =  y )  ->  x  e.  ( Base `  R
) )
21 eqid 2229 . . . . . . . . . . . . 13  |-  ( Base `  R )  =  (
Base `  R )
22 eqid 2229 . . . . . . . . . . . . 13  |-  ( .r
`  R )  =  ( .r `  R
)
2321, 22srgcl 13928 . . . . . . . . . . . 12  |-  ( ( R  e. SRing  /\  z  e.  ( Base `  R
)  /\  x  e.  ( Base `  R )
)  ->  ( z
( .r `  R
) x )  e.  ( Base `  R
) )
2418, 19, 20, 23syl3anc 1271 . . . . . . . . . . 11  |-  ( ( ( ( R  e. SRing  /\  x  e.  ( Base `  R ) )  /\  z  e.  (
Base `  R )
)  /\  ( z
( .r `  R
) x )  =  y )  ->  (
z ( .r `  R ) x )  e.  ( Base `  R
) )
2517, 24eqeltrrd 2307 . . . . . . . . . 10  |-  ( ( ( ( R  e. SRing  /\  x  e.  ( Base `  R ) )  /\  z  e.  (
Base `  R )
)  /\  ( z
( .r `  R
) x )  =  y )  ->  y  e.  ( Base `  R
) )
2625rexlimdva2 2651 . . . . . . . . 9  |-  ( ( R  e. SRing  /\  x  e.  ( Base `  R
) )  ->  ( E. z  e.  ( Base `  R ) ( z ( .r `  R ) x )  =  y  ->  y  e.  ( Base `  R
) ) )
2726imdistanda 448 . . . . . . . 8  |-  ( R  e. SRing  ->  ( ( x  e.  ( Base `  R
)  /\  E. z  e.  ( Base `  R
) ( z ( .r `  R ) x )  =  y )  ->  ( x  e.  ( Base `  R
)  /\  y  e.  ( Base `  R )
) ) )
2827ssopab2dv 4366 . . . . . . 7  |-  ( R  e. SRing  ->  { <. x ,  y >.  |  ( x  e.  ( Base `  R )  /\  E. z  e.  ( Base `  R ) ( z ( .r `  R
) x )  =  y ) }  C_  {
<. x ,  y >.  |  ( x  e.  ( Base `  R
)  /\  y  e.  ( Base `  R )
) } )
29 df-xp 4724 . . . . . . 7  |-  ( (
Base `  R )  X.  ( Base `  R
) )  =  { <. x ,  y >.  |  ( x  e.  ( Base `  R
)  /\  y  e.  ( Base `  R )
) }
3028, 29sseqtrrdi 3273 . . . . . 6  |-  ( R  e. SRing  ->  { <. x ,  y >.  |  ( x  e.  ( Base `  R )  /\  E. z  e.  ( Base `  R ) ( z ( .r `  R
) x )  =  y ) }  C_  ( ( Base `  R
)  X.  ( Base `  R ) ) )
3116, 30ssexd 4223 . . . . 5  |-  ( R  e. SRing  ->  { <. x ,  y >.  |  ( x  e.  ( Base `  R )  /\  E. z  e.  ( Base `  R ) ( z ( .r `  R
) x )  =  y ) }  e.  _V )
321, 9, 10, 31fvmptd3 5727 . . . 4  |-  ( R  e. SRing  ->  ( ||r `
 R )  =  { <. x ,  y
>.  |  ( x  e.  ( Base `  R
)  /\  E. z  e.  ( Base `  R
) ( z ( .r `  R ) x )  =  y ) } )
3332, 30eqsstrd 3260 . . 3  |-  ( R  e. SRing  ->  ( ||r `
 R )  C_  ( ( Base `  R
)  X.  ( Base `  R ) ) )
34 xpss 4826 . . 3  |-  ( (
Base `  R )  X.  ( Base `  R
) )  C_  ( _V  X.  _V )
3533, 34sstrdi 3236 . 2  |-  ( R  e. SRing  ->  ( ||r `
 R )  C_  ( _V  X.  _V )
)
36 df-rel 4725 . 2  |-  ( Rel  ( ||r `
 R )  <->  ( ||r `  R
)  C_  ( _V  X.  _V ) )
3735, 36sylibr 134 1  |-  ( R  e. SRing  ->  Rel  ( ||r `  R
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395    e. wcel 2200   E.wrex 2509   _Vcvv 2799    C_ wss 3197   {copab 4143    X. cxp 4716   Rel wrel 4723    Fn wfn 5312   ` cfv 5317  (class class class)co 6000   Basecbs 13027   .rcmulr 13106  SRingcsrg 13921   ||rcdsr 14044
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-cnex 8086  ax-resscn 8087  ax-1cn 8088  ax-1re 8089  ax-icn 8090  ax-addcl 8091  ax-addrcl 8092  ax-mulcl 8093  ax-addcom 8095  ax-addass 8097  ax-i2m1 8100  ax-0lt1 8101  ax-0id 8103  ax-rnegex 8104  ax-pre-ltirr 8107  ax-pre-ltadd 8111
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-iota 5277  df-fun 5319  df-fn 5320  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-pnf 8179  df-mnf 8180  df-ltxr 8182  df-inn 9107  df-2 9165  df-3 9166  df-ndx 13030  df-slot 13031  df-base 13033  df-sets 13034  df-plusg 13118  df-mulr 13119  df-0g 13286  df-mgm 13384  df-sgrp 13430  df-mnd 13445  df-mgp 13879  df-srg 13922  df-dvdsr 14047
This theorem is referenced by:  dvdsrd  14052  isunitd  14064  subrgdvds  14193
  Copyright terms: Public domain W3C validator