HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem 0nelqs 4298
Description: A quotient set doesn't contain the empty set.
Hypothesis
Ref Expression
0nelqs.1 |- dom R = A
Assertion
Ref Expression
0nelqs |- -. (/) e. (A/.R)

Proof of Theorem 0nelqs
StepHypRef Expression
1 visset 1813 . . . . . . 7 |- x e. V
21ecdmn0 4280 . . . . . 6 |- (x e. dom R <-> -. [x]R = (/))
3 0nelqs.1 . . . . . . 7 |- dom R = A
43eleq2i 1538 . . . . . 6 |- (x e. dom R <-> x e. A)
5 eqcom 1477 . . . . . . 7 |- ([x]R = (/) <-> (/) = [x]R)
65negbii 187 . . . . . 6 |- (-. [x]R = (/) <-> -. (/) = [x]R)
72, 4, 63bitr3 181 . . . . 5 |- (x e. A <-> -. (/) = [x]R)
87biimp 151 . . . 4 |- (x e. A -> -. (/) = [x]R)
9 imnan 242 . . . 4 |- ((x e. A -> -. (/) = [x]R) <-> -. (x e. A /\ (/) = [x]R))
108, 9mpbi 189 . . 3 |- -. (x e. A /\ (/) = [x]R)
1110nex 1101 . 2 |- -. E.x(x e. A /\ (/) = [x]R)
12 elqsi 4291 . 2 |- ((/) e. (A/.R) -> E.x(x e. A /\ (/) = [x]R))
1311, 12mto 106 1 |- -. (/) e. (A/.R)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   /\ wa 223   = wceq 956   e. wcel 958  E.wex 980  (/)c0 2280  dom cdm 3170  [cec 4259  /.cqs 4260
This theorem is referenced by:  ecelqsdm 4299  0npq 5050  0nsr 5188
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742  ax-pr 2779
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-rex 1650  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-br 2620  df-opab 2667  df-xp 3184  df-cnv 3186  df-dm 3188  df-rn 3189  df-res 3190  df-ima 3191  df-ec 4263  df-qs 4266
Copyright terms: Public domain