Theorem qusaddvallemg 13654

Description: Value of an operation defined on a quotient structure. (Contributed by Mario Carneiro, 24-Feb-2015.)

Hypotheses

Ref	Expression
qusaddf.u	|- ( ph -> U = ( R /.s .~ ) )
qusaddf.v	|- ( ph -> V = ( Base ` R ) )
qusaddf.r	|- ( ph -> .~ Er V )
qusaddf.z	|- ( ph -> R e. Z )
qusaddf.e	|- ( ph -> ( ( a .~ p /\ b .~ q ) -> ( a .x. b ) .~ ( p .x. q ) ) )
qusaddf.c	|- ( ( ph /\ ( p e. V /\ q e. V ) ) -> ( p .x. q ) e. V )
qusaddflem.f	|- F = ( x e. V |-> [ x ] .~ )
qusaddflem.g	|- ( ph -> .xb = U_ p e. V U_ q e. V { <. <. ( F ` p ) , ( F ` q ) >. , ( F ` ( p .x. q ) ) >. } )
qusaddflemg.x	|- ( ph -> .x. e. W )

Assertion

Ref	Expression
qusaddvallemg	|- ( ( ph /\ X e. V /\ Y e. V ) -> ( [ X ] .~ .xb [ Y ] .~ ) = [ ( X .x. Y ) ] .~ )

Distinct variable groups:   a, b, p, q, x, .~   F, a, b, p, q   ph, a, b, p, q, x   V, a, b, p, q, x   R, p, q, x   .x. , p, q, x   X, p, q, x   .xb , a, b, p, q   Y, p, q, x

Allowed substitution hints:   R( a, b)   .xb ( x)   .x. ( a, b)   U( x, q, p, a, b)   F( x)   W( x, q, p, a, b)   X( a, b)   Y( a, b)   Z( x, q, p, a, b)

Proof of Theorem qusaddvallemg

Step	Hyp	Ref	Expression
1		qusaddf.u	. . . 4 |- ( ph -> U = ( R /.s .~ ) )
2		qusaddf.v	. . . 4 |- ( ph -> V = ( Base ` R ) )
3		qusaddflem.f	. . . 4 |- F = ( x e. V |-> [ x ] .~ )
4		qusaddf.r	. . . . 5 |- ( ph -> .~ Er V )
5		qusaddf.z	. . . . . . 7 |- ( ph -> R e. Z )
6		basfn 13411	. . . . . . . 8 |- Base Fn _V
7		elex 2833	. . . . . . . 8 |- ( R e. Z -> R e. _V )
8		funfvex 5712	. . . . . . . . 9 |- ( ( Fun Base /\ R e. dom Base ) -> ( Base ` R ) e. _V )
9	8	funfni 5483	. . . . . . . 8 |- ( ( Base Fn _V /\ R e. _V ) -> ( Base ` R ) e. _V )
10	6, 7, 9	sylancr 418	. . . . . . 7 |- ( R e. Z -> ( Base ` R ) e. _V )
11	5, 10	syl 14	. . . . . 6 |- ( ph -> ( Base ` R ) e. _V )
12	2, 11	eqeltrd 2315	. . . . 5 |- ( ph -> V e. _V )
13		erex 6831	. . . . 5 |- ( .~ Er V -> ( V e. _V -> .~ e. _V ) )
14	4, 12, 13	sylc 62	. . . 4 |- ( ph -> .~ e. _V )
15	1, 2, 3, 14, 5	quslem 13645	. . 3 |- ( ph -> F : V -onto-> ( V /. .~ ) )
16		qusaddf.c	. . . 4 |- ( ( ph /\ ( p e. V /\ q e. V ) ) -> ( p .x. q ) e. V )
17		qusaddf.e	. . . 4 |- ( ph -> ( ( a .~ p /\ b .~ q ) -> ( a .x. b ) .~ ( p .x. q ) ) )
18	4, 12, 3, 16, 17	ercpbl 13652	. . 3 |- ( ( ph /\ ( a e. V /\ b e. V ) /\ ( p e. V /\ q e. V ) ) -> ( ( ( F ` a ) = ( F ` p ) /\ ( F ` b ) = ( F ` q ) ) -> ( F ` ( a .x. b ) ) = ( F ` ( p .x. q ) ) ) )
19		qusaddflem.g	. . 3 |- ( ph -> .xb = U_ p e. V U_ q e. V { <. <. ( F ` p ) , ( F ` q ) >. , ( F ` ( p .x. q ) ) >. } )
20		qusaddflemg.x	. . 3 |- ( ph -> .x. e. W )
21	15, 18, 19, 12, 20	imasaddvallemg 13636	. 2 |- ( ( ph /\ X e. V /\ Y e. V ) -> ( ( F ` X ) .xb ( F ` Y ) ) = ( F ` ( X .x. Y ) ) )
22	4	3ad2ant1 1049	. . . 4 |- ( ( ph /\ X e. V /\ Y e. V ) -> .~ Er V )
23	12	3ad2ant1 1049	. . . 4 |- ( ( ph /\ X e. V /\ Y e. V ) -> V e. _V )
24		simp2 1029	. . . 4 |- ( ( ph /\ X e. V /\ Y e. V ) -> X e. V )
25	22, 23, 3, 24	divsfvalg 13650	. . 3 |- ( ( ph /\ X e. V /\ Y e. V ) -> ( F ` X ) = [ X ] .~ )
26		simp3 1030	. . . 4 |- ( ( ph /\ X e. V /\ Y e. V ) -> Y e. V )
27	22, 23, 3, 26	divsfvalg 13650	. . 3 |- ( ( ph /\ X e. V /\ Y e. V ) -> ( F ` Y ) = [ Y ] .~ )
28	25, 27	oveq12d 6103	. 2 |- ( ( ph /\ X e. V /\ Y e. V ) -> ( ( F ` X ) .xb ( F ` Y ) ) = ( [ X ] .~ .xb [ Y ] .~ ) )
29	16	3ad2antl1 1190	. . . 4 |- ( ( ( ph /\ X e. V /\ Y e. V ) /\ ( p e. V /\ q e. V ) ) -> ( p .x. q ) e. V )
30	29, 24, 26	caovcld 6243	. . 3 |- ( ( ph /\ X e. V /\ Y e. V ) -> ( X .x. Y ) e. V )
31	22, 23, 3, 30	divsfvalg 13650	. 2 |- ( ( ph /\ X e. V /\ Y e. V ) -> ( F ` ( X .x. Y ) ) = [ ( X .x. Y ) ] .~ )
32	21, 28, 31	3eqtr3d 2279	1 |- ( ( ph /\ X e. V /\ Y e. V ) -> ( [ X ] .~ .xb [ Y ] .~ ) = [ ( X .x. Y ) ] .~ )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   /\ w3a 1009   = wceq 1402   e. wcel 2209   _Vcvv 2821   {csn 3709   <.cop 3712   U_ciun 4012   class class class wbr 4130   |-> cmpt 4192   Fn wfn 5372   ` cfv 5377  (class class class)co 6085   Er wer 6804   [cec 6805   /.cqs 6806   Basecbs 13352   /._s cqus 13623

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  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 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  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-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  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-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-er 6807  df-ec 6809  df-qs 6813  df-inn 9305  df-ndx 13355  df-slot 13356  df-base 13358

This theorem is used by:  qusaddval  13656  qusmulval  13658