| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ivthinclemum | GIF version | ||
| Description: Lemma for ivthinc 15667. The upper cut is bounded. (Contributed by Jim Kingdon, 18-Feb-2024.) |
| Ref | Expression |
|---|---|
| ivth.1 | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| ivth.2 | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
| ivth.3 | ⊢ (𝜑 → 𝑈 ∈ ℝ) |
| ivth.4 | ⊢ (𝜑 → 𝐴 < 𝐵) |
| ivth.5 | ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ 𝐷) |
| ivth.7 | ⊢ (𝜑 → 𝐹 ∈ (𝐷–cn→ℂ)) |
| ivth.8 | ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐹‘𝑥) ∈ ℝ) |
| ivth.9 | ⊢ (𝜑 → ((𝐹‘𝐴) < 𝑈 ∧ 𝑈 < (𝐹‘𝐵))) |
| ivthinc.i | ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (𝑦 ∈ (𝐴[,]𝐵) ∧ 𝑥 < 𝑦)) → (𝐹‘𝑥) < (𝐹‘𝑦)) |
| ivthinclem.l | ⊢ 𝐿 = {𝑤 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑤) < 𝑈} |
| ivthinclem.r | ⊢ 𝑅 = {𝑤 ∈ (𝐴[,]𝐵) ∣ 𝑈 < (𝐹‘𝑤)} |
| Ref | Expression |
|---|---|
| ivthinclemum | ⊢ (𝜑 → ∃𝑟 ∈ (𝐴[,]𝐵)𝑟 ∈ 𝑅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ivth.1 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 2 | 1 | rexrd 8365 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ*) |
| 3 | ivth.2 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 4 | 3 | rexrd 8365 | . . 3 ⊢ (𝜑 → 𝐵 ∈ ℝ*) |
| 5 | ivth.4 | . . . 4 ⊢ (𝜑 → 𝐴 < 𝐵) | |
| 6 | 1, 3, 5 | ltled 8435 | . . 3 ⊢ (𝜑 → 𝐴 ≤ 𝐵) |
| 7 | ubicc2 10366 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ (𝐴[,]𝐵)) | |
| 8 | 2, 4, 6, 7 | syl3anc 1278 | . 2 ⊢ (𝜑 → 𝐵 ∈ (𝐴[,]𝐵)) |
| 9 | ivth.9 | . . . 4 ⊢ (𝜑 → ((𝐹‘𝐴) < 𝑈 ∧ 𝑈 < (𝐹‘𝐵))) | |
| 10 | 9 | simprd 114 | . . 3 ⊢ (𝜑 → 𝑈 < (𝐹‘𝐵)) |
| 11 | fveq2 5690 | . . . . 5 ⊢ (𝑤 = 𝐵 → (𝐹‘𝑤) = (𝐹‘𝐵)) | |
| 12 | 11 | breq2d 4137 | . . . 4 ⊢ (𝑤 = 𝐵 → (𝑈 < (𝐹‘𝑤) ↔ 𝑈 < (𝐹‘𝐵))) |
| 13 | ivthinclem.r | . . . 4 ⊢ 𝑅 = {𝑤 ∈ (𝐴[,]𝐵) ∣ 𝑈 < (𝐹‘𝑤)} | |
| 14 | 12, 13 | elrab2 2985 | . . 3 ⊢ (𝐵 ∈ 𝑅 ↔ (𝐵 ∈ (𝐴[,]𝐵) ∧ 𝑈 < (𝐹‘𝐵))) |
| 15 | 8, 10, 14 | sylanbrc 421 | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝑅) |
| 16 | eleq1 2301 | . . 3 ⊢ (𝑟 = 𝐵 → (𝑟 ∈ 𝑅 ↔ 𝐵 ∈ 𝑅)) | |
| 17 | 16 | rspcev 2929 | . 2 ⊢ ((𝐵 ∈ (𝐴[,]𝐵) ∧ 𝐵 ∈ 𝑅) → ∃𝑟 ∈ (𝐴[,]𝐵)𝑟 ∈ 𝑅) |
| 18 | 8, 15, 17 | syl2anc 415 | 1 ⊢ (𝜑 → ∃𝑟 ∈ (𝐴[,]𝐵)𝑟 ∈ 𝑅) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ∃wrex 2529 {crab 2532 ⊆ wss 3220 class class class wbr 4125 ‘cfv 5372 (class class class)co 6075 ℂcc 8167 ℝcr 8168 ℝ*cxr 8349 < clt 8350 ≤ cle 8351 [,]cicc 10272 –cn→ccncf 15594 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-cnex 8260 ax-resscn 8261 ax-pre-ltirr 8281 ax-pre-lttrn 8283 |
| This theorem depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-br 4126 df-opab 4188 df-id 4433 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-iota 5332 df-fun 5374 df-fv 5380 df-ov 6078 df-oprab 6079 df-mpo 6080 df-pnf 8352 df-mnf 8353 df-xr 8354 df-ltxr 8355 df-le 8356 df-icc 10276 |
| This theorem is referenced by: ivthinclemex 15666 |
| Copyright terms: Public domain | W3C validator |