ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  brm Unicode version

Theorem brm 4065
Description: If two sets are in a binary relation, the relation is inhabited. (Contributed by Jim Kingdon, 31-Dec-2023.)
Assertion
Ref Expression
brm  |-  ( A R B  ->  E. x  x  e.  R )
Distinct variable groups:    x, A    x, B    x, R

Proof of Theorem brm
StepHypRef Expression
1 df-br 4016 . 2  |-  ( A R B  <->  <. A ,  B >.  e.  R )
2 elex2 2765 . 2  |-  ( <. A ,  B >.  e.  R  ->  E. x  x  e.  R )
31, 2sylbi 121 1  |-  ( A R B  ->  E. x  x  e.  R )
Colors of variables: wff set class
Syntax hints:    -> wi 4   E.wex 1502    e. wcel 2158   <.cop 3607   class class class wbr 4015
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1457  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-ext 2169
This theorem depends on definitions:  df-bi 117  df-sb 1773  df-clab 2174  df-cleq 2180  df-clel 2183  df-v 2751  df-br 4016
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator