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

Theorem inxpss 38267
Description: Two ways to say that an intersection with a Cartesian product is a subclass. (Contributed by Peter Mazsa, 16-Jul-2019.)
Assertion
Ref Expression
inxpss ((𝑅 ∩ (𝐴 × 𝐵)) ⊆ 𝑆 ↔ ∀𝑥𝐴𝑦𝐵 (𝑥𝑅𝑦𝑥𝑆𝑦))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝑅,𝑦   𝑥,𝑆,𝑦

Proof of Theorem inxpss
StepHypRef Expression
1 brinxp2 5777 . . . . 5 (𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦 ↔ ((𝑥𝐴𝑦𝐵) ∧ 𝑥𝑅𝑦))
21imbi1i 349 . . . 4 ((𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦𝑥𝑆𝑦) ↔ (((𝑥𝐴𝑦𝐵) ∧ 𝑥𝑅𝑦) → 𝑥𝑆𝑦))
3 impexp 450 . . . 4 ((((𝑥𝐴𝑦𝐵) ∧ 𝑥𝑅𝑦) → 𝑥𝑆𝑦) ↔ ((𝑥𝐴𝑦𝐵) → (𝑥𝑅𝑦𝑥𝑆𝑦)))
42, 3bitri 275 . . 3 ((𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦𝑥𝑆𝑦) ↔ ((𝑥𝐴𝑦𝐵) → (𝑥𝑅𝑦𝑥𝑆𝑦)))
542albii 1818 . 2 (∀𝑥𝑦(𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦𝑥𝑆𝑦) ↔ ∀𝑥𝑦((𝑥𝐴𝑦𝐵) → (𝑥𝑅𝑦𝑥𝑆𝑦)))
6 relinxp 5838 . . 3 Rel (𝑅 ∩ (𝐴 × 𝐵))
7 ssrel3 5810 . . 3 (Rel (𝑅 ∩ (𝐴 × 𝐵)) → ((𝑅 ∩ (𝐴 × 𝐵)) ⊆ 𝑆 ↔ ∀𝑥𝑦(𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦𝑥𝑆𝑦)))
86, 7ax-mp 5 . 2 ((𝑅 ∩ (𝐴 × 𝐵)) ⊆ 𝑆 ↔ ∀𝑥𝑦(𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦𝑥𝑆𝑦))
9 r2al 3201 . 2 (∀𝑥𝐴𝑦𝐵 (𝑥𝑅𝑦𝑥𝑆𝑦) ↔ ∀𝑥𝑦((𝑥𝐴𝑦𝐵) → (𝑥𝑅𝑦𝑥𝑆𝑦)))
105, 8, 93bitr4i 303 1 ((𝑅 ∩ (𝐴 × 𝐵)) ⊆ 𝑆 ↔ ∀𝑥𝐴𝑦𝐵 (𝑥𝑅𝑦𝑥𝑆𝑦))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wal 1535  wcel 2108  wral 3067  cin 3975  wss 3976   class class class wbr 5166   × cxp 5698  Rel wrel 5705
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-br 5167  df-opab 5229  df-xp 5706  df-rel 5707
This theorem is referenced by:  idinxpss  38268
  Copyright terms: Public domain W3C validator