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

Theorem inxpssres 5672
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 3935 . . . 4 𝐴 ⊆ 𝐴
2 ssv 3937 . . . 4 𝐵 ⊆ V
3 xpss12 5670 . . . 4 ((𝐴 ⊆ 𝐴 ∧ 𝐵 ⊆ V) → (𝐴 × 𝐵) ⊆ (𝐴 × V))
41, 2, 3mp2an 705 . . 3 (𝐴 × 𝐵) ⊆ (𝐴 × V)
5 sslin 4142 . . 3 ((𝐴 × 𝐵) ⊆ (𝐴 × V) → (𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ∩ (𝐴 × V)))
64, 5ax-mp 5 . 2 (𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ∩ (𝐴 × V))
7 df-res 5667 . 2 (𝑅 ↾ 𝐴) = (𝑅 ∩ (𝐴 × V))
86, 7sseqtrri 3962 1 (𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ↾ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092   × cxp 5653   ↾ cres 5657
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-in 4094  df-opab 5171  df-xp 5661  df-res 5667
This theorem is used by:  ssrnres  6181  idreseqidinxp  39438  refrelsredund4  39839  refrelredund4  39842
  Copyright terms: Public domain W3C validator