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

Theorem inxpssres 5642
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 3957 . . . 4 𝐴𝐴
2 ssv 3959 . . . 4 𝐵 ⊆ V
3 xpss12 5640 . . . 4 ((𝐴𝐴𝐵 ⊆ V) → (𝐴 × 𝐵) ⊆ (𝐴 × V))
41, 2, 3mp2an 693 . . 3 (𝐴 × 𝐵) ⊆ (𝐴 × V)
5 sslin 4196 . . 3 ((𝐴 × 𝐵) ⊆ (𝐴 × V) → (𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ∩ (𝐴 × V)))
64, 5ax-mp 5 . 2 (𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ∩ (𝐴 × V))
7 df-res 5637 . 2 (𝑅𝐴) = (𝑅 ∩ (𝐴 × V))
86, 7sseqtrri 3984 1 (𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑅𝐴)
Colors of variables: wff setvar class
Syntax hints:  Vcvv 3441  cin 3901  wss 3902   × cxp 5623  cres 5627
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-rab 3401  df-v 3443  df-in 3909  df-ss 3919  df-opab 5162  df-xp 5631  df-res 5637
This theorem is referenced by:  ssrnres  6137  idreseqidinxp  38518  refrelsredund4  38919  refrelredund4  38922
  Copyright terms: Public domain W3C validator