MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  imainss Structured version   Visualization version   GIF version

Theorem imainss 6154
Description: An upper bound for intersection with an image. Theorem 41 of [Suppes] p. 66. (Contributed by NM, 11-Aug-2004.)
Assertion
Ref Expression
imainss ((𝑅𝐴) ∩ 𝐵) ⊆ (𝑅 “ (𝐴 ∩ (𝑅𝐵)))

Proof of Theorem imainss
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 3479 . . . . . . . . . . 11 𝑦 ∈ V
2 vex 3479 . . . . . . . . . . 11 𝑥 ∈ V
31, 2brcnv 5883 . . . . . . . . . 10 (𝑦𝑅𝑥𝑥𝑅𝑦)
4 19.8a 2175 . . . . . . . . . 10 ((𝑦𝐵𝑦𝑅𝑥) → ∃𝑦(𝑦𝐵𝑦𝑅𝑥))
53, 4sylan2br 596 . . . . . . . . 9 ((𝑦𝐵𝑥𝑅𝑦) → ∃𝑦(𝑦𝐵𝑦𝑅𝑥))
65ancoms 460 . . . . . . . 8 ((𝑥𝑅𝑦𝑦𝐵) → ∃𝑦(𝑦𝐵𝑦𝑅𝑥))
76anim2i 618 . . . . . . 7 ((𝑥𝐴 ∧ (𝑥𝑅𝑦𝑦𝐵)) → (𝑥𝐴 ∧ ∃𝑦(𝑦𝐵𝑦𝑅𝑥)))
8 simprl 770 . . . . . . 7 ((𝑥𝐴 ∧ (𝑥𝑅𝑦𝑦𝐵)) → 𝑥𝑅𝑦)
97, 8jca 513 . . . . . 6 ((𝑥𝐴 ∧ (𝑥𝑅𝑦𝑦𝐵)) → ((𝑥𝐴 ∧ ∃𝑦(𝑦𝐵𝑦𝑅𝑥)) ∧ 𝑥𝑅𝑦))
109anassrs 469 . . . . 5 (((𝑥𝐴𝑥𝑅𝑦) ∧ 𝑦𝐵) → ((𝑥𝐴 ∧ ∃𝑦(𝑦𝐵𝑦𝑅𝑥)) ∧ 𝑥𝑅𝑦))
11 elin 3965 . . . . . . 7 (𝑥 ∈ (𝐴 ∩ (𝑅𝐵)) ↔ (𝑥𝐴𝑥 ∈ (𝑅𝐵)))
122elima2 6066 . . . . . . . 8 (𝑥 ∈ (𝑅𝐵) ↔ ∃𝑦(𝑦𝐵𝑦𝑅𝑥))
1312anbi2i 624 . . . . . . 7 ((𝑥𝐴𝑥 ∈ (𝑅𝐵)) ↔ (𝑥𝐴 ∧ ∃𝑦(𝑦𝐵𝑦𝑅𝑥)))
1411, 13bitri 275 . . . . . 6 (𝑥 ∈ (𝐴 ∩ (𝑅𝐵)) ↔ (𝑥𝐴 ∧ ∃𝑦(𝑦𝐵𝑦𝑅𝑥)))
1514anbi1i 625 . . . . 5 ((𝑥 ∈ (𝐴 ∩ (𝑅𝐵)) ∧ 𝑥𝑅𝑦) ↔ ((𝑥𝐴 ∧ ∃𝑦(𝑦𝐵𝑦𝑅𝑥)) ∧ 𝑥𝑅𝑦))
1610, 15sylibr 233 . . . 4 (((𝑥𝐴𝑥𝑅𝑦) ∧ 𝑦𝐵) → (𝑥 ∈ (𝐴 ∩ (𝑅𝐵)) ∧ 𝑥𝑅𝑦))
1716eximi 1838 . . 3 (∃𝑥((𝑥𝐴𝑥𝑅𝑦) ∧ 𝑦𝐵) → ∃𝑥(𝑥 ∈ (𝐴 ∩ (𝑅𝐵)) ∧ 𝑥𝑅𝑦))
181elima2 6066 . . . . 5 (𝑦 ∈ (𝑅𝐴) ↔ ∃𝑥(𝑥𝐴𝑥𝑅𝑦))
1918anbi1i 625 . . . 4 ((𝑦 ∈ (𝑅𝐴) ∧ 𝑦𝐵) ↔ (∃𝑥(𝑥𝐴𝑥𝑅𝑦) ∧ 𝑦𝐵))
20 elin 3965 . . . 4 (𝑦 ∈ ((𝑅𝐴) ∩ 𝐵) ↔ (𝑦 ∈ (𝑅𝐴) ∧ 𝑦𝐵))
21 19.41v 1954 . . . 4 (∃𝑥((𝑥𝐴𝑥𝑅𝑦) ∧ 𝑦𝐵) ↔ (∃𝑥(𝑥𝐴𝑥𝑅𝑦) ∧ 𝑦𝐵))
2219, 20, 213bitr4i 303 . . 3 (𝑦 ∈ ((𝑅𝐴) ∩ 𝐵) ↔ ∃𝑥((𝑥𝐴𝑥𝑅𝑦) ∧ 𝑦𝐵))
231elima2 6066 . . 3 (𝑦 ∈ (𝑅 “ (𝐴 ∩ (𝑅𝐵))) ↔ ∃𝑥(𝑥 ∈ (𝐴 ∩ (𝑅𝐵)) ∧ 𝑥𝑅𝑦))
2417, 22, 233imtr4i 292 . 2 (𝑦 ∈ ((𝑅𝐴) ∩ 𝐵) → 𝑦 ∈ (𝑅 “ (𝐴 ∩ (𝑅𝐵))))
2524ssriv 3987 1 ((𝑅𝐴) ∩ 𝐵) ⊆ (𝑅 “ (𝐴 ∩ (𝑅𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wa 397  wex 1782  wcel 2107  cin 3948  wss 3949   class class class wbr 5149  ccnv 5676  cima 5680
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 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pr 5428
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-br 5150  df-opab 5212  df-xp 5683  df-cnv 5685  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator