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

Theorem brrelex12 5689
Description: Two classes related by a binary relation are sets. (Contributed by Mario Carneiro, 26-Apr-2015.)
Assertion
Ref Expression
brrelex12 ((Rel 𝑅𝐴𝑅𝐵) → (𝐴 ∈ V ∧ 𝐵 ∈ V))

Proof of Theorem brrelex12
StepHypRef Expression
1 df-rel 5645 . . . . 5 (Rel 𝑅𝑅 ⊆ (V × V))
21biimpi 215 . . . 4 (Rel 𝑅𝑅 ⊆ (V × V))
32ssbrd 5153 . . 3 (Rel 𝑅 → (𝐴𝑅𝐵𝐴(V × V)𝐵))
43imp 407 . 2 ((Rel 𝑅𝐴𝑅𝐵) → 𝐴(V × V)𝐵)
5 brxp 5686 . 2 (𝐴(V × V)𝐵 ↔ (𝐴 ∈ V ∧ 𝐵 ∈ V))
64, 5sylib 217 1 ((Rel 𝑅𝐴𝑅𝐵) → (𝐴 ∈ V ∧ 𝐵 ∈ V))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  wcel 2106  Vcvv 3446  wss 3913   class class class wbr 5110   × cxp 5636  Rel wrel 5643
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2702  ax-sep 5261  ax-nul 5268  ax-pr 5389
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2709  df-cleq 2723  df-clel 2809  df-ral 3061  df-rex 3070  df-rab 3406  df-v 3448  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4288  df-if 4492  df-sn 4592  df-pr 4594  df-op 4598  df-br 5111  df-opab 5173  df-xp 5644  df-rel 5645
This theorem is referenced by:  brrelex1  5690  brrelex2  5691  brrelex12i  5692  relbrcnvg  6062  brovex  8158  ersym  8667  relelec  8700  fpwwe2lem2  10577  fpwwelem  10590  cofuval2  17787  isnat  17848  pslem  18475  frgpuplem  19568  perpln1  27715  perpln2  27716  poprelb  45836
  Copyright terms: Public domain W3C validator