Theorem qusex 13623

Description: Existence of a quotient structure. (Contributed by Jim Kingdon, 25-Apr-2025.)

Assertion

Ref	Expression
qusex	|- ( ( R e. V /\ .~ e. W ) -> ( R /.s .~ ) e. _V )

Proof of Theorem qusex

Dummy variables e r x are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 2833	. . . 4 |- ( R e. V -> R e. _V )
2	1	adantr 276	. . 3 |- ( ( R e. V /\ .~ e. W ) -> R e. _V )
3		elex 2833	. . . 4 |- ( .~ e. W -> .~ e. _V )
4	3	adantl 277	. . 3 |- ( ( R e. V /\ .~ e. W ) -> .~ e. _V )
5		basfn 13389	. . . . . 6 |- Base Fn _V
6		funfvex 5707	. . . . . . 7 |- ( ( Fun Base /\ R e. dom Base ) -> ( Base ` R ) e. _V )
7	6	funfni 5478	. . . . . 6 |- ( ( Base Fn _V /\ R e. _V ) -> ( Base ` R ) e. _V )
8	5, 2, 7	sylancr 418	. . . . 5 |- ( ( R e. V /\ .~ e. W ) -> ( Base ` R ) e. _V )
9	8	mptexd 5935	. . . 4 |- ( ( R e. V /\ .~ e. W ) -> ( x e. ( Base ` R ) |-> [ x ] .~ ) e. _V )
10		simpl 109	. . . 4 |- ( ( R e. V /\ .~ e. W ) -> R e. V )
11		imasex 13603	. . . 4 |- ( ( ( x e. ( Base ` R ) |-> [ x ] .~ ) e. _V /\ R e. V ) -> ( ( x e. ( Base ` R ) |-> [ x ] .~ ) "s R ) e. _V )
12	9, 10, 11	syl2anc 415	. . 3 |- ( ( R e. V /\ .~ e. W ) -> ( ( x e. ( Base ` R ) |-> [ x ] .~ ) "s R ) e. _V )
13		fveq2 5690	. . . . . 6 |- ( r = R -> ( Base ` r ) = ( Base ` R ) )
14	13	mpteq1d 4211	. . . . 5 |- ( r = R -> ( x e. ( Base ` r ) |-> [ x ] e ) = ( x e. ( Base ` R ) |-> [ x ] e ) )
15		id 19	. . . . 5 |- ( r = R -> r = R )
16	14, 15	oveq12d 6093	. . . 4 |- ( r = R -> ( ( x e. ( Base ` r ) |-> [ x ] e ) "s r ) = ( ( x e. ( Base ` R ) |-> [ x ] e ) "s R ) )
17		eceq2 6834	. . . . . 6 |- ( e = .~ -> [ x ] e = [ x ] .~ )
18	17	mpteq2dv 4217	. . . . 5 |- ( e = .~ -> ( x e. ( Base ` R ) |-> [ x ] e ) = ( x e. ( Base ` R ) |-> [ x ] .~ ) )
19	18	oveq1d 6090	. . . 4 |- ( e = .~ -> ( ( x e. ( Base ` R ) |-> [ x ] e ) "s R ) = ( ( x e. ( Base ` R ) |-> [ x ] .~ ) "s R ) )
20		df-qus 13602	. . . 4 |- /.s = ( r e. _V , e e. _V |-> ( ( x e. ( Base ` r ) |-> [ x ] e ) "s r ) )
21	16, 19, 20	ovmpog 6213	. . 3 |- ( ( R e. _V /\ .~ e. _V /\ ( ( x e. ( Base ` R ) |-> [ x ] .~ ) "s R ) e. _V ) -> ( R /.s .~ ) = ( ( x e. ( Base ` R ) |-> [ x ] .~ ) "s R ) )
22	2, 4, 12, 21	syl3anc 1278	. 2 |- ( ( R e. V /\ .~ e. W ) -> ( R /.s .~ ) = ( ( x e. ( Base ` R ) |-> [ x ] .~ ) "s R ) )
23	22, 12	eqeltrd 2315	1 |- ( ( R e. V /\ .~ e. W ) -> ( R /.s .~ ) e. _V )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   _Vcvv 2821   |-> cmpt 4187   Fn wfn 5367   ` cfv 5372  (class class class)co 6075   [cec 6795   Basecbs 13330   "_s cimas 13599   /._s cqus 13600

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 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-coll 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1re 8263  ax-addrcl 8266

This theorem 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-ral 2533  df-rex 2534  df-reu 2535  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-pw 3687  df-sn 3711  df-pr 3712  df-tp 3713  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-ec 6799  df-inn 9284  df-2 9342  df-3 9343  df-ndx 13333  df-slot 13334  df-base 13336  df-plusg 13421  df-mulr 13422  df-iimas 13601  df-qus 13602

This theorem is referenced by:  znval  14943  znle  14944  znbaslemnn  14946