| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nqex | Structured version Visualization version GIF version | ||
| Description: The class of positive fractions exists. (Contributed by NM, 16-Aug-1995.) (Revised by Mario Carneiro, 27-Apr-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| nqex | ⊢ Q ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-nq 10892 | . 2 ⊢ Q = {𝑦 ∈ (N × N) ∣ ∀𝑥 ∈ (N × N)(𝑦 ~Q 𝑥 → ¬ (2nd ‘𝑥) <N (2nd ‘𝑦))} | |
| 2 | niex 10861 | . . 3 ⊢ N ∈ V | |
| 3 | 2, 2 | xpex 7748 | . 2 ⊢ (N × N) ∈ V |
| 4 | 1, 3 | rabex2 5311 | 1 ⊢ Q ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∈ wcel 2143 ∀wral 3079 Vcvv 3455 class class class wbr 5109 × cxp 5659 ‘cfv 6536 2nd c2nd 7981 Ncnpi 10824 <N clti 10827 ~Q ceq 10831 Qcnq 10832 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-inf2 9606 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-tr 5219 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-om 7859 df-ni 10852 df-nq 10892 |
| This theorem is referenced by: npex 10966 elnp 10967 genpv 10979 genpdm 10982 |
| Copyright terms: Public domain | W3C validator |