Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  inxpss2 Structured version   Visualization version   GIF version

Theorem inxpss2 38349
Description: Two ways to say that intersections with Cartesian products are in a subclass relation. (Contributed by Peter Mazsa, 8-Mar-2019.)
Assertion
Ref Expression
inxpss2 ((𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑆 ∩ (𝐴 × 𝐵)) ↔ ∀𝑥𝐴𝑦𝐵 (𝑥𝑅𝑦𝑥𝑆𝑦))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝑅,𝑦   𝑥,𝑆,𝑦

Proof of Theorem inxpss2
StepHypRef Expression
1 relinxp 5749 . . 3 Rel (𝑅 ∩ (𝐴 × 𝐵))
2 ssrel3 5721 . . 3 (Rel (𝑅 ∩ (𝐴 × 𝐵)) → ((𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑆 ∩ (𝐴 × 𝐵)) ↔ ∀𝑥𝑦(𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦𝑥(𝑆 ∩ (𝐴 × 𝐵))𝑦)))
31, 2ax-mp 5 . 2 ((𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑆 ∩ (𝐴 × 𝐵)) ↔ ∀𝑥𝑦(𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦𝑥(𝑆 ∩ (𝐴 × 𝐵))𝑦))
4 inxpss3 38348 . 2 (∀𝑥𝑦(𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦𝑥(𝑆 ∩ (𝐴 × 𝐵))𝑦) ↔ ∀𝑥𝐴𝑦𝐵 (𝑥𝑅𝑦𝑥𝑆𝑦))
53, 4bitri 275 1 ((𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑆 ∩ (𝐴 × 𝐵)) ↔ ∀𝑥𝐴𝑦𝐵 (𝑥𝑅𝑦𝑥𝑆𝑦))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wal 1539  wral 3047  cin 3896  wss 3897   class class class wbr 5086   × cxp 5609  Rel wrel 5616
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-ext 2703  ax-sep 5229  ax-nul 5239  ax-pr 5365
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4279  df-if 4471  df-sn 4572  df-pr 4574  df-op 4578  df-br 5087  df-opab 5149  df-xp 5617  df-rel 5618
This theorem is referenced by:  inxpssidinxp  38350  idinxpssinxp  38351
  Copyright terms: Public domain W3C validator