| 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 10921 | . 2 ⊢ Q = {𝑦 ∈ (N × N) ∣ ∀𝑥 ∈ (N × N)(𝑦 ~Q 𝑥 → ¬ (2nd ‘𝑥) <N (2nd ‘𝑦))} | |
| 2 | niex 10890 | . . 3 ⊢ N ∈ V | |
| 3 | 2, 2 | xpex 7752 | . 2 ⊢ (N × N) ∈ V |
| 4 | 1, 3 | rabex2 5305 | 1 ⊢ Q ∈ V |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∈ wcel 2145 ∀wral 3076 Vcvv 3450 class class class wbr 5103 × cxp 5653 ‘cfv 6533 2nd c2nd 7985 Ncnpi 10853 <N clti 10856 ~Q ceq 10860 Qcnq 10861 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-inf2 9620 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-tr 5213 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-om 7863 df-ni 10881 df-nq 10921 |
| This theorem is used by: npex 10995 elnp 10996 genpv 11008 genpdm 11011 |
| Copyright terms: Public domain | W3C validator |