Theorem dvdsrex 14407

Description: Existence of the divisibility relation. (Contributed by Jim Kingdon, 28-Jan-2025.)

Assertion

Ref	Expression
dvdsrex	|- ( R e. SRing -> ( ||r ` R ) e. _V )

Proof of Theorem dvdsrex

Dummy variables x y z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqidd 2239	. . 3 |- ( R e. SRing -> ( Base ` R ) = ( Base ` R ) )
2		eqidd 2239	. . 3 |- ( R e. SRing -> ( ||r ` R ) = ( ||r ` R ) )
3		id 19	. . 3 |- ( R e. SRing -> R e. SRing )
4		eqidd 2239	. . 3 |- ( R e. SRing -> ( .r ` R ) = ( .r ` R ) )
5	1, 2, 3, 4	dvdsrvald 14402	. 2 |- ( R e. SRing -> ( ||r ` R ) = { <. x , y >. | ( x e. ( Base ` R ) /\ E. z e. ( Base ` R ) ( z ( .r ` R ) x ) = y ) } )
6		basfn 13413	. . . . 5 |- Base Fn _V
7		elex 2833	. . . . 5 |- ( R e. SRing -> R e. _V )
8		funfvex 5712	. . . . . 6 |- ( ( Fun Base /\ R e. dom Base ) -> ( Base ` R ) e. _V )
9	8	funfni 5483	. . . . 5 |- ( ( Base Fn _V /\ R e. _V ) -> ( Base ` R ) e. _V )
10	6, 7, 9	sylancr 418	. . . 4 |- ( R e. SRing -> ( Base ` R ) e. _V )
11		xpexg 4889	. . . 4 |- ( ( ( Base ` R ) e. _V /\ ( Base ` R ) e. _V ) -> ( ( Base ` R ) X. ( Base ` R ) ) e. _V )
12	10, 10, 11	syl2anc 415	. . 3 |- ( R e. SRing -> ( ( Base ` R ) X. ( Base ` R ) ) e. _V )
13		simprr 537	. . . . . . . 8 |- ( ( ( R e. SRing /\ x e. ( Base ` R ) ) /\ ( z e. ( Base ` R ) /\ ( z ( .r ` R ) x ) = y ) ) -> ( z ( .r ` R ) x ) = y )
14		simpll 531	. . . . . . . . 9 |- ( ( ( R e. SRing /\ x e. ( Base ` R ) ) /\ ( z e. ( Base ` R ) /\ ( z ( .r ` R ) x ) = y ) ) -> R e. SRing )
15		simprl 535	. . . . . . . . 9 |- ( ( ( R e. SRing /\ x e. ( Base ` R ) ) /\ ( z e. ( Base ` R ) /\ ( z ( .r ` R ) x ) = y ) ) -> z e. ( Base ` R ) )
16		simplr 533	. . . . . . . . 9 |- ( ( ( R e. SRing /\ x e. ( Base ` R ) ) /\ ( z e. ( Base ` R ) /\ ( z ( .r ` R ) x ) = y ) ) -> x e. ( Base ` R ) )
17		eqid 2238	. . . . . . . . . 10 |- ( Base ` R ) = ( Base ` R )
18		eqid 2238	. . . . . . . . . 10 |- ( .r ` R ) = ( .r ` R )
19	17, 18	srgcl 14276	. . . . . . . . 9 |- ( ( R e. SRing /\ z e. ( Base ` R ) /\ x e. ( Base ` R ) ) -> ( z ( .r ` R ) x ) e. ( Base ` R ) )
20	14, 15, 16, 19	syl3anc 1278	. . . . . . . 8 |- ( ( ( R e. SRing /\ x e. ( Base ` R ) ) /\ ( z e. ( Base ` R ) /\ ( z ( .r ` R ) x ) = y ) ) -> ( z ( .r ` R ) x ) e. ( Base ` R ) )
21	13, 20	eqeltrrd 2316	. . . . . . 7 |- ( ( ( R e. SRing /\ x e. ( Base ` R ) ) /\ ( z e. ( Base ` R ) /\ ( z ( .r ` R ) x ) = y ) ) -> y e. ( Base ` R ) )
22	21	rexlimdvaa 2669	. . . . . 6 |- ( ( R e. SRing /\ x e. ( Base ` R ) ) -> ( E. z e. ( Base ` R ) ( z ( .r ` R ) x ) = y -> y e. ( Base ` R ) ) )
23	22	imdistanda 452	. . . . 5 |- ( 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 ) ) ) )
24	23	ssopab2dv 4421	. . . 4 |- ( 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 ) ) } )
25		df-xp 4780	. . . 4 |- ( ( Base ` R ) X. ( Base ` R ) ) = { <. x , y >. | ( x e. ( Base ` R ) /\ y e. ( Base ` R ) ) }
26	24, 25	sseqtrrdi 3297	. . 3 |- ( 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 ) ) )
27	12, 26	ssexd 4273	. 2 |- ( R e. SRing -> { <. x , y >. | ( x e. ( Base ` R ) /\ E. z e. ( Base ` R ) ( z ( .r ` R ) x ) = y ) } e. _V )
28	5, 27	eqeltrd 2315	1 |- ( R e. SRing -> ( ||r ` R ) e. _V )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   E.wrex 2529   _Vcvv 2821   {copab 4191   X. cxp 4772   Fn wfn 5372   ` cfv 5377  (class class class)co 6085   Basecbs 13354   .rcmulr 13434  SRingcsrg 14269   ||_rcdsr 14394

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-ltadd 8295

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  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-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9306  df-2 9364  df-3 9365  df-ndx 13357  df-slot 13358  df-base 13360  df-sets 13361  df-plusg 13446  df-mulr 13447  df-0g 13614  df-mgm 13678  df-sgrp 13719  df-mnd 13732  df-mgp 14220  df-srg 14270  df-dvdsr 14397

This theorem is used by:  isunitd  14415