![]() |
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 9772 | . 2 ⊢ Q = {𝑦 ∈ (N × N) ∣ ∀𝑥 ∈ (N × N)(𝑦 ~Q 𝑥 → ¬ (2nd ‘𝑥) <N (2nd ‘𝑦))} | |
2 | niex 9741 | . . 3 ⊢ N ∈ V | |
3 | 2, 2 | xpex 7004 | . 2 ⊢ (N × N) ∈ V |
4 | 1, 3 | rabex2 4847 | 1 ⊢ Q ∈ V |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∈ wcel 2030 ∀wral 2941 Vcvv 3231 class class class wbr 4685 × cxp 5141 ‘cfv 5926 2nd c2nd 7209 Ncnpi 9704 <N clti 9707 ~Q ceq 9711 Qcnq 9712 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-8 2032 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-sep 4814 ax-nul 4822 ax-pow 4873 ax-pr 4936 ax-un 6991 ax-inf2 8576 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1055 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-ral 2946 df-rex 2947 df-rab 2950 df-v 3233 df-sbc 3469 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-pss 3623 df-nul 3949 df-if 4120 df-pw 4193 df-sn 4211 df-pr 4213 df-tp 4215 df-op 4217 df-uni 4469 df-br 4686 df-opab 4746 df-tr 4786 df-eprel 5058 df-po 5064 df-so 5065 df-fr 5102 df-we 5104 df-xp 5149 df-rel 5150 df-ord 5764 df-on 5765 df-lim 5766 df-suc 5767 df-om 7108 df-ni 9732 df-nq 9772 |
This theorem is referenced by: npex 9846 elnp 9847 genpv 9859 genpdm 9862 |
Copyright terms: Public domain | W3C validator |