Theorem qusval 17707

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 17674	. . . 4 ⊢ /s = (𝑟 ∈ V, 𝑒 ∈ V ↦ ((𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) “s 𝑟))
3	2	a1i 11	. . 3 ⊢ (𝜑 → /s = (𝑟 ∈ V, 𝑒 ∈ V ↦ ((𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) “s 𝑟)))
4		simprl 783	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → 𝑟 = 𝑅)
5	4	fveq2d 6887	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → (Base‘𝑟) = (Base‘𝑅))
6		qusval.v	. . . . . . . 8 ⊢ (𝜑 → 𝑉 = (Base‘𝑅))
7	6	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → 𝑉 = (Base‘𝑅))
8	5, 7	eqtr4d 2799	. . . . . 6 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → (Base‘𝑟) = 𝑉)
9		eceq2 8752	. . . . . . 7 ⊢ (𝑒 = ∼ → [𝑥]𝑒 = [𝑥] ∼ )
10	9	ad2antll 742	. . . . . 6 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → [𝑥]𝑒 = [𝑥] ∼ )
11	8, 10	mpteq12dv 5192	. . . . 5 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → (𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ))
12		qusval.f	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )
13	11, 12	eqtr4di 2814	. . . 4 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → (𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) = 𝐹)
14	13, 4	oveq12d 7436	. . 3 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → ((𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) “s 𝑟) = (𝐹 “s 𝑅))
15		qusval.r	. . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑍)
16	15	elexd 3474	. . 3 ⊢ (𝜑 → 𝑅 ∈ V)
17		qusval.e	. . . 4 ⊢ (𝜑 → ∼ ∈ 𝑊)
18	17	elexd 3474	. . 3 ⊢ (𝜑 → ∼ ∈ V)
19		ovexd 7453	. . 3 ⊢ (𝜑 → (𝐹 “s 𝑅) ∈ V)
20	3, 14, 16, 18, 19	ovmpod 7570	. 2 ⊢ (𝜑 → (𝑅 /s ∼ ) = (𝐹 “s 𝑅))
21	1, 20	eqtrd 2796	1 ⊢ (𝜑 → 𝑈 = (𝐹 “s 𝑅))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ↦ cmpt 5186  ‘cfv 6537  (class class class)co 7418   ∈ cmpo 7420  [cec 8708  Basecbs 17380   “_s cimas 17669   /_s cqus 17670

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-ec 8712  df-qus 17674

This theorem is used by:  qusin  17709  qusbas  17710  quss  17711  qusaddval  17718  qusaddf  17719  qusmulval  17720  qusmulf  17721  qusmgm  18857  qusmnd  18968  qusgrp2  19261  qusrng  20395  qusring2  20557  qustps  24034  qustgpopn  24432  qustgplem  24433  qustgphaus  24435  qusvsval  33906  quslmod  33912  quslmhm  33913