| 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 10823 | . 2 ⊢ Q = {𝑦 ∈ (N × N) ∣ ∀𝑥 ∈ (N × N)(𝑦 ~Q 𝑥 → ¬ (2nd ‘𝑥) <N (2nd ‘𝑦))} | |
| 2 | niex 10792 | . . 3 ⊢ N ∈ V | |
| 3 | 2, 2 | xpex 7698 | . 2 ⊢ (N × N) ∈ V |
| 4 | 1, 3 | rabex2 5286 | 1 ⊢ Q ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∈ wcel 2113 ∀wral 3051 Vcvv 3440 class class class wbr 5098 × cxp 5622 ‘cfv 6492 2nd c2nd 7932 Ncnpi 10755 <N clti 10758 ~Q ceq 10762 Qcnq 10763 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-inf2 9550 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-tr 5206 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-om 7809 df-ni 10783 df-nq 10823 |
| This theorem is referenced by: npex 10897 elnp 10898 genpv 10910 genpdm 10913 |
| Copyright terms: Public domain | W3C validator |