Theorem qusex 13407

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 2814	. . . 4 |- ( R e. V -> R e. _V )
2	1	adantr 276	. . 3 |- ( ( R e. V /\ .~ e. W ) -> R e. _V )
3		elex 2814	. . . 4 |- ( .~ e. W -> .~ e. _V )
4	3	adantl 277	. . 3 |- ( ( R e. V /\ .~ e. W ) -> .~ e. _V )
5		basfn 13140	. . . . . 6 |- Base Fn _V
6		funfvex 5656	. . . . . . 7 |- ( ( Fun Base /\ R e. dom Base ) -> ( Base ` R ) e. _V )
7	6	funfni 5432	. . . . . 6 |- ( ( Base Fn _V /\ R e. _V ) -> ( Base ` R ) e. _V )
8	5, 2, 7	sylancr 414	. . . . 5 |- ( ( R e. V /\ .~ e. W ) -> ( Base ` R ) e. _V )
9	8	mptexd 5880	. . . 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 13387	. . . 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 411	. . 3 |- ( ( R e. V /\ .~ e. W ) -> ( ( x e. ( Base ` R ) |-> [ x ] .~ ) "s R ) e. _V )
13		fveq2 5639	. . . . . 6 |- ( r = R -> ( Base ` r ) = ( Base ` R ) )
14	13	mpteq1d 4174	. . . . 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 6035	. . . 4 |- ( r = R -> ( ( x e. ( Base ` r ) |-> [ x ] e ) "s r ) = ( ( x e. ( Base ` R ) |-> [ x ] e ) "s R ) )
17		eceq2 6738	. . . . . 6 |- ( e = .~ -> [ x ] e = [ x ] .~ )
18	17	mpteq2dv 4180	. . . . 5 |- ( e = .~ -> ( x e. ( Base ` R ) |-> [ x ] e ) = ( x e. ( Base ` R ) |-> [ x ] .~ ) )
19	18	oveq1d 6032	. . . 4 |- ( e = .~ -> ( ( x e. ( Base ` R ) |-> [ x ] e ) "s R ) = ( ( x e. ( Base ` R ) |-> [ x ] .~ ) "s R ) )
20		df-qus 13385	. . . 4 |- /.s = ( r e. _V , e e. _V |-> ( ( x e. ( Base ` r ) |-> [ x ] e ) "s r ) )
21	16, 19, 20	ovmpog 6155	. . 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 1273	. 2 |- ( ( R e. V /\ .~ e. W ) -> ( R /.s .~ ) = ( ( x e. ( Base ` R ) |-> [ x ] .~ ) "s R ) )
23	22, 12	eqeltrd 2308	1 |- ( ( R e. V /\ .~ e. W ) -> ( R /.s .~ ) e. _V )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1397   e. wcel 2202   _Vcvv 2802   |-> cmpt 4150   Fn wfn 5321   ` cfv 5326  (class class class)co 6017   [cec 6699   Basecbs 13081   "_s cimas 13381   /._s cqus 13382

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1re 8125  ax-addrcl 8128

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-tp 3677  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-ec 6703  df-inn 9143  df-2 9201  df-3 9202  df-ndx 13084  df-slot 13085  df-base 13087  df-plusg 13172  df-mulr 13173  df-iimas 13384  df-qus 13385

This theorem is referenced by:  znval  14649  znle  14650  znbaslemnn  14652