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

Theorem inxpssres 5677
Description: Intersection with a Cartesian product is a subclass of restriction. (Contributed by Peter Mazsa, 19-Jul-2019.)
Assertion
Ref Expression
inxpssres (𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑅𝐴)

Proof of Theorem inxpssres
StepHypRef Expression
1 ssid 3958 . . . 4 𝐴𝐴
2 ssv 3960 . . . 4 𝐵 ⊆ V
3 xpss12 5675 . . . 4 ((𝐴𝐴𝐵 ⊆ V) → (𝐴 × 𝐵) ⊆ (𝐴 × V))
41, 2, 3mp2an 704 . . 3 (𝐴 × 𝐵) ⊆ (𝐴 × V)
5 sslin 4194 . . 3 ((𝐴 × 𝐵) ⊆ (𝐴 × V) → (𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ∩ (𝐴 × V)))
64, 5ax-mp 5 . 2 (𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ∩ (𝐴 × V))
7 df-res 5672 . 2 (𝑅𝐴) = (𝑅 ∩ (𝐴 × V))
86, 7sseqtrri 3985 1 (𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑅𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  Vcvv 3454  cin 3903  wss 3904   × cxp 5658  cres 5662
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734
This proof depends on definitions:  df-bi 210  df-an 401  df-tru 1572  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3416  df-v 3456  df-in 3911  df-ss 3921  df-opab 5173  df-xp 5666  df-res 5672
This theorem is used by:  ssrnres  6175  idreseqidinxp  38992  refrelsredund4  39393  refrelredund4  39396
  Copyright terms: Public domain W3C validator