Theorem qusaddf 13657

Description: The addition in a quotient structure as a function. (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 )
qusaddf.p	|- .x. = ( +g ` R )
qusaddf.a	|- .xb = ( +g ` U )

Assertion

Ref	Expression
qusaddf	|- ( ph -> .xb : ( ( V /. .~ ) X. ( V /. .~ ) ) --> ( V /. .~ ) )

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

Allowed substitution hints:   R( a, b)   .x. ( a, b)   U( q, p, a, b)   Z( q, p, a, b)

Proof of Theorem qusaddf

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		qusaddf.u	. 2 |- ( ph -> U = ( R /.s .~ ) )
2		qusaddf.v	. 2 |- ( ph -> V = ( Base ` R ) )
3		qusaddf.r	. 2 |- ( ph -> .~ Er V )
4		qusaddf.z	. 2 |- ( ph -> R e. Z )
5		qusaddf.e	. 2 |- ( ph -> ( ( a .~ p /\ b .~ q ) -> ( a .x. b ) .~ ( p .x. q ) ) )
6		qusaddf.c	. 2 |- ( ( ph /\ ( p e. V /\ q e. V ) ) -> ( p .x. q ) e. V )
7		eqid 2238	. 2 |- ( x e. V |-> [ x ] .~ ) = ( x e. V |-> [ x ] .~ )
8		basfn 13411	. . . . . . 7 |- Base Fn _V
9	4	elexd 2835	. . . . . . 7 |- ( ph -> R e. _V )
10		funfvex 5712	. . . . . . . 8 |- ( ( Fun Base /\ R e. dom Base ) -> ( Base ` R ) e. _V )
11	10	funfni 5483	. . . . . . 7 |- ( ( Base Fn _V /\ R e. _V ) -> ( Base ` R ) e. _V )
12	8, 9, 11	sylancr 418	. . . . . 6 |- ( ph -> ( Base ` R ) e. _V )
13	2, 12	eqeltrd 2315	. . . . 5 |- ( ph -> V e. _V )
14		erex 6831	. . . . 5 |- ( .~ Er V -> ( V e. _V -> .~ e. _V ) )
15	3, 13, 14	sylc 62	. . . 4 |- ( ph -> .~ e. _V )
16	1, 2, 7, 15, 4	qusval 13644	. . 3 |- ( ph -> U = ( ( x e. V |-> [ x ] .~ ) "s R ) )
17	1, 2, 7, 15, 4	quslem 13645	. . 3 |- ( ph -> ( x e. V |-> [ x ] .~ ) : V -onto-> ( V /. .~ ) )
18		qusaddf.p	. . 3 |- .x. = ( +g ` R )
19		qusaddf.a	. . 3 |- .xb = ( +g ` U )
20	16, 2, 17, 4, 18, 19	imasplusg 13629	. 2 |- ( ph -> .xb = U_ p e. V U_ q e. V { <. <. ( ( x e. V |-> [ x ] .~ ) ` p ) , ( ( x e. V |-> [ x ] .~ ) ` q ) >. , ( ( x e. V |-> [ x ] .~ ) ` ( p .x. q ) ) >. } )
21		plusgslid 13466	. . . . 5 |- ( +g = Slot ( +g ` ndx ) /\ ( +g ` ndx ) e. NN )
22	21	slotex 13379	. . . 4 |- ( R e. Z -> ( +g ` R ) e. _V )
23	4, 22	syl 14	. . 3 |- ( ph -> ( +g ` R ) e. _V )
24	18, 23	eqeltrid 2325	. 2 |- ( ph -> .x. e. _V )
25	1, 2, 3, 4, 5, 6, 7, 20, 24	qusaddflemg 13655	1 |- ( ph -> .xb : ( ( V /. .~ ) X. ( V /. .~ ) ) --> ( V /. .~ ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   _Vcvv 2821   class class class wbr 4130   |-> cmpt 4192   X. cxp 4772   Fn wfn 5372   -->wf 5373   ` cfv 5377  (class class class)co 6085   Er wer 6804   [cec 6805   /.cqs 6806   Basecbs 13352   +g cplusg 13431   /._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-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 4246  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-3or 1010  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-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-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-tp 3717  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-oprab 6089  df-mpo 6090  df-er 6807  df-ec 6809  df-qs 6813  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9305  df-2 9363  df-3 9364  df-ndx 13355  df-slot 13356  df-base 13358  df-plusg 13444  df-mulr 13445  df-iimas 13624  df-qus 13625

This theorem is used by: (None)