| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0nnq | Structured version Visualization version GIF version | ||
| Description: The empty set is not a positive fraction. (Contributed by NM, 24-Aug-1995.) (Revised by Mario Carneiro, 27-Apr-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| 0nnq | ⊢ ¬ ∅ ∈ Q |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0nelxp 5690 | . 2 ⊢ ¬ ∅ ∈ (N × N) | |
| 2 | df-nq 11027 | . . . 4 ⊢ Q = {𝑦 ∈ (N × N) ∣ ∀𝑥 ∈ (N × N)(𝑦 ~Q 𝑥 → ¬ (2nd ‘𝑥) <N (2nd ‘𝑦))} | |
| 3 | 2 | ssrab3 4010 | . . 3 ⊢ Q ⊆ (N × N) |
| 4 | 3 | sseli 3909 | . 2 ⊢ (∅ ∈ Q → ∅ ∈ (N × N)) |
| 5 | 1, 4 | mto 200 | 1 ⊢ ¬ ∅ ∈ Q |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∈ wcel 2147 ∀wral 3080 ∅c0 4281 class class class wbr 5106 × cxp 5654 ‘cfv 6561 2nd c2nd 8027 Ncnpi 10959 <N clti 10962 ~Q ceq 10966 Qcnq 10967 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5253 ax-pr 5396 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-opab 5172 df-xp 5662 df-nq 11027 |
| This theorem is used by: adderpq 11071 mulerpq 11072 addassnq 11073 mulassnq 11074 distrnq 11076 recmulnq 11079 recclnq 11081 ltanq 11086 ltmnq 11087 ltexnq 11090 nsmallnq 11092 ltbtwnnq 11093 ltrnq 11094 prlem934 11148 ltaddpr 11149 ltexprlem2 11152 ltexprlem3 11153 ltexprlem4 11154 ltexprlem6 11156 ltexprlem7 11157 prlem936 11162 reclem2pr 11163 |
| Copyright terms: Public domain | W3C validator |