| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > elpqb | GIF version | ||
| Description: A class is a positive rational iff it is the quotient of two positive integers. (Contributed by AV, 30-Dec-2022.) |
| Ref | Expression |
|---|---|
| elpqb | ⊢ ((𝐴 ∈ ℚ ∧ 0 < 𝐴) ↔ ∃𝑥 ∈ ℕ ∃𝑦 ∈ ℕ 𝐴 = (𝑥 / 𝑦)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elpq 9888 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 0 < 𝐴) → ∃𝑥 ∈ ℕ ∃𝑦 ∈ ℕ 𝐴 = (𝑥 / 𝑦)) | |
| 2 | nnz 9503 | . . . . . 6 ⊢ (𝑥 ∈ ℕ → 𝑥 ∈ ℤ) | |
| 3 | znq 9863 | . . . . . 6 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ) → (𝑥 / 𝑦) ∈ ℚ) | |
| 4 | 2, 3 | sylan 283 | . . . . 5 ⊢ ((𝑥 ∈ ℕ ∧ 𝑦 ∈ ℕ) → (𝑥 / 𝑦) ∈ ℚ) |
| 5 | nnre 9155 | . . . . . . 7 ⊢ (𝑥 ∈ ℕ → 𝑥 ∈ ℝ) | |
| 6 | nngt0 9173 | . . . . . . 7 ⊢ (𝑥 ∈ ℕ → 0 < 𝑥) | |
| 7 | 5, 6 | jca 306 | . . . . . 6 ⊢ (𝑥 ∈ ℕ → (𝑥 ∈ ℝ ∧ 0 < 𝑥)) |
| 8 | nnre 9155 | . . . . . . 7 ⊢ (𝑦 ∈ ℕ → 𝑦 ∈ ℝ) | |
| 9 | nngt0 9173 | . . . . . . 7 ⊢ (𝑦 ∈ ℕ → 0 < 𝑦) | |
| 10 | 8, 9 | jca 306 | . . . . . 6 ⊢ (𝑦 ∈ ℕ → (𝑦 ∈ ℝ ∧ 0 < 𝑦)) |
| 11 | divgt0 9057 | . . . . . 6 ⊢ (((𝑥 ∈ ℝ ∧ 0 < 𝑥) ∧ (𝑦 ∈ ℝ ∧ 0 < 𝑦)) → 0 < (𝑥 / 𝑦)) | |
| 12 | 7, 10, 11 | syl2an 289 | . . . . 5 ⊢ ((𝑥 ∈ ℕ ∧ 𝑦 ∈ ℕ) → 0 < (𝑥 / 𝑦)) |
| 13 | 4, 12 | jca 306 | . . . 4 ⊢ ((𝑥 ∈ ℕ ∧ 𝑦 ∈ ℕ) → ((𝑥 / 𝑦) ∈ ℚ ∧ 0 < (𝑥 / 𝑦))) |
| 14 | eleq1 2293 | . . . . 5 ⊢ (𝐴 = (𝑥 / 𝑦) → (𝐴 ∈ ℚ ↔ (𝑥 / 𝑦) ∈ ℚ)) | |
| 15 | breq2 4093 | . . . . 5 ⊢ (𝐴 = (𝑥 / 𝑦) → (0 < 𝐴 ↔ 0 < (𝑥 / 𝑦))) | |
| 16 | 14, 15 | anbi12d 473 | . . . 4 ⊢ (𝐴 = (𝑥 / 𝑦) → ((𝐴 ∈ ℚ ∧ 0 < 𝐴) ↔ ((𝑥 / 𝑦) ∈ ℚ ∧ 0 < (𝑥 / 𝑦)))) |
| 17 | 13, 16 | syl5ibrcom 157 | . . 3 ⊢ ((𝑥 ∈ ℕ ∧ 𝑦 ∈ ℕ) → (𝐴 = (𝑥 / 𝑦) → (𝐴 ∈ ℚ ∧ 0 < 𝐴))) |
| 18 | 17 | rexlimivv 2655 | . 2 ⊢ (∃𝑥 ∈ ℕ ∃𝑦 ∈ ℕ 𝐴 = (𝑥 / 𝑦) → (𝐴 ∈ ℚ ∧ 0 < 𝐴)) |
| 19 | 1, 18 | impbii 126 | 1 ⊢ ((𝐴 ∈ ℚ ∧ 0 < 𝐴) ↔ ∃𝑥 ∈ ℕ ∃𝑦 ∈ ℕ 𝐴 = (𝑥 / 𝑦)) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 = wceq 1397 ∈ wcel 2201 ∃wrex 2510 class class class wbr 4089 (class class class)co 6023 ℝcr 8036 0cc0 8037 < clt 8219 / cdiv 8857 ℕcn 9148 ℤcz 9484 ℚcq 9858 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2203 ax-14 2204 ax-ext 2212 ax-sep 4208 ax-pow 4266 ax-pr 4301 ax-un 4532 ax-setind 4637 ax-cnex 8128 ax-resscn 8129 ax-1cn 8130 ax-1re 8131 ax-icn 8132 ax-addcl 8133 ax-addrcl 8134 ax-mulcl 8135 ax-mulrcl 8136 ax-addcom 8137 ax-mulcom 8138 ax-addass 8139 ax-mulass 8140 ax-distr 8141 ax-i2m1 8142 ax-0lt1 8143 ax-1rid 8144 ax-0id 8145 ax-rnegex 8146 ax-precex 8147 ax-cnre 8148 ax-pre-ltirr 8149 ax-pre-ltwlin 8150 ax-pre-lttrn 8151 ax-pre-apti 8152 ax-pre-ltadd 8153 ax-pre-mulgt0 8154 ax-pre-mulext 8155 |
| This theorem depends on definitions: df-bi 117 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ne 2402 df-nel 2497 df-ral 2514 df-rex 2515 df-reu 2516 df-rmo 2517 df-rab 2518 df-v 2803 df-sbc 3031 df-csb 3127 df-dif 3201 df-un 3203 df-in 3205 df-ss 3212 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-int 3930 df-iun 3973 df-br 4090 df-opab 4152 df-mpt 4153 df-id 4392 df-po 4395 df-iso 4396 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-ima 4740 df-iota 5288 df-fun 5330 df-fn 5331 df-f 5332 df-fv 5336 df-riota 5976 df-ov 6026 df-oprab 6027 df-mpo 6028 df-1st 6308 df-2nd 6309 df-pnf 8221 df-mnf 8222 df-xr 8223 df-ltxr 8224 df-le 8225 df-sub 8357 df-neg 8358 df-reap 8760 df-ap 8767 df-div 8858 df-inn 9149 df-z 9485 df-q 9859 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |