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

Theorem 0nelqs 4282
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 1804 . . . . . . 7 |- x e. V
21ecdmn0 4264 . . . . . 6 |- (x e. dom R <-> -. [x]R = (/))
3 0nelqs.1 . . . . . . 7 |- dom R = A
43eleq2i 1530 . . . . . 6 |- (x e. dom R <-> x e. A)
5 eqcom 1469 . . . . . . 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 1097 . 2 |- -. E.x(x e. A /\ (/) = [x]R)
12 elqsi 4275 . 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 953   e. wcel 955  E.wex 977  (/)c0 2270  dom cdm 3160  [cec 4243  /.cqs 4244
This theorem is referenced by:  ecelqsdm 4283  0npq 5022  0nsr 5160
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-10 963  ax-11 964  ax-12 965  ax-13 966  ax-14 967  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-16 1206  ax-11o 1213  ax-ext 1452  ax-sep 2693  ax-pow 2732  ax-pr 2769
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 978  df-sb 1168  df-eu 1375  df-mo 1376  df-clab 1457  df-cleq 1462  df-clel 1465  df-ne 1579  df-rex 1642  df-v 1803  df-dif 2039  df-un 2040  df-in 2041  df-ss 2043  df-nul 2271  df-pw 2392  df-sn 2402  df-pr 2403  df-op 2406  df-br 2610  df-opab 2657  df-xp 3174  df-cnv 3176  df-dm 3178  df-rn 3179  df-res 3180  df-ima 3181  df-ec 4247  df-qs 4250
Copyright terms: Public domain