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

Theorem reldvdsrsrg 13588
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 13585 . . . . 5  |-  ||r  =  (
w  e.  _V  |->  {
<. x ,  y >.  |  ( x  e.  ( Base `  w
)  /\  E. z  e.  ( Base `  w
) ( z ( .r `  w ) x )  =  y ) } )
2 fveq2 5554 . . . . . . . 8  |-  ( w  =  R  ->  ( Base `  w )  =  ( Base `  R
) )
32eleq2d 2263 . . . . . . 7  |-  ( w  =  R  ->  (
x  e.  ( Base `  w )  <->  x  e.  ( Base `  R )
) )
4 fveq2 5554 . . . . . . . . . 10  |-  ( w  =  R  ->  ( .r `  w )  =  ( .r `  R
) )
54oveqd 5935 . . . . . . . . 9  |-  ( w  =  R  ->  (
z ( .r `  w ) x )  =  ( z ( .r `  R ) x ) )
65eqeq1d 2202 . . . . . . . 8  |-  ( w  =  R  ->  (
( z ( .r
`  w ) x )  =  y  <->  ( z
( .r `  R
) x )  =  y ) )
72, 6rexeqbidv 2707 . . . . . . 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 4095 . . . . 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 2771 . . . . 5  |-  ( R  e. SRing  ->  R  e.  _V )
11 basfn 12676 . . . . . . . 8  |-  Base  Fn  _V
12 funfvex 5571 . . . . . . . . 9  |-  ( ( Fun  Base  /\  R  e. 
dom  Base )  ->  ( Base `  R )  e. 
_V )
1312funfni 5354 . . . . . . . 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 4773 . . . . . . 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 2193 . . . . . . . . . . . . 13  |-  ( Base `  R )  =  (
Base `  R )
22 eqid 2193 . . . . . . . . . . . . 13  |-  ( .r
`  R )  =  ( .r `  R
)
2321, 22srgcl 13466 . . . . . . . . . . . 12  |-  ( ( R  e. SRing  /\  z  e.  ( Base `  R
)  /\  x  e.  ( Base `  R )
)  ->  ( z
( .r `  R
) x )  e.  ( Base `  R
) )
2418, 19, 20, 23syl3anc 1249 . . . . . . . . . . 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 2271 . . . . . . . . . 10  |-  ( ( ( ( R  e. SRing  /\  x  e.  ( Base `  R ) )  /\  z  e.  (
Base `  R )
)  /\  ( z
( .r `  R
) x )  =  y )  ->  y  e.  ( Base `  R
) )
2625rexlimdva2 2614 . . . . . . . . 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 4309 . . . . . . 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 4665 . . . . . . 7  |-  ( (
Base `  R )  X.  ( Base `  R
) )  =  { <. x ,  y >.  |  ( x  e.  ( Base `  R
)  /\  y  e.  ( Base `  R )
) }
3028, 29sseqtrrdi 3228 . . . . . 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 4169 . . . . 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 5651 . . . 4  |-  ( R  e. SRing  ->  ( ||r `
 R )  =  { <. x ,  y
>.  |  ( x  e.  ( Base `  R
)  /\  E. z  e.  ( Base `  R
) ( z ( .r `  R ) x )  =  y ) } )
3332, 30eqsstrd 3215 . . 3  |-  ( R  e. SRing  ->  ( ||r `
 R )  C_  ( ( Base `  R
)  X.  ( Base `  R ) ) )
34 xpss 4767 . . 3  |-  ( (
Base `  R )  X.  ( Base `  R
) )  C_  ( _V  X.  _V )
3533, 34sstrdi 3191 . 2  |-  ( R  e. SRing  ->  ( ||r `
 R )  C_  ( _V  X.  _V )
)
36 df-rel 4666 . 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 1364    e. wcel 2164   E.wrex 2473   _Vcvv 2760    C_ wss 3153   {copab 4089    X. cxp 4657   Rel wrel 4664    Fn wfn 5249   ` cfv 5254  (class class class)co 5918   Basecbs 12618   .rcmulr 12696  SRingcsrg 13459   ||rcdsr 13582
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-addcom 7972  ax-addass 7974  ax-i2m1 7977  ax-0lt1 7978  ax-0id 7980  ax-rnegex 7981  ax-pre-ltirr 7984  ax-pre-ltadd 7988
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-iota 5215  df-fun 5256  df-fn 5257  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-pnf 8056  df-mnf 8057  df-ltxr 8059  df-inn 8983  df-2 9041  df-3 9042  df-ndx 12621  df-slot 12622  df-base 12624  df-sets 12625  df-plusg 12708  df-mulr 12709  df-0g 12869  df-mgm 12939  df-sgrp 12985  df-mnd 12998  df-mgp 13417  df-srg 13460  df-dvdsr 13585
This theorem is referenced by:  dvdsrd  13590  isunitd  13602  subrgdvds  13731
  Copyright terms: Public domain W3C validator