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

Theorem idinxpssinxp 37490
Description: Two ways to say that intersections with Cartesian products are in a subclass relation, special case of inxpss2 37488. (Contributed by Peter Mazsa, 6-Mar-2019.)
Assertion
Ref Expression
idinxpssinxp (( I ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ∩ (𝐴 × 𝐵)) ↔ ∀𝑥𝐴𝑦𝐵 (𝑥 = 𝑦𝑥𝑅𝑦))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝑅,𝑦

Proof of Theorem idinxpssinxp
StepHypRef Expression
1 inxpss2 37488 . 2 (( I ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ∩ (𝐴 × 𝐵)) ↔ ∀𝑥𝐴𝑦𝐵 (𝑥 I 𝑦𝑥𝑅𝑦))
2 ideqg 5851 . . . . 5 (𝑦 ∈ V → (𝑥 I 𝑦𝑥 = 𝑦))
32elv 3479 . . . 4 (𝑥 I 𝑦𝑥 = 𝑦)
43imbi1i 349 . . 3 ((𝑥 I 𝑦𝑥𝑅𝑦) ↔ (𝑥 = 𝑦𝑥𝑅𝑦))
542ralbii 3127 . 2 (∀𝑥𝐴𝑦𝐵 (𝑥 I 𝑦𝑥𝑅𝑦) ↔ ∀𝑥𝐴𝑦𝐵 (𝑥 = 𝑦𝑥𝑅𝑦))
61, 5bitri 275 1 (( I ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ∩ (𝐴 × 𝐵)) ↔ ∀𝑥𝐴𝑦𝐵 (𝑥 = 𝑦𝑥𝑅𝑦))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wral 3060  Vcvv 3473  cin 3947  wss 3948   class class class wbr 5148   I cid 5573   × cxp 5674
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 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-ext 2702  ax-sep 5299  ax-nul 5306  ax-pr 5427
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-sb 2067  df-clab 2709  df-cleq 2723  df-clel 2809  df-ral 3061  df-rex 3070  df-rab 3432  df-v 3475  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-br 5149  df-opab 5211  df-id 5574  df-xp 5682  df-rel 5683
This theorem is referenced by:  idinxpssinxp4  37493
  Copyright terms: Public domain W3C validator