| 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 10144 | . . . . . . . 8 ⊢ (𝑥 ∈ (𝐴(,)𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝑥 ∈ ℝ*) ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) | |
| 2 | 1 | biimpi 120 | . . . . . . 7 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝑥 ∈ ℝ*) ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) |
| 3 | 2 | simpld 112 | . . . . . 6 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝑥 ∈ ℝ*)) |
| 4 | 3 | simp1d 1035 | . . . . 5 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → 𝐴 ∈ ℝ*) |
| 5 | 3 | simp3d 1037 | . . . . 5 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → 𝑥 ∈ ℝ*) |
| 6 | 3 | simp2d 1036 | . . . . 5 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → 𝐵 ∈ ℝ*) |
| 7 | 2 | simprd 114 | . . . . . 6 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → (𝐴 < 𝑥 ∧ 𝑥 < 𝐵)) |
| 8 | 7 | simpld 112 | . . . . 5 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → 𝐴 < 𝑥) |
| 9 | 7 | simprd 114 | . . . . 5 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → 𝑥 < 𝐵) |
| 10 | 4, 5, 6, 8, 9 | xrlttrd 10043 | . . . 4 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → 𝐴 < 𝐵) |
| 11 | 10 | a1i 9 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝑥 ∈ (𝐴(,)𝐵) → 𝐴 < 𝐵)) |
| 12 | 11 | exlimdv 1867 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (∃𝑥 𝑥 ∈ (𝐴(,)𝐵) → 𝐴 < 𝐵)) |
| 13 | qbtwnxr 10516 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → ∃𝑥 ∈ ℚ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵)) | |
| 14 | df-rex 2516 | . . . . 5 ⊢ (∃𝑥 ∈ ℚ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ↔ ∃𝑥(𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) | |
| 15 | 13, 14 | sylib 122 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → ∃𝑥(𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) |
| 16 | simpl1 1026 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) ∧ (𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) → 𝐴 ∈ ℝ*) | |
| 17 | simpl2 1027 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) ∧ (𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) → 𝐵 ∈ ℝ*) | |
| 18 | qre 9858 | . . . . . . . . 9 ⊢ (𝑥 ∈ ℚ → 𝑥 ∈ ℝ) | |
| 19 | 18 | ad2antrl 490 | . . . . . . . 8 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) ∧ (𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) → 𝑥 ∈ ℝ) |
| 20 | 19 | rexrd 8228 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) ∧ (𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) → 𝑥 ∈ ℝ*) |
| 21 | simprrl 541 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) ∧ (𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) → 𝐴 < 𝑥) | |
| 22 | simprrr 542 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) ∧ (𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) → 𝑥 < 𝐵) | |
| 23 | 1 | biimpri 133 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝑥 ∈ ℝ*) ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵)) → 𝑥 ∈ (𝐴(,)𝐵)) |
| 24 | 16, 17, 20, 21, 22, 23 | syl32anc 1281 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) ∧ (𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))) → 𝑥 ∈ (𝐴(,)𝐵)) |
| 25 | 24 | ex 115 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → ((𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵)) → 𝑥 ∈ (𝐴(,)𝐵))) |
| 26 | 25 | eximdv 1928 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → (∃𝑥(𝑥 ∈ ℚ ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵)) → ∃𝑥 𝑥 ∈ (𝐴(,)𝐵))) |
| 27 | 15, 26 | mpd 13 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 < 𝐵) → ∃𝑥 𝑥 ∈ (𝐴(,)𝐵)) |
| 28 | 27 | 3expia 1231 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 < 𝐵 → ∃𝑥 𝑥 ∈ (𝐴(,)𝐵))) |
| 29 | 12, 28 | impbid 129 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (∃𝑥 𝑥 ∈ (𝐴(,)𝐵) ↔ 𝐴 < 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1004 ∃wex 1540 ∈ wcel 2202 ∃wrex 2511 class class class wbr 4088 (class class class)co 6017 ℝcr 8030 ℝ*cxr 8212 < clt 8213 ℚcq 9852 (,)cioo 10122 |
| 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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-mulrcl 8130 ax-addcom 8131 ax-mulcom 8132 ax-addass 8133 ax-mulass 8134 ax-distr 8135 ax-i2m1 8136 ax-0lt1 8137 ax-1rid 8138 ax-0id 8139 ax-rnegex 8140 ax-precex 8141 ax-cnre 8142 ax-pre-ltirr 8143 ax-pre-ltwlin 8144 ax-pre-lttrn 8145 ax-pre-apti 8146 ax-pre-ltadd 8147 ax-pre-mulgt0 8148 ax-pre-mulext 8149 ax-arch 8150 |
| This theorem depends on definitions: df-bi 117 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-po 4393 df-iso 4394 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-fv 5334 df-riota 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-1st 6302 df-2nd 6303 df-pnf 8215 df-mnf 8216 df-xr 8217 df-ltxr 8218 df-le 8219 df-sub 8351 df-neg 8352 df-reap 8754 df-ap 8761 df-div 8852 df-inn 9143 df-2 9201 df-n0 9402 df-z 9479 df-uz 9755 df-q 9853 df-rp 9888 df-ioo 10126 |
| This theorem is referenced by: tgioo 15277 |
| Copyright terms: Public domain | W3C validator |