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

Theorem brrelex2 4909
 Description: A true binary relation on a relation implies the second argument is a set. (This is a property of our ordered pair definition.) (Contributed by Mario Carneiro, 26-Apr-2015.)
Assertion
Ref Expression
brrelex2

Proof of Theorem brrelex2
StepHypRef Expression
1 brrelex12 4907 . 2
21simprd 450 1
 Colors of variables: wff set class Syntax hints:   wi 4   wa 359   wcel 1725  cvv 2948   class class class wbr 4204   wrel 4875 This theorem is referenced by:  brrelex2i  4911  releldm  5094  relelrn  5095  elrelimasn  5220  funbrfv  5757  relbrtpos  6482  ertr  6912  erth  6941  pslem  14630 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 2416  ax-sep 4322  ax-nul 4330  ax-pr 4395 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 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ne 2600  df-ral 2702  df-rex 2703  df-rab 2706  df-v 2950  df-dif 3315  df-un 3317  df-in 3319  df-ss 3326  df-nul 3621  df-if 3732  df-sn 3812  df-pr 3813  df-op 3815  df-br 4205  df-opab 4259  df-xp 4876  df-rel 4877
 Copyright terms: Public domain W3C validator