![]() |
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 10981 | . 2 ⊢ Q = {𝑦 ∈ (N × N) ∣ ∀𝑥 ∈ (N × N)(𝑦 ~Q 𝑥 → ¬ (2nd ‘𝑥) <N (2nd ‘𝑦))} | |
2 | niex 10950 | . . 3 ⊢ N ∈ V | |
3 | 2, 2 | xpex 7788 | . 2 ⊢ (N × N) ∈ V |
4 | 1, 3 | rabex2 5359 | 1 ⊢ Q ∈ V |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∈ wcel 2108 ∀wral 3067 Vcvv 3488 class class class wbr 5166 × cxp 5698 ‘cfv 6573 2nd c2nd 8029 Ncnpi 10913 <N clti 10916 ~Q ceq 10920 Qcnq 10921 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-inf2 9710 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-ne 2947 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-opab 5229 df-tr 5284 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-om 7904 df-ni 10941 df-nq 10981 |
This theorem is referenced by: npex 11055 elnp 11056 genpv 11068 genpdm 11071 |
Copyright terms: Public domain | W3C validator |