Theorem qusval 13627

Description: Value of a quotient structure. (Contributed by Mario Carneiro, 23-Feb-2015.)

Hypotheses

Ref	Expression
qusval.u	⊢ (𝜑 → 𝑈 = (𝑅 /s ∼ ))
qusval.v	⊢ (𝜑 → 𝑉 = (Base‘𝑅))
qusval.f	⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )
qusval.e	⊢ (𝜑 → ∼ ∈ 𝑊)
qusval.r	⊢ (𝜑 → 𝑅 ∈ 𝑍)

Assertion

Ref	Expression
qusval	⊢ (𝜑 → 𝑈 = (𝐹 “s 𝑅))

Distinct variable groups:   𝑥, ∼   𝜑,𝑥   𝑥,𝑅   𝑥,𝑉

Allowed substitution hints:   𝑈(𝑥)   𝐹(𝑥)   𝑊(𝑥)   𝑍(𝑥)

Proof of Theorem qusval

Dummy variables 𝑒 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		qusval.u	. 2 ⊢ (𝜑 → 𝑈 = (𝑅 /s ∼ ))
2		df-qus 13608	. . . 4 ⊢ /s = (𝑟 ∈ V, 𝑒 ∈ V ↦ ((𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) “s 𝑟))
3	2	a1i 9	. . 3 ⊢ (𝜑 → /s = (𝑟 ∈ V, 𝑒 ∈ V ↦ ((𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) “s 𝑟)))
4		simprl 535	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → 𝑟 = 𝑅)
5	4	fveq2d 5697	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → (Base‘𝑟) = (Base‘𝑅))
6		qusval.v	. . . . . . . 8 ⊢ (𝜑 → 𝑉 = (Base‘𝑅))
7	6	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → 𝑉 = (Base‘𝑅))
8	5, 7	eqtr4d 2274	. . . . . 6 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → (Base‘𝑟) = 𝑉)
9		eceq2 6838	. . . . . . 7 ⊢ (𝑒 = ∼ → [𝑥]𝑒 = [𝑥] ∼ )
10	9	ad2antll 495	. . . . . 6 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → [𝑥]𝑒 = [𝑥] ∼ )
11	8, 10	mpteq12dv 4211	. . . . 5 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → (𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ))
12		qusval.f	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )
13	11, 12	eqtr4di 2289	. . . 4 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → (𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) = 𝐹)
14	13, 4	oveq12d 6097	. . 3 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → ((𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) “s 𝑟) = (𝐹 “s 𝑅))
15		qusval.r	. . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑍)
16	15	elexd 2835	. . 3 ⊢ (𝜑 → 𝑅 ∈ V)
17		qusval.e	. . . 4 ⊢ (𝜑 → ∼ ∈ 𝑊)
18	17	elexd 2835	. . 3 ⊢ (𝜑 → ∼ ∈ V)
19		basfn 13394	. . . . . . . 8 ⊢ Base Fn V
20		funfvex 5710	. . . . . . . . 9 ⊢ ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V)
21	20	funfni 5481	. . . . . . . 8 ⊢ ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V)
22	19, 16, 21	sylancr 418	. . . . . . 7 ⊢ (𝜑 → (Base‘𝑅) ∈ V)
23	6, 22	eqeltrd 2315	. . . . . 6 ⊢ (𝜑 → 𝑉 ∈ V)
24	23	mptexd 5938	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) ∈ V)
25	12, 24	eqeltrid 2325	. . . 4 ⊢ (𝜑 → 𝐹 ∈ V)
26		imasex 13609	. . . 4 ⊢ ((𝐹 ∈ V ∧ 𝑅 ∈ 𝑍) → (𝐹 “s 𝑅) ∈ V)
27	25, 15, 26	syl2anc 415	. . 3 ⊢ (𝜑 → (𝐹 “s 𝑅) ∈ V)
28	3, 14, 16, 18, 27	ovmpod 6210	. 2 ⊢ (𝜑 → (𝑅 /s ∼ ) = (𝐹 “s 𝑅))
29	1, 28	eqtrd 2271	1 ⊢ (𝜑 → 𝑈 = (𝐹 “s 𝑅))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  Vcvv 2821   ↦ cmpt 4190   Fn wfn 5370  ‘cfv 5375  (class class class)co 6079   ∈ cmpo 6081  [cec 6799  Basecbs 13335   “_s cimas 13605   /_s cqus 13606

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 4244  ax-sep 4247  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-cnex 8264  ax-resscn 8265  ax-1re 8267  ax-addrcl 8270

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 3690  df-sn 3714  df-pr 3715  df-tp 3716  df-op 3717  df-uni 3934  df-int 3969  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-ov 6082  df-oprab 6083  df-mpo 6084  df-ec 6803  df-inn 9288  df-2 9346  df-3 9347  df-ndx 13338  df-slot 13339  df-base 13341  df-plusg 13427  df-mulr 13428  df-iimas 13607  df-qus 13608

This theorem is referenced by:  qusin  13630  qusbas  13631  qusaddval  13639  qusaddf  13640  qusmulval  13641  qusmulf  13642  qusgrp2  13899  qusrng  14240  qusring2  14354