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

Theorem brrelex 5296
Description: A true binary relation on a relation implies the first argument is a set. (This is a property of our ordered pair definition.) (Contributed by NM, 18-May-2004.) (Revised by Mario Carneiro, 26-Apr-2015.)
Assertion
Ref Expression
brrelex ((Rel 𝑅𝐴𝑅𝐵) → 𝐴 ∈ V)

Proof of Theorem brrelex
StepHypRef Expression
1 brrelex12 5295 . 2 ((Rel 𝑅𝐴𝑅𝐵) → (𝐴 ∈ V ∧ 𝐵 ∈ V))
21simpld 482 1 ((Rel 𝑅𝐴𝑅𝐵) → 𝐴 ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 382  wcel 2145  Vcvv 3351   class class class wbr 4786  Rel wrel 5254
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-sep 4915  ax-nul 4923  ax-pr 5034
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3353  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-nul 4064  df-if 4226  df-sn 4317  df-pr 4319  df-op 4323  df-br 4787  df-opab 4847  df-xp 5255  df-rel 5256
This theorem is referenced by:  brrelexi  5298  posn  5327  frsn  5329  releldm  5496  relelrn  5497  relimasn  5629  funmo  6047  ertr  7911  dirtr  17444  issetssr  34595  frege129d  38581  nnfoctb  39734  clim2d  40423  climfv  40441  meadjiun  41200  caragenunicl  41258
  Copyright terms: Public domain W3C validator