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 766 | . . 3 ⊢ (((𝜑 ∧ (ℚ ∩ (𝐴(,)𝐵)) = ∅) ∧ ¬ 𝐵 ≤ 𝐴) → (ℚ ∩ (𝐴(,)𝐵)) = ∅) | |
2 | qinioo.a | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ*) | |
3 | qinioo.b | . . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℝ*) | |
4 | 2, 3 | xrltnled 42902 | . . . . . . 7 ⊢ (𝜑 → (𝐴 < 𝐵 ↔ ¬ 𝐵 ≤ 𝐴)) |
5 | 4 | biimpar 478 | . . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝐴) → 𝐴 < 𝐵) |
6 | 2 | adantr 481 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐴 ∈ ℝ*) |
7 | 3 | adantr 481 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐵 ∈ ℝ*) |
8 | simpr 485 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐴 < 𝐵) | |
9 | qbtwnxr 12934 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → ∃𝑞 ∈ ℚ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) | |
10 | 6, 7, 8, 9 | syl3anc 1370 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → ∃𝑞 ∈ ℚ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) |
11 | 2 | ad2antrr 723 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑞 ∈ ℚ) ∧ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) → 𝐴 ∈ ℝ*) |
12 | 3 | ad2antrr 723 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑞 ∈ ℚ) ∧ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) → 𝐵 ∈ ℝ*) |
13 | qre 12693 | . . . . . . . . . . . . 13 ⊢ (𝑞 ∈ ℚ → 𝑞 ∈ ℝ) | |
14 | 13 | ad2antlr 724 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑞 ∈ ℚ) ∧ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) → 𝑞 ∈ ℝ) |
15 | simprl 768 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑞 ∈ ℚ) ∧ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) → 𝐴 < 𝑞) | |
16 | simprr 770 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑞 ∈ ℚ) ∧ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) → 𝑞 < 𝐵) | |
17 | 11, 12, 14, 15, 16 | eliood 43036 | . . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑞 ∈ ℚ) ∧ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) → 𝑞 ∈ (𝐴(,)𝐵)) |
18 | 17 | ex 413 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑞 ∈ ℚ) → ((𝐴 < 𝑞 ∧ 𝑞 < 𝐵) → 𝑞 ∈ (𝐴(,)𝐵))) |
19 | 18 | adantlr 712 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 < 𝐵) ∧ 𝑞 ∈ ℚ) → ((𝐴 < 𝑞 ∧ 𝑞 < 𝐵) → 𝑞 ∈ (𝐴(,)𝐵))) |
20 | 19 | reximdva 3203 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → (∃𝑞 ∈ ℚ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵) → ∃𝑞 ∈ ℚ 𝑞 ∈ (𝐴(,)𝐵))) |
21 | 10, 20 | mpd 15 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → ∃𝑞 ∈ ℚ 𝑞 ∈ (𝐴(,)𝐵)) |
22 | inn0 42623 | . . . . . . 7 ⊢ ((ℚ ∩ (𝐴(,)𝐵)) ≠ ∅ ↔ ∃𝑞 ∈ ℚ 𝑞 ∈ (𝐴(,)𝐵)) | |
23 | 21, 22 | sylibr 233 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → (ℚ ∩ (𝐴(,)𝐵)) ≠ ∅) |
24 | 5, 23 | syldan 591 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝐴) → (ℚ ∩ (𝐴(,)𝐵)) ≠ ∅) |
25 | 24 | neneqd 2948 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝐴) → ¬ (ℚ ∩ (𝐴(,)𝐵)) = ∅) |
26 | 25 | adantlr 712 | . . 3 ⊢ (((𝜑 ∧ (ℚ ∩ (𝐴(,)𝐵)) = ∅) ∧ ¬ 𝐵 ≤ 𝐴) → ¬ (ℚ ∩ (𝐴(,)𝐵)) = ∅) |
27 | 1, 26 | condan 815 | . 2 ⊢ ((𝜑 ∧ (ℚ ∩ (𝐴(,)𝐵)) = ∅) → 𝐵 ≤ 𝐴) |
28 | ioo0 13104 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐴(,)𝐵) = ∅ ↔ 𝐵 ≤ 𝐴)) | |
29 | 2, 3, 28 | syl2anc 584 | . . . 4 ⊢ (𝜑 → ((𝐴(,)𝐵) = ∅ ↔ 𝐵 ≤ 𝐴)) |
30 | 29 | biimpar 478 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐴(,)𝐵) = ∅) |
31 | ineq2 4140 | . . . 4 ⊢ ((𝐴(,)𝐵) = ∅ → (ℚ ∩ (𝐴(,)𝐵)) = (ℚ ∩ ∅)) | |
32 | in0 4325 | . . . 4 ⊢ (ℚ ∩ ∅) = ∅ | |
33 | 31, 32 | eqtrdi 2794 | . . 3 ⊢ ((𝐴(,)𝐵) = ∅ → (ℚ ∩ (𝐴(,)𝐵)) = ∅) |
34 | 30, 33 | syl 17 | . 2 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (ℚ ∩ (𝐴(,)𝐵)) = ∅) |
35 | 27, 34 | impbida 798 | 1 ⊢ (𝜑 → ((ℚ ∩ (𝐴(,)𝐵)) = ∅ ↔ 𝐵 ≤ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ∃wrex 3065 ∩ cin 3886 ∅c0 4256 class class class wbr 5074 (class class class)co 7275 ℝcr 10870 ℝ*cxr 11008 < clt 11009 ≤ cle 11010 ℚcq 12688 (,)cioo 13079 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 ax-pre-sup 10949 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-er 8498 df-en 8734 df-dom 8735 df-sdom 8736 df-sup 9201 df-inf 9202 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-div 11633 df-nn 11974 df-n0 12234 df-z 12320 df-uz 12583 df-q 12689 df-ioo 13083 |
This theorem is referenced by: hoiqssbllem3 44162 |
Copyright terms: Public domain | W3C validator |