![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > qinioo | Structured version Visualization version GIF version |
Description: The rational numbers are dense in ℝ. (Contributed by Glauco Siliprandi, 24-Dec-2020.) |
Ref | Expression |
---|---|
qinioo.a | ⊢ (𝜑 → 𝐴 ∈ ℝ*) |
qinioo.b | ⊢ (𝜑 → 𝐵 ∈ ℝ*) |
Ref | Expression |
---|---|
qinioo | ⊢ (𝜑 → ((ℚ ∩ (𝐴(,)𝐵)) = ∅ ↔ 𝐵 ≤ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simplr 767 | . . 3 ⊢ (((𝜑 ∧ (ℚ ∩ (𝐴(,)𝐵)) = ∅) ∧ ¬ 𝐵 ≤ 𝐴) → (ℚ ∩ (𝐴(,)𝐵)) = ∅) | |
2 | qinioo.a | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ*) | |
3 | qinioo.b | . . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℝ*) | |
4 | 2, 3 | xrltnled 44883 | . . . . . . 7 ⊢ (𝜑 → (𝐴 < 𝐵 ↔ ¬ 𝐵 ≤ 𝐴)) |
5 | 4 | biimpar 476 | . . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝐴) → 𝐴 < 𝐵) |
6 | 2 | adantr 479 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐴 ∈ ℝ*) |
7 | 3 | adantr 479 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐵 ∈ ℝ*) |
8 | simpr 483 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐴 < 𝐵) | |
9 | qbtwnxr 13214 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → ∃𝑞 ∈ ℚ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) | |
10 | 6, 7, 8, 9 | syl3anc 1368 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → ∃𝑞 ∈ ℚ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) |
11 | 2 | ad2antrr 724 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑞 ∈ ℚ) ∧ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) → 𝐴 ∈ ℝ*) |
12 | 3 | ad2antrr 724 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑞 ∈ ℚ) ∧ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) → 𝐵 ∈ ℝ*) |
13 | qre 12970 | . . . . . . . . . . . . 13 ⊢ (𝑞 ∈ ℚ → 𝑞 ∈ ℝ) | |
14 | 13 | ad2antlr 725 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑞 ∈ ℚ) ∧ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) → 𝑞 ∈ ℝ) |
15 | simprl 769 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑞 ∈ ℚ) ∧ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) → 𝐴 < 𝑞) | |
16 | simprr 771 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑞 ∈ ℚ) ∧ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) → 𝑞 < 𝐵) | |
17 | 11, 12, 14, 15, 16 | eliood 45021 | . . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑞 ∈ ℚ) ∧ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) → 𝑞 ∈ (𝐴(,)𝐵)) |
18 | 17 | ex 411 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑞 ∈ ℚ) → ((𝐴 < 𝑞 ∧ 𝑞 < 𝐵) → 𝑞 ∈ (𝐴(,)𝐵))) |
19 | 18 | adantlr 713 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 < 𝐵) ∧ 𝑞 ∈ ℚ) → ((𝐴 < 𝑞 ∧ 𝑞 < 𝐵) → 𝑞 ∈ (𝐴(,)𝐵))) |
20 | 19 | reximdva 3157 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → (∃𝑞 ∈ ℚ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵) → ∃𝑞 ∈ ℚ 𝑞 ∈ (𝐴(,)𝐵))) |
21 | 10, 20 | mpd 15 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → ∃𝑞 ∈ ℚ 𝑞 ∈ (𝐴(,)𝐵)) |
22 | inn0 4369 | . . . . . . 7 ⊢ ((ℚ ∩ (𝐴(,)𝐵)) ≠ ∅ ↔ ∃𝑞 ∈ ℚ 𝑞 ∈ (𝐴(,)𝐵)) | |
23 | 21, 22 | sylibr 233 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → (ℚ ∩ (𝐴(,)𝐵)) ≠ ∅) |
24 | 5, 23 | syldan 589 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝐴) → (ℚ ∩ (𝐴(,)𝐵)) ≠ ∅) |
25 | 24 | neneqd 2934 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝐴) → ¬ (ℚ ∩ (𝐴(,)𝐵)) = ∅) |
26 | 25 | adantlr 713 | . . 3 ⊢ (((𝜑 ∧ (ℚ ∩ (𝐴(,)𝐵)) = ∅) ∧ ¬ 𝐵 ≤ 𝐴) → ¬ (ℚ ∩ (𝐴(,)𝐵)) = ∅) |
27 | 1, 26 | condan 816 | . 2 ⊢ ((𝜑 ∧ (ℚ ∩ (𝐴(,)𝐵)) = ∅) → 𝐵 ≤ 𝐴) |
28 | ioo0 13384 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐴(,)𝐵) = ∅ ↔ 𝐵 ≤ 𝐴)) | |
29 | 2, 3, 28 | syl2anc 582 | . . . 4 ⊢ (𝜑 → ((𝐴(,)𝐵) = ∅ ↔ 𝐵 ≤ 𝐴)) |
30 | 29 | biimpar 476 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐴(,)𝐵) = ∅) |
31 | ineq2 4204 | . . . 4 ⊢ ((𝐴(,)𝐵) = ∅ → (ℚ ∩ (𝐴(,)𝐵)) = (ℚ ∩ ∅)) | |
32 | in0 4393 | . . . 4 ⊢ (ℚ ∩ ∅) = ∅ | |
33 | 31, 32 | eqtrdi 2781 | . . 3 ⊢ ((𝐴(,)𝐵) = ∅ → (ℚ ∩ (𝐴(,)𝐵)) = ∅) |
34 | 30, 33 | syl 17 | . 2 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (ℚ ∩ (𝐴(,)𝐵)) = ∅) |
35 | 27, 34 | impbida 799 | 1 ⊢ (𝜑 → ((ℚ ∩ (𝐴(,)𝐵)) = ∅ ↔ 𝐵 ≤ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ≠ wne 2929 ∃wrex 3059 ∩ cin 3943 ∅c0 4322 class class class wbr 5149 (class class class)co 7419 ℝcr 11139 ℝ*cxr 11279 < clt 11280 ≤ cle 11281 ℚcq 12965 (,)cioo 13359 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5300 ax-nul 5307 ax-pow 5365 ax-pr 5429 ax-un 7741 ax-cnex 11196 ax-resscn 11197 ax-1cn 11198 ax-icn 11199 ax-addcl 11200 ax-addrcl 11201 ax-mulcl 11202 ax-mulrcl 11203 ax-mulcom 11204 ax-addass 11205 ax-mulass 11206 ax-distr 11207 ax-i2m1 11208 ax-1ne0 11209 ax-1rid 11210 ax-rnegex 11211 ax-rrecex 11212 ax-cnre 11213 ax-pre-lttri 11214 ax-pre-lttrn 11215 ax-pre-ltadd 11216 ax-pre-mulgt0 11217 ax-pre-sup 11218 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2930 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3363 df-reu 3364 df-rab 3419 df-v 3463 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3964 df-nul 4323 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4910 df-iun 4999 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6307 df-ord 6374 df-on 6375 df-lim 6376 df-suc 6377 df-iota 6501 df-fun 6551 df-fn 6552 df-f 6553 df-f1 6554 df-fo 6555 df-f1o 6556 df-fv 6557 df-riota 7375 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7872 df-1st 7994 df-2nd 7995 df-frecs 8287 df-wrecs 8318 df-recs 8392 df-rdg 8431 df-er 8725 df-en 8965 df-dom 8966 df-sdom 8967 df-sup 9467 df-inf 9468 df-pnf 11282 df-mnf 11283 df-xr 11284 df-ltxr 11285 df-le 11286 df-sub 11478 df-neg 11479 df-div 11904 df-nn 12246 df-n0 12506 df-z 12592 df-uz 12856 df-q 12966 df-ioo 13363 |
This theorem is referenced by: hoiqssbllem3 46150 |
Copyright terms: Public domain | W3C validator |