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 36005
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 5657 . . 3 Rel (𝑅 ∩ (𝐴 × 𝐵))
2 ssrel3 35989 . . 3 (Rel (𝑅 ∩ (𝐴 × 𝐵)) → ((𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑆 ∩ (𝐴 × 𝐵)) ↔ ∀𝑥𝑦(𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦𝑥(𝑆 ∩ (𝐴 × 𝐵))𝑦)))
31, 2ax-mp 5 . 2 ((𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑆 ∩ (𝐴 × 𝐵)) ↔ ∀𝑥𝑦(𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦𝑥(𝑆 ∩ (𝐴 × 𝐵))𝑦))
4 inxpss3 36004 . 2 (∀𝑥𝑦(𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦𝑥(𝑆 ∩ (𝐴 × 𝐵))𝑦) ↔ ∀𝑥𝐴𝑦𝐵 (𝑥𝑅𝑦𝑥𝑆𝑦))
53, 4bitri 278 1 ((𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑆 ∩ (𝐴 × 𝐵)) ↔ ∀𝑥𝐴𝑦𝐵 (𝑥𝑅𝑦𝑥𝑆𝑦))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wal 1537  wral 3071  cin 3858  wss 3859   class class class wbr 5033   × cxp 5523  Rel wrel 5530
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2114  ax-9 2122  ax-12 2176  ax-ext 2730  ax-sep 5170  ax-nul 5177  ax-pr 5299
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 846  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2071  df-clab 2737  df-cleq 2751  df-clel 2831  df-ral 3076  df-rex 3077  df-rab 3080  df-v 3412  df-dif 3862  df-un 3864  df-in 3866  df-ss 3876  df-nul 4227  df-if 4422  df-sn 4524  df-pr 4526  df-op 4530  df-br 5034  df-opab 5096  df-xp 5531  df-rel 5532
This theorem is referenced by:  inxpssidinxp  36006  idinxpssinxp  36007
  Copyright terms: Public domain W3C validator