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

Theorem relsn2 5605
Description: A singleton is a relation iff it has a nonempty domain. (Contributed by NM, 25-Sep-2013.)
Hypothesis
Ref Expression
relsn2.1  |-  A  e. 
_V
Assertion
Ref Expression
relsn2  |-  ( Rel 
{ A }  <->  dom  { A }  =/=  (/) )

Proof of Theorem relsn2
StepHypRef Expression
1 relsn2.1 . . 3  |-  A  e. 
_V
21relsn 5223 . 2  |-  ( Rel 
{ A }  <->  A  e.  ( _V  X.  _V )
)
3 dmsnn0 5600 . 2  |-  ( A  e.  ( _V  X.  _V )  <->  dom  { A }  =/=  (/) )
42, 3bitri 264 1  |-  ( Rel 
{ A }  <->  dom  { A }  =/=  (/) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 196    e. wcel 1990    =/= wne 2794   _Vcvv 3200   (/)c0 3915   {csn 4177    X. cxp 5112   dom cdm 5114   Rel wrel 5119
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-xp 5120  df-rel 5121  df-dm 5124
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator