Theorem qusaddvallemg 13381

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

Hypotheses

Ref	Expression
qusaddf.u	⊢ (𝜑 → 𝑈 = (𝑅 /s ∼ ))
qusaddf.v	⊢ (𝜑 → 𝑉 = (Base‘𝑅))
qusaddf.r	⊢ (𝜑 → ∼ Er 𝑉)
qusaddf.z	⊢ (𝜑 → 𝑅 ∈ 𝑍)
qusaddf.e	⊢ (𝜑 → ((𝑎 ∼ 𝑝 ∧ 𝑏 ∼ 𝑞) → (𝑎 · 𝑏) ∼ (𝑝 · 𝑞)))
qusaddf.c	⊢ ((𝜑 ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (𝑝 · 𝑞) ∈ 𝑉)
qusaddflem.f	⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )
qusaddflem.g	⊢ (𝜑 → ∙ = ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩})
qusaddflemg.x	⊢ (𝜑 → · ∈ 𝑊)

Assertion

Ref	Expression
qusaddvallemg	⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋] ∼ ∙ [𝑌] ∼ ) = [(𝑋 · 𝑌)] ∼ )

Distinct variable groups:   𝑎,𝑏,𝑝,𝑞,𝑥, ∼   𝐹,𝑎,𝑏,𝑝,𝑞   𝜑,𝑎,𝑏,𝑝,𝑞,𝑥   𝑉,𝑎,𝑏,𝑝,𝑞,𝑥   𝑅,𝑝,𝑞,𝑥   · ,𝑝,𝑞,𝑥   𝑋,𝑝,𝑞,𝑥   ∙ ,𝑎,𝑏,𝑝,𝑞   𝑌,𝑝,𝑞,𝑥

Allowed substitution hints:   𝑅(𝑎,𝑏)   ∙ (𝑥)   · (𝑎,𝑏)   𝑈(𝑥,𝑞,𝑝,𝑎,𝑏)   𝐹(𝑥)   𝑊(𝑥,𝑞,𝑝,𝑎,𝑏)   𝑋(𝑎,𝑏)   𝑌(𝑎,𝑏)   𝑍(𝑥,𝑞,𝑝,𝑎,𝑏)

Proof of Theorem qusaddvallemg

Step	Hyp	Ref	Expression
1		qusaddf.u	. . . 4 ⊢ (𝜑 → 𝑈 = (𝑅 /s ∼ ))
2		qusaddf.v	. . . 4 ⊢ (𝜑 → 𝑉 = (Base‘𝑅))
3		qusaddflem.f	. . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )
4		qusaddf.r	. . . . 5 ⊢ (𝜑 → ∼ Er 𝑉)
5		qusaddf.z	. . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ 𝑍)
6		basfn 13106	. . . . . . . 8 ⊢ Base Fn V
7		elex 2811	. . . . . . . 8 ⊢ (𝑅 ∈ 𝑍 → 𝑅 ∈ V)
8		funfvex 5646	. . . . . . . . 9 ⊢ ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V)
9	8	funfni 5423	. . . . . . . 8 ⊢ ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V)
10	6, 7, 9	sylancr 414	. . . . . . 7 ⊢ (𝑅 ∈ 𝑍 → (Base‘𝑅) ∈ V)
11	5, 10	syl 14	. . . . . 6 ⊢ (𝜑 → (Base‘𝑅) ∈ V)
12	2, 11	eqeltrd 2306	. . . . 5 ⊢ (𝜑 → 𝑉 ∈ V)
13		erex 6712	. . . . 5 ⊢ ( ∼ Er 𝑉 → (𝑉 ∈ V → ∼ ∈ V))
14	4, 12, 13	sylc 62	. . . 4 ⊢ (𝜑 → ∼ ∈ V)
15	1, 2, 3, 14, 5	quslem 13372	. . 3 ⊢ (𝜑 → 𝐹:𝑉–onto→(𝑉 / ∼ ))
16		qusaddf.c	. . . 4 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (𝑝 · 𝑞) ∈ 𝑉)
17		qusaddf.e	. . . 4 ⊢ (𝜑 → ((𝑎 ∼ 𝑝 ∧ 𝑏 ∼ 𝑞) → (𝑎 · 𝑏) ∼ (𝑝 · 𝑞)))
18	4, 12, 3, 16, 17	ercpbl 13379	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (((𝐹‘𝑎) = (𝐹‘𝑝) ∧ (𝐹‘𝑏) = (𝐹‘𝑞)) → (𝐹‘(𝑎 · 𝑏)) = (𝐹‘(𝑝 · 𝑞))))
19		qusaddflem.g	. . 3 ⊢ (𝜑 → ∙ = ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩})
20		qusaddflemg.x	. . 3 ⊢ (𝜑 → · ∈ 𝑊)
21	15, 18, 19, 12, 20	imasaddvallemg 13363	. 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((𝐹‘𝑋) ∙ (𝐹‘𝑌)) = (𝐹‘(𝑋 · 𝑌)))
22	4	3ad2ant1 1042	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ∼ Er 𝑉)
23	12	3ad2ant1 1042	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → 𝑉 ∈ V)
24		simp2 1022	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → 𝑋 ∈ 𝑉)
25	22, 23, 3, 24	divsfvalg 13377	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝐹‘𝑋) = [𝑋] ∼ )
26		simp3 1023	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → 𝑌 ∈ 𝑉)
27	22, 23, 3, 26	divsfvalg 13377	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝐹‘𝑌) = [𝑌] ∼ )
28	25, 27	oveq12d 6025	. 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((𝐹‘𝑋) ∙ (𝐹‘𝑌)) = ([𝑋] ∼ ∙ [𝑌] ∼ ))
29	16	3ad2antl1 1183	. . . 4 ⊢ (((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (𝑝 · 𝑞) ∈ 𝑉)
30	29, 24, 26	caovcld 6165	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑋 · 𝑌) ∈ 𝑉)
31	22, 23, 3, 30	divsfvalg 13377	. 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝐹‘(𝑋 · 𝑌)) = [(𝑋 · 𝑌)] ∼ )
32	21, 28, 31	3eqtr3d 2270	1 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋] ∼ ∙ [𝑌] ∼ ) = [(𝑋 · 𝑌)] ∼ )

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 1002   = wceq 1395   ∈ wcel 2200  Vcvv 2799  {csn 3666  ⟨cop 3669  ∪ ciun 3965   class class class wbr 4083   ↦ cmpt 4145   Fn wfn 5313  ‘cfv 5318  (class class class)co 6007   Er wer 6685  [cec 6686   / cqs 6687  Basecbs 13047   /_s cqus 13348

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-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-cnex 8101  ax-resscn 8102  ax-1re 8104  ax-addrcl 8107

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-ov 6010  df-er 6688  df-ec 6690  df-qs 6694  df-inn 9122  df-ndx 13050  df-slot 13051  df-base 13053

This theorem is referenced by:  qusaddval  13383  qusmulval  13385