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

Theorem elqsn0 6868
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 6867 . 2  |-  ( ( dom  R  =  A  /\  B  e.  ( A /. R ) )  ->  E. x  x  e.  B )
2 n0r 3535 . 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 1402   E.wex 1545    e. wcel 2209    =/= wne 2420   (/)c0 3520   dom cdm 4769   /.cqs 6796
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-br 4126  df-opab 4188  df-xp 4775  df-cnv 4777  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-ec 6799  df-qs 6803
This theorem is referenced by:  0nnq  7721  0nsr  8106
  Copyright terms: Public domain W3C validator