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 10657 | . 2 ⊢ Q = {𝑦 ∈ (N × N) ∣ ∀𝑥 ∈ (N × N)(𝑦 ~Q 𝑥 → ¬ (2nd ‘𝑥) <N (2nd ‘𝑦))} | |
2 | niex 10626 | . . 3 ⊢ N ∈ V | |
3 | 2, 2 | xpex 7595 | . 2 ⊢ (N × N) ∈ V |
4 | 1, 3 | rabex2 5258 | 1 ⊢ Q ∈ V |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∈ wcel 2106 ∀wral 3064 Vcvv 3431 class class class wbr 5075 × cxp 5584 ‘cfv 6428 2nd c2nd 7821 Ncnpi 10589 <N clti 10592 ~Q ceq 10596 Qcnq 10597 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7580 ax-inf2 9388 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-ne 2944 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3433 df-dif 3891 df-un 3893 df-in 3895 df-ss 3905 df-pss 3907 df-nul 4259 df-if 4462 df-pw 4537 df-sn 4564 df-pr 4566 df-op 4570 df-uni 4842 df-br 5076 df-opab 5138 df-tr 5193 df-eprel 5492 df-po 5500 df-so 5501 df-fr 5541 df-we 5543 df-xp 5592 df-rel 5593 df-ord 6264 df-on 6265 df-lim 6266 df-suc 6267 df-om 7705 df-ni 10617 df-nq 10657 |
This theorem is referenced by: npex 10731 elnp 10732 genpv 10744 genpdm 10747 |
Copyright terms: Public domain | W3C validator |