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

Theorem inxpssres 5667
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 3930 . . . 4 𝐴 ⊆ 𝐴
2 ssv 3932 . . . 4 𝐵 ⊆ V
3 xpss12 5665 . . . 4 ((𝐴 ⊆ 𝐴 ∧ 𝐵 ⊆ V) → (𝐴 × 𝐵) ⊆ (𝐴 × V))
41, 2, 3mp2an 705 . . 3 (𝐴 × 𝐵) ⊆ (𝐴 × V)
5 sslin 4139 . . 3 ((𝐴 × 𝐵) ⊆ (𝐴 × V) → (𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ∩ (𝐴 × V)))
64, 5ax-mp 5 . 2 (𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ∩ (𝐴 × V))
7 df-res 5662 . 2 (𝑅 ↾ 𝐴) = (𝑅 ∩ (𝐴 × V))
86, 7sseqtrri 3957 1 (𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ↾ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  Vcvv 3450   ⊆ wss 3895   ∩ cin 4089   × cxp 5648   ↾ cres 5652
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3896  df-in 4091  df-opab 5167  df-xp 5656  df-res 5662
This theorem is used by:  ssrnres  6169  idreseqidinxp  39290  refrelsredund4  39691  refrelredund4  39694
  Copyright terms: Public domain W3C validator