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

Theorem ecinxp 8850
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 4834 . . . . . . 7 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → {𝐵} ⊆ 𝐴)
3 dfss2 3994 . . . . . . 7 ({𝐵} ⊆ 𝐴 ↔ ({𝐵} ∩ 𝐴) = {𝐵})
42, 3sylib 218 . . . . . 6 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → ({𝐵} ∩ 𝐴) = {𝐵})
54imaeq2d 6089 . . . . 5 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → (𝑅 “ ({𝐵} ∩ 𝐴)) = (𝑅 “ {𝐵}))
65ineq1d 4240 . . . 4 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → ((𝑅 “ ({𝐵} ∩ 𝐴)) ∩ 𝐴) = ((𝑅 “ {𝐵}) ∩ 𝐴))
7 imass2 6132 . . . . . . 7 ({𝐵} ⊆ 𝐴 → (𝑅 “ {𝐵}) ⊆ (𝑅𝐴))
82, 7syl 17 . . . . . 6 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → (𝑅 “ {𝐵}) ⊆ (𝑅𝐴))
9 simpl 482 . . . . . 6 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → (𝑅𝐴) ⊆ 𝐴)
108, 9sstrd 4019 . . . . 5 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → (𝑅 “ {𝐵}) ⊆ 𝐴)
11 dfss2 3994 . . . . 5 ((𝑅 “ {𝐵}) ⊆ 𝐴 ↔ ((𝑅 “ {𝐵}) ∩ 𝐴) = (𝑅 “ {𝐵}))
1210, 11sylib 218 . . . 4 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → ((𝑅 “ {𝐵}) ∩ 𝐴) = (𝑅 “ {𝐵}))
136, 12eqtr2d 2781 . . 3 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → (𝑅 “ {𝐵}) = ((𝑅 “ ({𝐵} ∩ 𝐴)) ∩ 𝐴))
14 imainrect 6212 . . 3 ((𝑅 ∩ (𝐴 × 𝐴)) “ {𝐵}) = ((𝑅 “ ({𝐵} ∩ 𝐴)) ∩ 𝐴)
1513, 14eqtr4di 2798 . 2 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → (𝑅 “ {𝐵}) = ((𝑅 ∩ (𝐴 × 𝐴)) “ {𝐵}))
16 df-ec 8765 . 2 [𝐵]𝑅 = (𝑅 “ {𝐵})
17 df-ec 8765 . 2 [𝐵](𝑅 ∩ (𝐴 × 𝐴)) = ((𝑅 ∩ (𝐴 × 𝐴)) “ {𝐵})
1815, 16, 173eqtr4g 2805 1 (((𝑅𝐴) ⊆ 𝐴𝐵𝐴) → [𝐵]𝑅 = [𝐵](𝑅 ∩ (𝐴 × 𝐴)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2108  cin 3975  wss 3976  {csn 4648   × cxp 5698  cima 5703  [cec 8761
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-11 2158  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-br 5167  df-opab 5229  df-xp 5706  df-rel 5707  df-cnv 5708  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-ec 8765
This theorem is referenced by:  qsinxp  8851  qusin  17604  pi1addval  25100  pi1grplem  25101
  Copyright terms: Public domain W3C validator