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

Theorem elqsn0 6768
Description: A quotient set doesn't contain the empty set. (Contributed by NM, 24-Aug-1995.)
Assertion
Ref Expression
elqsn0  |-  ( ( dom  R  =  A  /\  B  e.  ( A /. R ) )  ->  B  =/=  (/) )

Proof of Theorem elqsn0
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 elqsn0m 6767 . 2  |-  ( ( dom  R  =  A  /\  B  e.  ( A /. R ) )  ->  E. x  x  e.  B )
2 n0r 3506 . 2  |-  ( E. x  x  e.  B  ->  B  =/=  (/) )
31, 2syl 14 1  |-  ( ( dom  R  =  A  /\  B  e.  ( A /. R ) )  ->  B  =/=  (/) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395   E.wex 1538    e. wcel 2200    =/= wne 2400   (/)c0 3492   dom cdm 4723   /.cqs 6696
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-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-v 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-br 4087  df-opab 4149  df-xp 4729  df-cnv 4731  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-ec 6699  df-qs 6703
This theorem is referenced by:  0nnq  7574  0nsr  7959
  Copyright terms: Public domain W3C validator