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

Theorem inxpss3 36033
 Description: Two ways to say that an intersection with a Cartesian product is a subclass (see also inxpss 36031). (Contributed by Peter Mazsa, 8-Mar-2019.)
Assertion
Ref Expression
inxpss3 (∀𝑥𝑦(𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦𝑥(𝑆 ∩ (𝐴 × 𝐵))𝑦) ↔ ∀𝑥𝐴𝑦𝐵 (𝑥𝑅𝑦𝑥𝑆𝑦))
Distinct variable groups:   𝑥,𝑦   𝑦,𝐴
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥,𝑦)   𝑅(𝑥,𝑦)   𝑆(𝑥,𝑦)

Proof of Theorem inxpss3
StepHypRef Expression
1 brinxp2 5598 . . . . 5 (𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦 ↔ ((𝑥𝐴𝑦𝐵) ∧ 𝑥𝑅𝑦))
2 brinxp2 5598 . . . . 5 (𝑥(𝑆 ∩ (𝐴 × 𝐵))𝑦 ↔ ((𝑥𝐴𝑦𝐵) ∧ 𝑥𝑆𝑦))
31, 2imbi12i 354 . . . 4 ((𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦𝑥(𝑆 ∩ (𝐴 × 𝐵))𝑦) ↔ (((𝑥𝐴𝑦𝐵) ∧ 𝑥𝑅𝑦) → ((𝑥𝐴𝑦𝐵) ∧ 𝑥𝑆𝑦)))
4 imdistan 571 . . . 4 (((𝑥𝐴𝑦𝐵) → (𝑥𝑅𝑦𝑥𝑆𝑦)) ↔ (((𝑥𝐴𝑦𝐵) ∧ 𝑥𝑅𝑦) → ((𝑥𝐴𝑦𝐵) ∧ 𝑥𝑆𝑦)))
53, 4bitr4i 281 . . 3 ((𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦𝑥(𝑆 ∩ (𝐴 × 𝐵))𝑦) ↔ ((𝑥𝐴𝑦𝐵) → (𝑥𝑅𝑦𝑥𝑆𝑦)))
652albii 1822 . 2 (∀𝑥𝑦(𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦𝑥(𝑆 ∩ (𝐴 × 𝐵))𝑦) ↔ ∀𝑥𝑦((𝑥𝐴𝑦𝐵) → (𝑥𝑅𝑦𝑥𝑆𝑦)))
7 r2al 3130 . 2 (∀𝑥𝐴𝑦𝐵 (𝑥𝑅𝑦𝑥𝑆𝑦) ↔ ∀𝑥𝑦((𝑥𝐴𝑦𝐵) → (𝑥𝑅𝑦𝑥𝑆𝑦)))
86, 7bitr4i 281 1 (∀𝑥𝑦(𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦𝑥(𝑆 ∩ (𝐴 × 𝐵))𝑦) ↔ ∀𝑥𝐴𝑦𝐵 (𝑥𝑅𝑦𝑥𝑆𝑦))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399  ∀wal 1536   ∈ wcel 2111  ∀wral 3070   ∩ cin 3857   class class class wbr 5032   × cxp 5522 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-ext 2729  ax-sep 5169  ax-nul 5176  ax-pr 5298 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-sb 2070  df-clab 2736  df-cleq 2750  df-clel 2830  df-ral 3075  df-rex 3076  df-v 3411  df-dif 3861  df-un 3863  df-in 3865  df-nul 4226  df-if 4421  df-sn 4523  df-pr 4525  df-op 4529  df-br 5033  df-opab 5095  df-xp 5530 This theorem is referenced by:  inxpss2  36034
 Copyright terms: Public domain W3C validator