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

Theorem elqsn0 6851
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 6850 . 2  |-  ( ( dom  R  =  A  /\  B  e.  ( A /. R ) )  ->  E. x  x  e.  B )
2 n0r 3526 . 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 1398   E.wex 1541    e. wcel 2205    =/= wne 2414   (/)c0 3512   dom cdm 4754   /.cqs 6779
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 619  ax-in2 620  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-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-br 4115  df-opab 4177  df-xp 4760  df-cnv 4762  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-ec 6782  df-qs 6786
This theorem is referenced by:  0nnq  7695  0nsr  8080
  Copyright terms: Public domain W3C validator