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

Theorem brrelex12 4915
 Description: A true binary relation on a relation implies the arguments are sets. (This is a property of our ordered pair definition.) (Contributed by Mario Carneiro, 26-Apr-2015.)
Assertion
Ref Expression
brrelex12

Proof of Theorem brrelex12
StepHypRef Expression
1 df-rel 4885 . . . . 5
21biimpi 187 . . . 4
32ssbrd 4253 . . 3
43imp 419 . 2
5 brxp 4909 . 2
64, 5sylib 189 1
 Colors of variables: wff set class Syntax hints:   wi 4   wa 359   wcel 1725  cvv 2956   wss 3320   class class class wbr 4212   cxp 4876   wrel 4883 This theorem is referenced by:  brrelex  4916  brrelex2  4917  relbrcnvg  5243  ovprc  6108  brovex  6474  ersym  6917  relelec  6945  bren  7117  fpwwe2lem2  8507  fpwwelem  8520  fpwwe  8521  isstruct2  13478  brssc  14014  cofuval2  14084  isfull  14107  isfth  14111  isnat  14144  pslem  14638  efgrelexlema  15381  frgpuplem  15404  dvdsr  15751  tpsexOLD  16984  ulmval  20296  iseupa  21687  rngoablo2  22010  opelco3  25403  aovprc  28028  aovrcl  28029  oprabv  28085 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2417  ax-sep 4330  ax-nul 4338  ax-pr 4403 This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-clab 2423  df-cleq 2429  df-clel 2432  df-nfc 2561  df-ne 2601  df-ral 2710  df-rex 2711  df-rab 2714  df-v 2958  df-dif 3323  df-un 3325  df-in 3327  df-ss 3334  df-nul 3629  df-if 3740  df-sn 3820  df-pr 3821  df-op 3823  df-br 4213  df-opab 4267  df-xp 4884  df-rel 4885
 Copyright terms: Public domain W3C validator