![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > eliccnelico | Structured version Visualization version GIF version |
Description: An element of a closed interval that is not a member of the left-closed right-open interval, must be the upper bound. (Contributed by Glauco Siliprandi, 17-Aug-2020.) |
Ref | Expression |
---|---|
eliccnelico.1 | ⊢ (𝜑 → 𝐴 ∈ ℝ*) |
eliccnelico.b | ⊢ (𝜑 → 𝐵 ∈ ℝ*) |
eliccnelico.c | ⊢ (𝜑 → 𝐶 ∈ (𝐴[,]𝐵)) |
eliccnelico.nel | ⊢ (𝜑 → ¬ 𝐶 ∈ (𝐴[,)𝐵)) |
Ref | Expression |
---|---|
eliccnelico | ⊢ (𝜑 → 𝐶 = 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eliccnelico.c | . . 3 ⊢ (𝜑 → 𝐶 ∈ (𝐴[,]𝐵)) | |
2 | eliccxr 13349 | . . 3 ⊢ (𝐶 ∈ (𝐴[,]𝐵) → 𝐶 ∈ ℝ*) | |
3 | 1, 2 | syl 17 | . 2 ⊢ (𝜑 → 𝐶 ∈ ℝ*) |
4 | eliccnelico.b | . 2 ⊢ (𝜑 → 𝐵 ∈ ℝ*) | |
5 | eliccnelico.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ*) | |
6 | iccleub 13316 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ (𝐴[,]𝐵)) → 𝐶 ≤ 𝐵) | |
7 | 5, 4, 1, 6 | syl3anc 1371 | . 2 ⊢ (𝜑 → 𝐶 ≤ 𝐵) |
8 | 5 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝐶) → 𝐴 ∈ ℝ*) |
9 | 4 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝐶) → 𝐵 ∈ ℝ*) |
10 | 3 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝐶) → 𝐶 ∈ ℝ*) |
11 | iccgelb 13317 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ (𝐴[,]𝐵)) → 𝐴 ≤ 𝐶) | |
12 | 5, 4, 1, 11 | syl3anc 1371 | . . . . 5 ⊢ (𝜑 → 𝐴 ≤ 𝐶) |
13 | 12 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝐶) → 𝐴 ≤ 𝐶) |
14 | simpr 485 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝐶) → ¬ 𝐵 ≤ 𝐶) | |
15 | xrltnle 11219 | . . . . . . 7 ⊢ ((𝐶 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 < 𝐵 ↔ ¬ 𝐵 ≤ 𝐶)) | |
16 | 3, 4, 15 | syl2anc 584 | . . . . . 6 ⊢ (𝜑 → (𝐶 < 𝐵 ↔ ¬ 𝐵 ≤ 𝐶)) |
17 | 16 | adantr 481 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝐶) → (𝐶 < 𝐵 ↔ ¬ 𝐵 ≤ 𝐶)) |
18 | 14, 17 | mpbird 256 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝐶) → 𝐶 < 𝐵) |
19 | 8, 9, 10, 13, 18 | elicod 13311 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝐶) → 𝐶 ∈ (𝐴[,)𝐵)) |
20 | eliccnelico.nel | . . . 4 ⊢ (𝜑 → ¬ 𝐶 ∈ (𝐴[,)𝐵)) | |
21 | 20 | adantr 481 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 𝐶) → ¬ 𝐶 ∈ (𝐴[,)𝐵)) |
22 | 19, 21 | condan 816 | . 2 ⊢ (𝜑 → 𝐵 ≤ 𝐶) |
23 | 3, 4, 7, 22 | xrletrid 13071 | 1 ⊢ (𝜑 → 𝐶 = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 class class class wbr 5104 (class class class)co 7354 ℝ*cxr 11185 < clt 11186 ≤ cle 11187 [,)cico 13263 [,]cicc 13264 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 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 2707 ax-sep 5255 ax-nul 5262 ax-pow 5319 ax-pr 5383 ax-un 7669 ax-cnex 11104 ax-resscn 11105 ax-pre-lttri 11122 ax-pre-lttrn 11123 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3064 df-rex 3073 df-rab 3407 df-v 3446 df-sbc 3739 df-csb 3855 df-dif 3912 df-un 3914 df-in 3916 df-ss 3926 df-nul 4282 df-if 4486 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4865 df-iun 4955 df-br 5105 df-opab 5167 df-mpt 5188 df-id 5530 df-po 5544 df-so 5545 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6446 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-ov 7357 df-oprab 7358 df-mpo 7359 df-1st 7918 df-2nd 7919 df-er 8645 df-en 8881 df-dom 8882 df-sdom 8883 df-pnf 11188 df-mnf 11189 df-xr 11190 df-ltxr 11191 df-le 11192 df-ico 13267 df-icc 13268 |
This theorem is referenced by: sge0f1o 44593 |
Copyright terms: Public domain | W3C validator |