Theorem qusin 17467

Description: Restrict the equivalence relation in a quotient structure to the base set. (Contributed by Mario Carneiro, 23-Feb-2015.)

Hypotheses

Ref	Expression
qusin.u	⊢ (𝜑 → 𝑈 = (𝑅 /s ∼ ))
qusin.v	⊢ (𝜑 → 𝑉 = (Base‘𝑅))
qusin.e	⊢ (𝜑 → ∼ ∈ 𝑊)
qusin.r	⊢ (𝜑 → 𝑅 ∈ 𝑍)
qusin.s	⊢ (𝜑 → ( ∼ “ 𝑉) ⊆ 𝑉)

Assertion

Ref	Expression
qusin	⊢ (𝜑 → 𝑈 = (𝑅 /s ( ∼ ∩ (𝑉 × 𝑉))))

Proof of Theorem qusin

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		qusin.s	. . . . 5 ⊢ (𝜑 → ( ∼ “ 𝑉) ⊆ 𝑉)
2		ecinxp 8726	. . . . 5 ⊢ ((( ∼ “ 𝑉) ⊆ 𝑉 ∧ 𝑥 ∈ 𝑉) → [𝑥] ∼ = [𝑥]( ∼ ∩ (𝑉 × 𝑉)))
3	1, 2	sylan 580	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → [𝑥] ∼ = [𝑥]( ∼ ∩ (𝑉 × 𝑉)))
4	3	mpteq2dva 5188	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) = (𝑥 ∈ 𝑉 ↦ [𝑥]( ∼ ∩ (𝑉 × 𝑉))))
5	4	oveq1d 7368	. 2 ⊢ (𝜑 → ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) “s 𝑅) = ((𝑥 ∈ 𝑉 ↦ [𝑥]( ∼ ∩ (𝑉 × 𝑉))) “s 𝑅))
6		qusin.u	. . 3 ⊢ (𝜑 → 𝑈 = (𝑅 /s ∼ ))
7		qusin.v	. . 3 ⊢ (𝜑 → 𝑉 = (Base‘𝑅))
8		eqid 2729	. . 3 ⊢ (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )
9		qusin.e	. . 3 ⊢ (𝜑 → ∼ ∈ 𝑊)
10		qusin.r	. . 3 ⊢ (𝜑 → 𝑅 ∈ 𝑍)
11	6, 7, 8, 9, 10	qusval 17465	. 2 ⊢ (𝜑 → 𝑈 = ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) “s 𝑅))
12		eqidd 2730	. . 3 ⊢ (𝜑 → (𝑅 /s ( ∼ ∩ (𝑉 × 𝑉))) = (𝑅 /s ( ∼ ∩ (𝑉 × 𝑉))))
13		eqid 2729	. . 3 ⊢ (𝑥 ∈ 𝑉 ↦ [𝑥]( ∼ ∩ (𝑉 × 𝑉))) = (𝑥 ∈ 𝑉 ↦ [𝑥]( ∼ ∩ (𝑉 × 𝑉)))
14		inex1g 5261	. . . 4 ⊢ ( ∼ ∈ 𝑊 → ( ∼ ∩ (𝑉 × 𝑉)) ∈ V)
15	9, 14	syl 17	. . 3 ⊢ (𝜑 → ( ∼ ∩ (𝑉 × 𝑉)) ∈ V)
16	12, 7, 13, 15, 10	qusval 17465	. 2 ⊢ (𝜑 → (𝑅 /s ( ∼ ∩ (𝑉 × 𝑉))) = ((𝑥 ∈ 𝑉 ↦ [𝑥]( ∼ ∩ (𝑉 × 𝑉))) “s 𝑅))
17	5, 11, 16	3eqtr4d 2774	1 ⊢ (𝜑 → 𝑈 = (𝑅 /s ( ∼ ∩ (𝑉 × 𝑉))))

Syntax hints:   → wi 4   = wceq 1540   ∈ wcel 2109  Vcvv 3438   ∩ cin 3904   ⊆ wss 3905   ↦ cmpt 5176   × cxp 5621   “ cima 5626  ‘cfv 6486  (class class class)co 7353  [cec 8630  Basecbs 17139   “_s cimas 17427   /_s cqus 17428

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5238  ax-nul 5248  ax-pr 5374

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3397  df-v 3440  df-sbc 3745  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4479  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-iota 6442  df-fun 6488  df-fv 6494  df-ov 7356  df-oprab 7357  df-mpo 7358  df-ec 8634  df-qus 17432

This theorem is referenced by:  pi1addf  24964  pi1addval  24965  pi1grplem  24966