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

Theorem qusin 17546
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 8758 . . . . 5 ((( 𝑉) ⊆ 𝑉𝑥𝑉) → [𝑥] = [𝑥]( ∩ (𝑉 × 𝑉)))
31, 2sylan 588 . . . 4 ((𝜑𝑥𝑉) → [𝑥] = [𝑥]( ∩ (𝑉 × 𝑉)))
43mpteq2dva 5183 . . 3 (𝜑 → (𝑥𝑉 ↦ [𝑥] ) = (𝑥𝑉 ↦ [𝑥]( ∩ (𝑉 × 𝑉))))
54oveq1d 7396 . 2 (𝜑 → ((𝑥𝑉 ↦ [𝑥] ) “s 𝑅) = ((𝑥𝑉 ↦ [𝑥]( ∩ (𝑉 × 𝑉))) “s 𝑅))
6 qusin.u . . 3 (𝜑𝑈 = (𝑅 /s ))
7 qusin.v . . 3 (𝜑𝑉 = (Base‘𝑅))
8 eqid 2752 . . 3 (𝑥𝑉 ↦ [𝑥] ) = (𝑥𝑉 ↦ [𝑥] )
9 qusin.e . . 3 (𝜑𝑊)
10 qusin.r . . 3 (𝜑𝑅𝑍)
116, 7, 8, 9, 10qusval 17544 . 2 (𝜑𝑈 = ((𝑥𝑉 ↦ [𝑥] ) “s 𝑅))
12 eqidd 2753 . . 3 (𝜑 → (𝑅 /s ( ∩ (𝑉 × 𝑉))) = (𝑅 /s ( ∩ (𝑉 × 𝑉))))
13 eqid 2752 . . 3 (𝑥𝑉 ↦ [𝑥]( ∩ (𝑉 × 𝑉))) = (𝑥𝑉 ↦ [𝑥]( ∩ (𝑉 × 𝑉)))
14 inex1g 5265 . . . 4 ( 𝑊 → ( ∩ (𝑉 × 𝑉)) ∈ V)
159, 14syl 17 . . 3 (𝜑 → ( ∩ (𝑉 × 𝑉)) ∈ V)
1612, 7, 13, 15, 10qusval 17544 . 2 (𝜑 → (𝑅 /s ( ∩ (𝑉 × 𝑉))) = ((𝑥𝑉 ↦ [𝑥]( ∩ (𝑉 × 𝑉))) “s 𝑅))
175, 11, 163eqtr4d 2797 1 (𝜑𝑈 = (𝑅 /s ( ∩ (𝑉 × 𝑉))))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1550  wcel 2132  Vcvv 3444  cin 3894  wss 3895  cmpt 5171   × cxp 5634  cima 5639  cfv 6506  (class class class)co 7381  [cec 8660  Basecbs 17217  s cimas 17506   /s cqus 17507
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-10 2165  ax-11 2181  ax-12 2202  ax-ext 2724  ax-sep 5236  ax-nul 5246  ax-pr 5380
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1553  df-fal 1563  df-ex 1790  df-nf 1794  df-sb 2081  df-mo 2556  df-eu 2586  df-clab 2731  df-cleq 2744  df-clel 2827  df-nfc 2901  df-ne 2948  df-ral 3067  df-rex 3077  df-rab 3405  df-v 3446  df-sbc 3736  df-dif 3898  df-un 3900  df-in 3902  df-ss 3912  df-nul 4277  df-if 4471  df-sn 4573  df-pr 4575  df-op 4579  df-uni 4856  df-br 5091  df-opab 5153  df-mpt 5172  df-id 5531  df-xp 5642  df-rel 5643  df-cnv 5644  df-co 5645  df-dm 5646  df-rn 5647  df-res 5648  df-ima 5649  df-iota 6462  df-fun 6508  df-fv 6514  df-ov 7384  df-oprab 7385  df-mpo 7386  df-ec 8664  df-qus 17511
This theorem is referenced by:  pi1addf  25078  pi1addval  25079  pi1grplem  25080
  Copyright terms: Public domain W3C validator