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

Theorem breldm 4951
Description: Membership of first of a binary relation in a domain. (Contributed by NM, 30-Jul-1995.)
Hypotheses
Ref Expression
opeldm.1  |-  A  e. 
_V
opeldm.2  |-  B  e. 
_V
Assertion
Ref Expression
breldm  |-  ( A R B  ->  A  e.  dom  R )

Proof of Theorem breldm
StepHypRef Expression
1 df-br 4103 . 2  |-  ( A R B  <->  <. A ,  B >.  e.  R )
2 opeldm.1 . . 3  |-  A  e. 
_V
3 opeldm.2 . . 3  |-  B  e. 
_V
42, 3opeldm 4950 . 2  |-  ( <. A ,  B >.  e.  R  ->  A  e.  dom  R )
51, 4sylbi 121 1  |-  ( A R B  ->  A  e.  dom  R )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 2203   _Vcvv 2812   <.cop 3685   class class class wbr 4102   dom cdm 4740
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-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-v 2814  df-un 3214  df-sn 3688  df-pr 3689  df-op 3691  df-br 4103  df-dm 4750
This theorem is referenced by:  exse2  5127  funcnv3  5409  dff13  5932  reldmtpos  6475  rntpos  6479  dftpos4  6485  tpostpos  6486  iserd  6784  ntrivcvgap  12212
  Copyright terms: Public domain W3C validator