![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > ioom | GIF version |
Description: An open interval of extended reals is inhabited iff the lower argument is less than the upper argument. (Contributed by Jim Kingdon, 27-Nov-2021.) |
Ref | Expression |
---|---|
ioom | ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (∃𝑥 𝑥 ∈ (𝐴(,)𝐵) ↔ 𝐴 < 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elioo3g 9923 | . . . . . . . 8 ⊢ (𝑥 ∈ (𝐴(,)𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝑥 ∈ ℝ*) ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) | |
2 | 1 | biimpi 120 | . . . . . . 7 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝑥 ∈ ℝ*) ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) |
3 | 2 | simpld 112 | . . . . . 6 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝑥 ∈ ℝ*)) |
4 | 3 | simp1d 1010 | . . . . 5 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → 𝐴 ∈ ℝ*) |
5 | 3 | simp3d 1012 | . . . . 5 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → 𝑥 ∈ ℝ*) |
6 | 3 | simp2d 1011 | . . . . 5 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → 𝐵 ∈ ℝ*) |
7 | 2 | simprd 114 | . . . . . 6 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → (𝐴 < 𝑥 ∧ 𝑥 < 𝐵)) |
8 | 7 | simpld 112 | . . . . 5 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → 𝐴 < 𝑥) |
9 | 7 | simprd 114 | . . . . 5 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → 𝑥 < 𝐵) |
10 | 4, 5, 6, 8, 9 | xrlttrd 9822 | . . . 4 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → 𝐴 < 𝐵) |
11 | 10 | a1i 9 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝑥 ∈ (𝐴(,)𝐵) → 𝐴 < 𝐵)) |
12 | 11 | exlimdv 1829 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (∃𝑥 𝑥 ∈ (𝐴(,)𝐵) → 𝐴 < 𝐵)) |
13 | qbtwnxr 10271 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → ∃𝑥 ∈ ℚ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵)) | |
14 | df-rex 2471 | . . . . 5 ⊢ (∃𝑥 ∈ ℚ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ↔ ∃𝑥(𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) | |
15 | 13, 14 | sylib 122 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → ∃𝑥(𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) |
16 | simpl1 1001 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) ∧ (𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) → 𝐴 ∈ ℝ*) | |
17 | simpl2 1002 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) ∧ (𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) → 𝐵 ∈ ℝ*) | |
18 | qre 9638 | . . . . . . . . 9 ⊢ (𝑥 ∈ ℚ → 𝑥 ∈ ℝ) | |
19 | 18 | ad2antrl 490 | . . . . . . . 8 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) ∧ (𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) → 𝑥 ∈ ℝ) |
20 | 19 | rexrd 8020 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) ∧ (𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) → 𝑥 ∈ ℝ*) |
21 | simprrl 539 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) ∧ (𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) → 𝐴 < 𝑥) | |
22 | simprrr 540 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) ∧ (𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) → 𝑥 < 𝐵) | |
23 | 1 | biimpri 133 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝑥 ∈ ℝ*) ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵)) → 𝑥 ∈ (𝐴(,)𝐵)) |
24 | 16, 17, 20, 21, 22, 23 | syl32anc 1256 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) ∧ (𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) → 𝑥 ∈ (𝐴(,)𝐵)) |
25 | 24 | ex 115 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → ((𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵)) → 𝑥 ∈ (𝐴(,)𝐵))) |
26 | 25 | eximdv 1890 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → (∃𝑥(𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵)) → ∃𝑥 𝑥 ∈ (𝐴(,)𝐵))) |
27 | 15, 26 | mpd 13 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → ∃𝑥 𝑥 ∈ (𝐴(,)𝐵)) |
28 | 27 | 3expia 1206 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 < 𝐵 → ∃𝑥 𝑥 ∈ (𝐴(,)𝐵))) |
29 | 12, 28 | impbid 129 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (∃𝑥 𝑥 ∈ (𝐴(,)𝐵) ↔ 𝐴 < 𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 979 ∃wex 1502 ∈ wcel 2158 ∃wrex 2466 class class class wbr 4015 (class class class)co 5888 ℝcr 7823 ℝ*cxr 8004 < clt 8005 ℚcq 9632 (,)cioo 9901 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1457 ax-7 1458 ax-gen 1459 ax-ie1 1503 ax-ie2 1504 ax-8 1514 ax-10 1515 ax-11 1516 ax-i12 1517 ax-bndl 1519 ax-4 1520 ax-17 1536 ax-i9 1540 ax-ial 1544 ax-i5r 1545 ax-13 2160 ax-14 2161 ax-ext 2169 ax-sep 4133 ax-pow 4186 ax-pr 4221 ax-un 4445 ax-setind 4548 ax-cnex 7915 ax-resscn 7916 ax-1cn 7917 ax-1re 7918 ax-icn 7919 ax-addcl 7920 ax-addrcl 7921 ax-mulcl 7922 ax-mulrcl 7923 ax-addcom 7924 ax-mulcom 7925 ax-addass 7926 ax-mulass 7927 ax-distr 7928 ax-i2m1 7929 ax-0lt1 7930 ax-1rid 7931 ax-0id 7932 ax-rnegex 7933 ax-precex 7934 ax-cnre 7935 ax-pre-ltirr 7936 ax-pre-ltwlin 7937 ax-pre-lttrn 7938 ax-pre-apti 7939 ax-pre-ltadd 7940 ax-pre-mulgt0 7941 ax-pre-mulext 7942 ax-arch 7943 |
This theorem depends on definitions: df-bi 117 df-3or 980 df-3an 981 df-tru 1366 df-fal 1369 df-nf 1471 df-sb 1773 df-eu 2039 df-mo 2040 df-clab 2174 df-cleq 2180 df-clel 2183 df-nfc 2318 df-ne 2358 df-nel 2453 df-ral 2470 df-rex 2471 df-reu 2472 df-rmo 2473 df-rab 2474 df-v 2751 df-sbc 2975 df-csb 3070 df-dif 3143 df-un 3145 df-in 3147 df-ss 3154 df-pw 3589 df-sn 3610 df-pr 3611 df-op 3613 df-uni 3822 df-int 3857 df-iun 3900 df-br 4016 df-opab 4077 df-mpt 4078 df-id 4305 df-po 4308 df-iso 4309 df-xp 4644 df-rel 4645 df-cnv 4646 df-co 4647 df-dm 4648 df-rn 4649 df-res 4650 df-ima 4651 df-iota 5190 df-fun 5230 df-fn 5231 df-f 5232 df-fv 5236 df-riota 5844 df-ov 5891 df-oprab 5892 df-mpo 5893 df-1st 6154 df-2nd 6155 df-pnf 8007 df-mnf 8008 df-xr 8009 df-ltxr 8010 df-le 8011 df-sub 8143 df-neg 8144 df-reap 8545 df-ap 8552 df-div 8643 df-inn 8933 df-2 8991 df-n0 9190 df-z 9267 df-uz 9542 df-q 9633 df-rp 9667 df-ioo 9905 |
This theorem is referenced by: tgioo 14317 |
Copyright terms: Public domain | W3C validator |