Theorem qusval 17621

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 17588	. . . 4 ⊢ /s = (𝑟 ∈ V, 𝑒 ∈ V ↦ ((𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) “s 𝑟))
3	2	a1i 11	. . 3 ⊢ (𝜑 → /s = (𝑟 ∈ V, 𝑒 ∈ V ↦ ((𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) “s 𝑟)))
4		simprl 783	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → 𝑟 = 𝑅)
5	4	fveq2d 6892	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → (Base‘𝑟) = (Base‘𝑅))
6		qusval.v	. . . . . . . 8 ⊢ (𝜑 → 𝑉 = (Base‘𝑅))
7	6	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → 𝑉 = (Base‘𝑅))
8	5, 7	eqtr4d 2804	. . . . . 6 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → (Base‘𝑟) = 𝑉)
9		eceq2 8745	. . . . . . 7 ⊢ (𝑒 = ∼ → [𝑥]𝑒 = [𝑥] ∼ )
10	9	ad2antll 742	. . . . . 6 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → [𝑥]𝑒 = [𝑥] ∼ )
11	8, 10	mpteq12dv 5203	. . . . 5 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → (𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ))
12		qusval.f	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )
13	11, 12	eqtr4di 2819	. . . 4 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → (𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) = 𝐹)
14	13, 4	oveq12d 7441	. . 3 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → ((𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) “s 𝑟) = (𝐹 “s 𝑅))
15		qusval.r	. . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑍)
16	15	elexd 3481	. . 3 ⊢ (𝜑 → 𝑅 ∈ V)
17		qusval.e	. . . 4 ⊢ (𝜑 → ∼ ∈ 𝑊)
18	17	elexd 3481	. . 3 ⊢ (𝜑 → ∼ ∈ V)
19		ovexd 7458	. . 3 ⊢ (𝜑 → (𝐹 “s 𝑅) ∈ V)
20	3, 14, 16, 18, 19	ovmpod 7575	. 2 ⊢ (𝜑 → (𝑅 /s ∼ ) = (𝐹 “s 𝑅))
21	1, 20	eqtrd 2801	1 ⊢ (𝜑 → 𝑈 = (𝐹 “s 𝑅))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  Vcvv 3458   ↦ cmpt 5197  ‘cfv 6543  (class class class)co 7423   ∈ cmpo 7425  [cec 8701  Basecbs 17294   “_s cimas 17583   /_s cqus 17584

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-ec 8705  df-qus 17588

This theorem is used by:  qusin  17623  qusbas  17624  quss  17625  qusaddval  17632  qusaddf  17633  qusmulval  17634  qusmulf  17635  qusgrp2  19155  qusrng  20289  qusring2  20449  qustps  23916  qustgpopn  24314  qustgplem  24315  qustgphaus  24317  qusvsval  33703  quslmod  33709  quslmhm  33710