MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  qusin Structured version   Visualization version   GIF version

Theorem qusin 17766
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.
StepHypRef Expression
1 qusin.s . . . . 5 (𝜑 → ( ∼ “ 𝑉) ⊆ 𝑉)
2 ecinxp 8851 . . . . 5 ((( ∼ “ 𝑉) ⊆ 𝑉 ∧ 𝑥 ∈ 𝑉) → [𝑥] ∼ = [𝑥]( ∼ ∩ (𝑉 × 𝑉)))
31, 2sylan 592 . . . 4 ((𝜑 ∧ 𝑥 ∈ 𝑉) → [𝑥] ∼ = [𝑥]( ∼ ∩ (𝑉 × 𝑉)))
43mpteq2dva 5204 . . 3 (𝜑 → (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) = (𝑥 ∈ 𝑉 ↦ [𝑥]( ∼ ∩ (𝑉 × 𝑉))))
54oveq1d 7466 . 2 (𝜑 → ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) “s 𝑅) = ((𝑥 ∈ 𝑉 ↦ [𝑥]( ∼ ∩ (𝑉 × 𝑉))) “s 𝑅))
6 qusin.u . . 3 (𝜑 → 𝑈 = (𝑅 /s ∼ ))
7 qusin.v . . 3 (𝜑 → 𝑉 = (Base‘𝑅))
8 eqid 2763 . . 3 (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )
9 qusin.e . . 3 (𝜑 → ∼ ∈ 𝑊)
10 qusin.r . . 3 (𝜑 → 𝑅 ∈ 𝑍)
116, 7, 8, 9, 10qusval 17764 . 2 (𝜑 → 𝑈 = ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) “s 𝑅))
12 eqidd 2764 . . 3 (𝜑 → (𝑅 /s ( ∼ ∩ (𝑉 × 𝑉))) = (𝑅 /s ( ∼ ∩ (𝑉 × 𝑉))))
13 eqid 2763 . . 3 (𝑥 ∈ 𝑉 ↦ [𝑥]( ∼ ∩ (𝑉 × 𝑉))) = (𝑥 ∈ 𝑉 ↦ [𝑥]( ∼ ∩ (𝑉 × 𝑉)))
14 inex1g 5286 . . . 4 ( ∼ ∈ 𝑊 → ( ∼ ∩ (𝑉 × 𝑉)) ∈ V)
159, 14syl 18 . . 3 (𝜑 → ( ∼ ∩ (𝑉 × 𝑉)) ∈ V)
1612, 7, 13, 15, 10qusval 17764 . 2 (𝜑 → (𝑅 /s ( ∼ ∩ (𝑉 × 𝑉))) = ((𝑥 ∈ 𝑉 ↦ [𝑥]( ∼ ∩ (𝑉 × 𝑉))) “s 𝑅))
175, 11, 163eqtr4d 2808 1 (𝜑 → 𝑈 = (𝑅 /s ( ∼ ∩ (𝑉 × 𝑉))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092   ↦ cmpt 5192   × cxp 5656   “ cima 5661  ‘cfv 6566  (class class class)co 7451  [cec 8753  Basecbs 17431   “s cimas 17726   /s cqus 17727
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-ec 8757  df-qus 17731
This theorem is used by:  pi1addf  25423  pi1addval  25424  pi1grplem  25425  angmgmlem  29452
  Copyright terms: Public domain W3C validator