![]() |
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 768 | . . 3 ⊢ (((𝜑 ∧ (ℚ ∩ (𝐴(,)𝐵)) = ∅) ∧ ¬ 𝐵 ≤ 𝐴) → (ℚ ∩ (𝐴(,)𝐵)) = ∅) | |
2 | qinioo.a | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ*) | |
3 | qinioo.b | . . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℝ*) | |
4 | 2, 3 | xrltnled 43604 | . . . . . . 7 ⊢ (𝜑 → (𝐴 < 𝐵 ↔ ¬ 𝐵 ≤ 𝐴)) |
5 | 4 | biimpar 479 | . . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝐴) → 𝐴 < 𝐵) |
6 | 2 | adantr 482 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐴 ∈ ℝ*) |
7 | 3 | adantr 482 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐵 ∈ ℝ*) |
8 | simpr 486 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐴 < 𝐵) | |
9 | qbtwnxr 13120 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → ∃𝑞 ∈ ℚ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) | |
10 | 6, 7, 8, 9 | syl3anc 1372 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → ∃𝑞 ∈ ℚ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) |
11 | 2 | ad2antrr 725 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑞 ∈ ℚ) ∧ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) → 𝐴 ∈ ℝ*) |
12 | 3 | ad2antrr 725 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑞 ∈ ℚ) ∧ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) → 𝐵 ∈ ℝ*) |
13 | qre 12879 | . . . . . . . . . . . . 13 ⊢ (𝑞 ∈ ℚ → 𝑞 ∈ ℝ) | |
14 | 13 | ad2antlr 726 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑞 ∈ ℚ) ∧ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) → 𝑞 ∈ ℝ) |
15 | simprl 770 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑞 ∈ ℚ) ∧ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) → 𝐴 < 𝑞) | |
16 | simprr 772 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑞 ∈ ℚ) ∧ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) → 𝑞 < 𝐵) | |
17 | 11, 12, 14, 15, 16 | eliood 43743 | . . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑞 ∈ ℚ) ∧ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵)) → 𝑞 ∈ (𝐴(,)𝐵)) |
18 | 17 | ex 414 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑞 ∈ ℚ) → ((𝐴 < 𝑞 ∧ 𝑞 < 𝐵) → 𝑞 ∈ (𝐴(,)𝐵))) |
19 | 18 | adantlr 714 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 < 𝐵) ∧ 𝑞 ∈ ℚ) → ((𝐴 < 𝑞 ∧ 𝑞 < 𝐵) → 𝑞 ∈ (𝐴(,)𝐵))) |
20 | 19 | reximdva 3166 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → (∃𝑞 ∈ ℚ (𝐴 < 𝑞 ∧ 𝑞 < 𝐵) → ∃𝑞 ∈ ℚ 𝑞 ∈ (𝐴(,)𝐵))) |
21 | 10, 20 | mpd 15 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → ∃𝑞 ∈ ℚ 𝑞 ∈ (𝐴(,)𝐵)) |
22 | inn0 43290 | . . . . . . 7 ⊢ ((ℚ ∩ (𝐴(,)𝐵)) ≠ ∅ ↔ ∃𝑞 ∈ ℚ 𝑞 ∈ (𝐴(,)𝐵)) | |
23 | 21, 22 | sylibr 233 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → (ℚ ∩ (𝐴(,)𝐵)) ≠ ∅) |
24 | 5, 23 | syldan 592 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝐴) → (ℚ ∩ (𝐴(,)𝐵)) ≠ ∅) |
25 | 24 | neneqd 2949 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝐴) → ¬ (ℚ ∩ (𝐴(,)𝐵)) = ∅) |
26 | 25 | adantlr 714 | . . 3 ⊢ (((𝜑 ∧ (ℚ ∩ (𝐴(,)𝐵)) = ∅) ∧ ¬ 𝐵 ≤ 𝐴) → ¬ (ℚ ∩ (𝐴(,)𝐵)) = ∅) |
27 | 1, 26 | condan 817 | . 2 ⊢ ((𝜑 ∧ (ℚ ∩ (𝐴(,)𝐵)) = ∅) → 𝐵 ≤ 𝐴) |
28 | ioo0 13290 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐴(,)𝐵) = ∅ ↔ 𝐵 ≤ 𝐴)) | |
29 | 2, 3, 28 | syl2anc 585 | . . . 4 ⊢ (𝜑 → ((𝐴(,)𝐵) = ∅ ↔ 𝐵 ≤ 𝐴)) |
30 | 29 | biimpar 479 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐴(,)𝐵) = ∅) |
31 | ineq2 4167 | . . . 4 ⊢ ((𝐴(,)𝐵) = ∅ → (ℚ ∩ (𝐴(,)𝐵)) = (ℚ ∩ ∅)) | |
32 | in0 4352 | . . . 4 ⊢ (ℚ ∩ ∅) = ∅ | |
33 | 31, 32 | eqtrdi 2793 | . . 3 ⊢ ((𝐴(,)𝐵) = ∅ → (ℚ ∩ (𝐴(,)𝐵)) = ∅) |
34 | 30, 33 | syl 17 | . 2 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (ℚ ∩ (𝐴(,)𝐵)) = ∅) |
35 | 27, 34 | impbida 800 | 1 ⊢ (𝜑 → ((ℚ ∩ (𝐴(,)𝐵)) = ∅ ↔ 𝐵 ≤ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ≠ wne 2944 ∃wrex 3074 ∩ cin 3910 ∅c0 4283 class class class wbr 5106 (class class class)co 7358 ℝcr 11051 ℝ*cxr 11189 < clt 11190 ≤ cle 11191 ℚcq 12874 (,)cioo 13265 |
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 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2708 ax-sep 5257 ax-nul 5264 ax-pow 5321 ax-pr 5385 ax-un 7673 ax-cnex 11108 ax-resscn 11109 ax-1cn 11110 ax-icn 11111 ax-addcl 11112 ax-addrcl 11113 ax-mulcl 11114 ax-mulrcl 11115 ax-mulcom 11116 ax-addass 11117 ax-mulass 11118 ax-distr 11119 ax-i2m1 11120 ax-1ne0 11121 ax-1rid 11122 ax-rnegex 11123 ax-rrecex 11124 ax-cnre 11125 ax-pre-lttri 11126 ax-pre-lttrn 11127 ax-pre-ltadd 11128 ax-pre-mulgt0 11129 ax-pre-sup 11130 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2890 df-ne 2945 df-nel 3051 df-ral 3066 df-rex 3075 df-rmo 3354 df-reu 3355 df-rab 3409 df-v 3448 df-sbc 3741 df-csb 3857 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3930 df-nul 4284 df-if 4488 df-pw 4563 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4867 df-iun 4957 df-br 5107 df-opab 5169 df-mpt 5190 df-tr 5224 df-id 5532 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5589 df-we 5591 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6254 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6499 df-fn 6500 df-f 6501 df-f1 6502 df-fo 6503 df-f1o 6504 df-fv 6505 df-riota 7314 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7804 df-1st 7922 df-2nd 7923 df-frecs 8213 df-wrecs 8244 df-recs 8318 df-rdg 8357 df-er 8649 df-en 8885 df-dom 8886 df-sdom 8887 df-sup 9379 df-inf 9380 df-pnf 11192 df-mnf 11193 df-xr 11194 df-ltxr 11195 df-le 11196 df-sub 11388 df-neg 11389 df-div 11814 df-nn 12155 df-n0 12415 df-z 12501 df-uz 12765 df-q 12875 df-ioo 13269 |
This theorem is referenced by: hoiqssbllem3 44872 |
Copyright terms: Public domain | W3C validator |