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

Theorem ecinxp 8765
Description: Restrict the relation in an equivalence class to a base set. (Contributed by Mario Carneiro, 10-Jul-2015.)
Assertion
Ref Expression
ecinxp (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → [𝐵]𝑅 = [𝐵](𝑅 ∩ (𝐴 × 𝐴)))

Proof of Theorem ecinxp
StepHypRef Expression
1 simpr 484 . . . . . . . 8 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → 𝐵𝐴)
21snssd 4773 . . . . . . 7 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → {𝐵} ⊆ 𝐴)
3 dfss2 3932 . . . . . . 7 ({𝐵} ⊆ 𝐴 ↔ ({𝐵} ∩ 𝐴) = {𝐵})
42, 3sylib 218 . . . . . 6 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → ({𝐵} ∩ 𝐴) = {𝐵})
54imaeq2d 6031 . . . . 5 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → (𝑅 “ ({𝐵} ∩ 𝐴)) = (𝑅 “ {𝐵}))
65ineq1d 4182 . . . 4 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → ((𝑅 “ ({𝐵} ∩ 𝐴)) ∩ 𝐴) = ((𝑅 “ {𝐵}) ∩ 𝐴))
7 imass2 6073 . . . . . . 7 ({𝐵} ⊆ 𝐴 → (𝑅 “ {𝐵}) ⊆ (𝑅𝐴))
82, 7syl 17 . . . . . 6 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → (𝑅 “ {𝐵}) ⊆ (𝑅𝐴))
9 simpl 482 . . . . . 6 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → (𝑅𝐴) ⊆ 𝐴)
108, 9sstrd 3957 . . . . 5 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → (𝑅 “ {𝐵}) ⊆ 𝐴)
11 dfss2 3932 . . . . 5 ((𝑅 “ {𝐵}) ⊆ 𝐴 ↔ ((𝑅 “ {𝐵}) ∩ 𝐴) = (𝑅 “ {𝐵}))
1210, 11sylib 218 . . . 4 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → ((𝑅 “ {𝐵}) ∩ 𝐴) = (𝑅 “ {𝐵}))
136, 12eqtr2d 2765 . . 3 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → (𝑅 “ {𝐵}) = ((𝑅 “ ({𝐵} ∩ 𝐴)) ∩ 𝐴))
14 imainrect 6154 . . 3 ((𝑅 ∩ (𝐴 × 𝐴)) “ {𝐵}) = ((𝑅 “ ({𝐵} ∩ 𝐴)) ∩ 𝐴)
1513, 14eqtr4di 2782 . 2 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → (𝑅 “ {𝐵}) = ((𝑅 ∩ (𝐴 × 𝐴)) “ {𝐵}))
16 df-ec 8673 . 2 [𝐵]𝑅 = (𝑅 “ {𝐵})
17 df-ec 8673 . 2 [𝐵](𝑅 ∩ (𝐴 × 𝐴)) = ((𝑅 ∩ (𝐴 × 𝐴)) “ {𝐵})
1815, 16, 173eqtr4g 2789 1 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → [𝐵]𝑅 = [𝐵](𝑅 ∩ (𝐴 × 𝐴)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  cin 3913  wss 3914  {csn 4589   × cxp 5636  cima 5641  [cec 8669
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-11 2158  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387
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-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-br 5108  df-opab 5170  df-xp 5644  df-rel 5645  df-cnv 5646  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-ec 8673
This theorem is referenced by:  qsinxp  8766  qusin  17507  pi1addval  24948  pi1grplem  24949
  Copyright terms: Public domain W3C validator