Metamath Proof Explorer


Theorem elpq

Description: A positive rational is the quotient of two positive integers. (Contributed by AV, 29-Dec-2022)

Ref Expression
Assertion elpq ⊢ A ∈ ℚ ∧ 0 < A → ∃ x ∈ ℕ ∃ y ∈ ℕ A = x y

Proof

Step Hyp Ref Expression
1 elq ⊢ A ∈ ℚ ↔ ∃ z ∈ ℤ ∃ y ∈ ℕ A = z y
2 rexcom ⊢ ∃ z ∈ ℤ ∃ y ∈ ℕ A = z y ↔ ∃ y ∈ ℕ ∃ z ∈ ℤ A = z y
3 1 2 bitri ⊢ A ∈ ℚ ↔ ∃ y ∈ ℕ ∃ z ∈ ℤ A = z y
4 breq2 ⊢ A = z y → 0 < A ↔ 0 < z y
5 zre ⊢ z ∈ ℤ → z ∈ ℝ
6 5 adantl ⊢ y ∈ ℕ ∧ z ∈ ℤ → z ∈ ℝ
7 nnre ⊢ y ∈ ℕ → y ∈ ℝ
8 7 adantr ⊢ y ∈ ℕ ∧ z ∈ ℤ → y ∈ ℝ
9 nngt0 ⊢ y ∈ ℕ → 0 < y
10 9 adantr ⊢ y ∈ ℕ ∧ z ∈ ℤ → 0 < y
11 gt0div ⊢ z ∈ ℝ ∧ y ∈ ℝ ∧ 0 < y → 0 < z ↔ 0 < z y
12 6 8 10 11 syl3anc ⊢ y ∈ ℕ ∧ z ∈ ℤ → 0 < z ↔ 0 < z y
13 12 bicomd ⊢ y ∈ ℕ ∧ z ∈ ℤ → 0 < z y ↔ 0 < z
14 4 13 sylan9bb ⊢ A = z y ∧ y ∈ ℕ ∧ z ∈ ℤ → 0 < A ↔ 0 < z
15 oveq1 ⊢ x = z → x y = z y
16 15 eqeq2d ⊢ x = z → A = x y ↔ A = z y
17 elnnz ⊢ z ∈ ℕ ↔ z ∈ ℤ ∧ 0 < z
18 17 simplbi2 ⊢ z ∈ ℤ → 0 < z → z ∈ ℕ
19 18 adantl ⊢ y ∈ ℕ ∧ z ∈ ℤ → 0 < z → z ∈ ℕ
20 19 adantl ⊢ A = z y ∧ y ∈ ℕ ∧ z ∈ ℤ → 0 < z → z ∈ ℕ
21 20 imp ⊢ A = z y ∧ y ∈ ℕ ∧ z ∈ ℤ ∧ 0 < z → z ∈ ℕ
22 simpll ⊢ A = z y ∧ y ∈ ℕ ∧ z ∈ ℤ ∧ 0 < z → A = z y
23 16 21 22 rspcedvdw ⊢ A = z y ∧ y ∈ ℕ ∧ z ∈ ℤ ∧ 0 < z → ∃ x ∈ ℕ A = x y
24 23 ex ⊢ A = z y ∧ y ∈ ℕ ∧ z ∈ ℤ → 0 < z → ∃ x ∈ ℕ A = x y
25 14 24 sylbid ⊢ A = z y ∧ y ∈ ℕ ∧ z ∈ ℤ → 0 < A → ∃ x ∈ ℕ A = x y
26 25 ex ⊢ A = z y → y ∈ ℕ ∧ z ∈ ℤ → 0 < A → ∃ x ∈ ℕ A = x y
27 26 com13 ⊢ 0 < A → y ∈ ℕ ∧ z ∈ ℤ → A = z y → ∃ x ∈ ℕ A = x y
28 27 impl ⊢ 0 < A ∧ y ∈ ℕ ∧ z ∈ ℤ → A = z y → ∃ x ∈ ℕ A = x y
29 28 rexlimdva ⊢ 0 < A ∧ y ∈ ℕ → ∃ z ∈ ℤ A = z y → ∃ x ∈ ℕ A = x y
30 29 reximdva ⊢ 0 < A → ∃ y ∈ ℕ ∃ z ∈ ℤ A = z y → ∃ y ∈ ℕ ∃ x ∈ ℕ A = x y
31 3 30 biimtrid ⊢ 0 < A → A ∈ ℚ → ∃ y ∈ ℕ ∃ x ∈ ℕ A = x y
32 31 impcom ⊢ A ∈ ℚ ∧ 0 < A → ∃ y ∈ ℕ ∃ x ∈ ℕ A = x y
33 rexcom ⊢ ∃ x ∈ ℕ ∃ y ∈ ℕ A = x y ↔ ∃ y ∈ ℕ ∃ x ∈ ℕ A = x y
34 32 33 sylibr ⊢ A ∈ ℚ ∧ 0 < A → ∃ x ∈ ℕ ∃ y ∈ ℕ A = x y