Theorem qusval 17524

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 17491	. . . 4 ⊢ /s = (𝑟 ∈ V, 𝑒 ∈ V ↦ ((𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) “s 𝑟))
3	2	a1i 11	. . 3 ⊢ (𝜑 → /s = (𝑟 ∈ V, 𝑒 ∈ V ↦ ((𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) “s 𝑟)))
4		simprl 770	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → 𝑟 = 𝑅)
5	4	fveq2d 6901	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → (Base‘𝑟) = (Base‘𝑅))
6		qusval.v	. . . . . . . 8 ⊢ (𝜑 → 𝑉 = (Base‘𝑅))
7	6	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → 𝑉 = (Base‘𝑅))
8	5, 7	eqtr4d 2771	. . . . . 6 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → (Base‘𝑟) = 𝑉)
9		eceq2 8765	. . . . . . 7 ⊢ (𝑒 = ∼ → [𝑥]𝑒 = [𝑥] ∼ )
10	9	ad2antll 728	. . . . . 6 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → [𝑥]𝑒 = [𝑥] ∼ )
11	8, 10	mpteq12dv 5239	. . . . 5 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → (𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ))
12		qusval.f	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )
13	11, 12	eqtr4di 2786	. . . 4 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → (𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) = 𝐹)
14	13, 4	oveq12d 7438	. . 3 ⊢ ((𝜑 ∧ (𝑟 = 𝑅 ∧ 𝑒 = ∼ )) → ((𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) “s 𝑟) = (𝐹 “s 𝑅))
15		qusval.r	. . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑍)
16	15	elexd 3492	. . 3 ⊢ (𝜑 → 𝑅 ∈ V)
17		qusval.e	. . . 4 ⊢ (𝜑 → ∼ ∈ 𝑊)
18	17	elexd 3492	. . 3 ⊢ (𝜑 → ∼ ∈ V)
19		ovexd 7455	. . 3 ⊢ (𝜑 → (𝐹 “s 𝑅) ∈ V)
20	3, 14, 16, 18, 19	ovmpod 7573	. 2 ⊢ (𝜑 → (𝑅 /s ∼ ) = (𝐹 “s 𝑅))
21	1, 20	eqtrd 2768	1 ⊢ (𝜑 → 𝑈 = (𝐹 “s 𝑅))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1534   ∈ wcel 2099  Vcvv 3471   ↦ cmpt 5231  ‘cfv 6548  (class class class)co 7420   ∈ cmpo 7422  [cec 8723  Basecbs 17180   “_s cimas 17486   /_s cqus 17487

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-sep 5299  ax-nul 5306  ax-pr 5429

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2530  df-eu 2559  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3430  df-v 3473  df-sbc 3777  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4909  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5576  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-iota 6500  df-fun 6550  df-fv 6556  df-ov 7423  df-oprab 7424  df-mpo 7425  df-ec 8727  df-qus 17491

This theorem is referenced by:  qusin  17526  qusbas  17527  quss  17528  qusaddval  17535  qusaddf  17536  qusmulval  17537  qusmulf  17538  qusgrp2  19014  qusrng  20120  qusring2  20270  qustps  23639  qustgpopn  24037  qustgplem  24038  qustgphaus  24040  qusvsval  33077  quslmod  33083  quslmhm  33084

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »