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

Theorem elqsn0 6672
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 6671 . 2  |-  ( ( dom  R  =  A  /\  B  e.  ( A /. R ) )  ->  E. x  x  e.  B )
2 n0r 3465 . 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 1364   E.wex 1506    e. wcel 2167    =/= wne 2367   (/)c0 3451   dom cdm 4664   /.cqs 6600
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-br 4035  df-opab 4096  df-xp 4670  df-cnv 4672  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-ec 6603  df-qs 6607
This theorem is referenced by:  0nnq  7448  0nsr  7833
  Copyright terms: Public domain W3C validator