qbtwnre - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > qbtwnre		Structured version Visualization version GIF version

Theorem qbtwnre 13353

Description: The rational numbers are dense in ℝ: any two real numbers have a rational between them. Exercise 6 of [Apostol] p. 28. (Contributed by NM, 18-Nov-2004.) (Proof shortened by Mario Carneiro, 13-Jun-2014.)

**Assertion**
Ref	Expression
qbtwnre	⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 < 𝐵) → ∃𝑥 ∈ ℚ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))

Distinct variable groups: 𝑥,𝐴 𝑥,𝐵

Proof of Theorem qbtwnre Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		posdif 11833	. . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 ↔ 0 < (𝐵 − 𝐴)))
2		resubcl 11646	. . . . . . 7 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐵 − 𝐴) ∈ ℝ)
3		nnrecl 12628	. . . . . . 7 ⊢ (((𝐵 − 𝐴) ∈ ℝ ∧ 0 < (𝐵 − 𝐴)) → ∃𝑦 ∈ ℕ (1 / 𝑦) < (𝐵 − 𝐴))
4	2, 3	sylan 592	. . . . . 6 ⊢ (((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) ∧ 0 < (𝐵 − 𝐴)) → ∃𝑦 ∈ ℕ (1 / 𝑦) < (𝐵 − 𝐴))
5	4	ex 418	. . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (0 < (𝐵 − 𝐴) → ∃𝑦 ∈ ℕ (1 / 𝑦) < (𝐵 − 𝐴)))
6	5	ancoms 464	. . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (0 < (𝐵 − 𝐴) → ∃𝑦 ∈ ℕ (1 / 𝑦) < (𝐵 − 𝐴)))
7	1, 6	sylbid 243	. . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 → ∃𝑦 ∈ ℕ (1 / 𝑦) < (𝐵 − 𝐴)))
8		nnre 12366	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ → 𝑦 ∈ ℝ)
9	8	adantl 487	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑦 ∈ ℕ) → 𝑦 ∈ ℝ)
10		simplr 781	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑦 ∈ ℕ) → 𝐵 ∈ ℝ)
11	9, 10	remulcld 11363	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑦 ∈ ℕ) → (𝑦 · 𝐵) ∈ ℝ)
12		peano2rem 11649	. . . . . . 7 ⊢ ((𝑦 · 𝐵) ∈ ℝ → ((𝑦 · 𝐵) − 1) ∈ ℝ)
13	11, 12	syl 18	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑦 ∈ ℕ) → ((𝑦 · 𝐵) − 1) ∈ ℝ)
14		zbtwnre 13097	. . . . . 6 ⊢ (((𝑦 · 𝐵) − 1) ∈ ℝ → ∃!𝑧 ∈ ℤ (((𝑦 · 𝐵) − 1) ≤ 𝑧 ∧ 𝑧 < (((𝑦 · 𝐵) − 1) + 1)))
15		reurex 3373	. . . . . 6 ⊢ (∃!𝑧 ∈ ℤ (((𝑦 · 𝐵) − 1) ≤ 𝑧 ∧ 𝑧 < (((𝑦 · 𝐵) − 1) + 1)) → ∃𝑧 ∈ ℤ (((𝑦 · 𝐵) − 1) ≤ 𝑧 ∧ 𝑧 < (((𝑦 · 𝐵) − 1) + 1)))
16	13, 14, 15	3syl 19	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑦 ∈ ℕ) → ∃𝑧 ∈ ℤ (((𝑦 · 𝐵) − 1) ≤ 𝑧 ∧ 𝑧 < (((𝑦 · 𝐵) − 1) + 1)))
17		znq 13103	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ ℤ ∧ 𝑦 ∈ ℕ) → (𝑧 / 𝑦) ∈ ℚ)
18	17	ancoms 464	. . . . . . . . . 10 ⊢ ((𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ) → (𝑧 / 𝑦) ∈ ℚ)
19	18	adantl 487	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → (𝑧 / 𝑦) ∈ ℚ)
20		an32 659	. . . . . . . . . 10 ⊢ (((((𝑦 · 𝐵) − 1) ≤ 𝑧 ∧ 𝑧 < (((𝑦 · 𝐵) − 1) + 1)) ∧ (1 / 𝑦) < (𝐵 − 𝐴)) ↔ ((((𝑦 · 𝐵) − 1) ≤ 𝑧 ∧ (1 / 𝑦) < (𝐵 − 𝐴)) ∧ 𝑧 < (((𝑦 · 𝐵) − 1) + 1)))
21	8	ad2antrl 741	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → 𝑦 ∈ ℝ)
22		simpll 779	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → 𝐴 ∈ ℝ)
23	21, 22	remulcld 11363	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → (𝑦 · 𝐴) ∈ ℝ)
24	13	adantrr 730	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → ((𝑦 · 𝐵) − 1) ∈ ℝ)
25		zre 12721	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ ℤ → 𝑧 ∈ ℝ)
26	25	ad2antll 742	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → 𝑧 ∈ ℝ)
27		ltletr 11426	. . . . . . . . . . . . 13 ⊢ (((𝑦 · 𝐴) ∈ ℝ ∧ ((𝑦 · 𝐵) − 1) ∈ ℝ ∧ 𝑧 ∈ ℝ) → (((𝑦 · 𝐴) < ((𝑦 · 𝐵) − 1) ∧ ((𝑦 · 𝐵) − 1) ≤ 𝑧) → (𝑦 · 𝐴) < 𝑧))
28	23, 24, 26, 27	syl3anc 1399	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → (((𝑦 · 𝐴) < ((𝑦 · 𝐵) − 1) ∧ ((𝑦 · 𝐵) − 1) ≤ 𝑧) → (𝑦 · 𝐴) < 𝑧))
29	21	recnd 11361	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → 𝑦 ∈ ℂ)
30		simplr 781	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → 𝐵 ∈ ℝ)
31	30	recnd 11361	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → 𝐵 ∈ ℂ)
32	22	recnd 11361	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → 𝐴 ∈ ℂ)
33	29, 31, 32	subdid 11796	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → (𝑦 · (𝐵 − 𝐴)) = ((𝑦 · 𝐵) − (𝑦 · 𝐴)))
34	33	breq2d 5118	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → (1 < (𝑦 · (𝐵 − 𝐴)) ↔ 1 < ((𝑦 · 𝐵) − (𝑦 · 𝐴))))
35		1red 11333	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → 1 ∈ ℝ)
36	30, 22	resubcld 11768	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → (𝐵 − 𝐴) ∈ ℝ)
37		nngt0 12393	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ ℕ → 0 < 𝑦)
38	37	ad2antrl 741	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → 0 < 𝑦)
39		ltdivmul 12216	. . . . . . . . . . . . . . . 16 ⊢ ((1 ∈ ℝ ∧ (𝐵 − 𝐴) ∈ ℝ ∧ (𝑦 ∈ ℝ ∧ 0 < 𝑦)) → ((1 / 𝑦) < (𝐵 − 𝐴) ↔ 1 < (𝑦 · (𝐵 − 𝐴))))
40	35, 36, 21, 38, 39	syl112anc 1402	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → ((1 / 𝑦) < (𝐵 − 𝐴) ↔ 1 < (𝑦 · (𝐵 − 𝐴))))
41	11	adantrr 730	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → (𝑦 · 𝐵) ∈ ℝ)
42		ltsub13 11821	. . . . . . . . . . . . . . . 16 ⊢ (((𝑦 · 𝐴) ∈ ℝ ∧ (𝑦 · 𝐵) ∈ ℝ ∧ 1 ∈ ℝ) → ((𝑦 · 𝐴) < ((𝑦 · 𝐵) − 1) ↔ 1 < ((𝑦 · 𝐵) − (𝑦 · 𝐴))))
43	23, 41, 35, 42	syl3anc 1399	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → ((𝑦 · 𝐴) < ((𝑦 · 𝐵) − 1) ↔ 1 < ((𝑦 · 𝐵) − (𝑦 · 𝐴))))
44	34, 40, 43	3bitr4rd 315	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → ((𝑦 · 𝐴) < ((𝑦 · 𝐵) − 1) ↔ (1 / 𝑦) < (𝐵 − 𝐴)))
45	44	anbi1d 643	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → (((𝑦 · 𝐴) < ((𝑦 · 𝐵) − 1) ∧ ((𝑦 · 𝐵) − 1) ≤ 𝑧) ↔ ((1 / 𝑦) < (𝐵 − 𝐴) ∧ ((𝑦 · 𝐵) − 1) ≤ 𝑧)))
46	45	biancomd 469	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → (((𝑦 · 𝐴) < ((𝑦 · 𝐵) − 1) ∧ ((𝑦 · 𝐵) − 1) ≤ 𝑧) ↔ (((𝑦 · 𝐵) − 1) ≤ 𝑧 ∧ (1 / 𝑦) < (𝐵 − 𝐴))))
47		ltmuldiv2 12215	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ (𝑦 ∈ ℝ ∧ 0 < 𝑦)) → ((𝑦 · 𝐴) < 𝑧 ↔ 𝐴 < (𝑧 / 𝑦)))
48	22, 26, 21, 38, 47	syl112anc 1402	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → ((𝑦 · 𝐴) < 𝑧 ↔ 𝐴 < (𝑧 / 𝑦)))
49	28, 46, 48	3imtr3d 296	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → ((((𝑦 · 𝐵) − 1) ≤ 𝑧 ∧ (1 / 𝑦) < (𝐵 − 𝐴)) → 𝐴 < (𝑧 / 𝑦)))
50	41	recnd 11361	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → (𝑦 · 𝐵) ∈ ℂ)
51		ax-1cn 11282	. . . . . . . . . . . . . . 15 ⊢ 1 ∈ ℂ
52		npcan 11590	. . . . . . . . . . . . . . 15 ⊢ (((𝑦 · 𝐵) ∈ ℂ ∧ 1 ∈ ℂ) → (((𝑦 · 𝐵) − 1) + 1) = (𝑦 · 𝐵))
53	50, 51, 52	sylancl 598	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → (((𝑦 · 𝐵) − 1) + 1) = (𝑦 · 𝐵))
54	53	breq2d 5118	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → (𝑧 < (((𝑦 · 𝐵) − 1) + 1) ↔ 𝑧 < (𝑦 · 𝐵)))
55		ltdivmul 12216	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝑦 ∈ ℝ ∧ 0 < 𝑦)) → ((𝑧 / 𝑦) < 𝐵 ↔ 𝑧 < (𝑦 · 𝐵)))
56	26, 30, 21, 38, 55	syl112anc 1402	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → ((𝑧 / 𝑦) < 𝐵 ↔ 𝑧 < (𝑦 · 𝐵)))
57	54, 56	bitr4d 285	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → (𝑧 < (((𝑦 · 𝐵) − 1) + 1) ↔ (𝑧 / 𝑦) < 𝐵))
58	57	biimpd 232	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → (𝑧 < (((𝑦 · 𝐵) − 1) + 1) → (𝑧 / 𝑦) < 𝐵))
59	49, 58	anim12d 621	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → (((((𝑦 · 𝐵) − 1) ≤ 𝑧 ∧ (1 / 𝑦) < (𝐵 − 𝐴)) ∧ 𝑧 < (((𝑦 · 𝐵) − 1) + 1)) → (𝐴 < (𝑧 / 𝑦) ∧ (𝑧 / 𝑦) < 𝐵)))
60	20, 59	biimtrid 245	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → (((((𝑦 · 𝐵) − 1) ≤ 𝑧 ∧ 𝑧 < (((𝑦 · 𝐵) − 1) + 1)) ∧ (1 / 𝑦) < (𝐵 − 𝐴)) → (𝐴 < (𝑧 / 𝑦) ∧ (𝑧 / 𝑦) < 𝐵)))
61		breq2 5110	. . . . . . . . . . 11 ⊢ (𝑥 = (𝑧 / 𝑦) → (𝐴 < 𝑥 ↔ 𝐴 < (𝑧 / 𝑦)))
62		breq1 5109	. . . . . . . . . . 11 ⊢ (𝑥 = (𝑧 / 𝑦) → (𝑥 < 𝐵 ↔ (𝑧 / 𝑦) < 𝐵))
63	61, 62	anbi12d 644	. . . . . . . . . 10 ⊢ (𝑥 = (𝑧 / 𝑦) → ((𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ↔ (𝐴 < (𝑧 / 𝑦) ∧ (𝑧 / 𝑦) < 𝐵)))
64	63	rspcev 3580	. . . . . . . . 9 ⊢ (((𝑧 / 𝑦) ∈ ℚ ∧ (𝐴 < (𝑧 / 𝑦) ∧ (𝑧 / 𝑦) < 𝐵)) → ∃𝑥 ∈ ℚ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))
65	19, 60, 64	syl6an 697	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → (((((𝑦 · 𝐵) − 1) ≤ 𝑧 ∧ 𝑧 < (((𝑦 · 𝐵) − 1) + 1)) ∧ (1 / 𝑦) < (𝐵 − 𝐴)) → ∃𝑥 ∈ ℚ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵)))
66	65	expd 421	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑦 ∈ ℕ ∧ 𝑧 ∈ ℤ)) → ((((𝑦 · 𝐵) − 1) ≤ 𝑧 ∧ 𝑧 < (((𝑦 · 𝐵) − 1) + 1)) → ((1 / 𝑦) < (𝐵 − 𝐴) → ∃𝑥 ∈ ℚ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))))
67	66	expr 462	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑦 ∈ ℕ) → (𝑧 ∈ ℤ → ((((𝑦 · 𝐵) − 1) ≤ 𝑧 ∧ 𝑧 < (((𝑦 · 𝐵) − 1) + 1)) → ((1 / 𝑦) < (𝐵 − 𝐴) → ∃𝑥 ∈ ℚ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵)))))
68	67	rexlimdv 3165	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑦 ∈ ℕ) → (∃𝑧 ∈ ℤ (((𝑦 · 𝐵) − 1) ≤ 𝑧 ∧ 𝑧 < (((𝑦 · 𝐵) − 1) + 1)) → ((1 / 𝑦) < (𝐵 − 𝐴) → ∃𝑥 ∈ ℚ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))))
69	16, 68	mpd 16	. . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑦 ∈ ℕ) → ((1 / 𝑦) < (𝐵 − 𝐴) → ∃𝑥 ∈ ℚ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵)))
70	69	rexlimdva 3167	. . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (∃𝑦 ∈ ℕ (1 / 𝑦) < (𝐵 − 𝐴) → ∃𝑥 ∈ ℚ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵)))
71	7, 70	syld 48	. 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 → ∃𝑥 ∈ ℚ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵)))
72	71	3impia 1135	1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 < 𝐵) → ∃𝑥 ∈ ℚ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ∃wrex 3090 ∃!wreu 3367 class class class wbr 5106 (class class class)co 7440 ℂcc 11222 ℝcr 11223 0cc0 11224 1c1 11225 + caddc 11227 · cmul 11229 < clt 11367 ≤ cle 11368 − cmin 11565 / cdiv 11997 ℕcn 12359 ℤcz 12717 ℚcq 13099

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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 ax-cnex 11280 ax-resscn 11281 ax-1cn 11282 ax-icn 11283 ax-addcl 11284 ax-addrcl 11285 ax-mulcl 11286 ax-mulrcl 11287 ax-mulcom 11288 ax-addass 11289 ax-mulass 11290 ax-distr 11291 ax-i2m1 11292 ax-1ne0 11293 ax-1rid 11294 ax-rnegex 11295 ax-rrecex 11296 ax-cnre 11297 ax-pre-lttri 11298 ax-pre-lttrn 11299 ax-pre-ltadd 11300 ax-pre-mulgt0 11301 ax-pre-sup 11302

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-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6319 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-riota 7397 df-ov 7443 df-oprab 7444 df-mpo 7445 df-om 7899 df-1st 8022 df-2nd 8023 df-frecs 8324 df-wrecs 8355 df-recs 8404 df-rdg 8443 df-er 8742 df-en 8999 df-dom 9000 df-sdom 9001 df-sup 9458 df-inf 9459 df-pnf 11369 df-mnf 11370 df-xr 11371 df-ltxr 11372 df-le 11373 df-sub 11567 df-neg 11568 df-div 11998 df-nn 12360 df-n0 12631 df-z 12718 df-uz 12990 df-q 13100

This theorem is used by: qbtwnxr 13354 qsqueeze 13355 nmoleub2lem3 25463 mbfaddlem 26008 rpnnen3lem 44229

W3C validator