Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > supxrleubrnmptf | Structured version Visualization version GIF version |
Description: The supremum of a nonempty bounded indexed set of extended reals is less than or equal to an upper bound. (Contributed by Glauco Siliprandi, 2-Jan-2022.) |
Ref | Expression |
---|---|
supxrleubrnmptf.x | ⊢ Ⅎ𝑥𝜑 |
supxrleubrnmptf.a | ⊢ Ⅎ𝑥𝐴 |
supxrleubrnmptf.n | ⊢ Ⅎ𝑥𝐶 |
supxrleubrnmptf.b | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ*) |
supxrleubrnmptf.c | ⊢ (𝜑 → 𝐶 ∈ ℝ*) |
Ref | Expression |
---|---|
supxrleubrnmptf | ⊢ (𝜑 → (sup(ran (𝑥 ∈ 𝐴 ↦ 𝐵), ℝ*, < ) ≤ 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | supxrleubrnmptf.a | . . . . . . 7 ⊢ Ⅎ𝑥𝐴 | |
2 | nfcv 2979 | . . . . . . 7 ⊢ Ⅎ𝑦𝐴 | |
3 | nfcv 2979 | . . . . . . 7 ⊢ Ⅎ𝑦𝐵 | |
4 | nfcsb1v 3909 | . . . . . . 7 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐵 | |
5 | csbeq1a 3899 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → 𝐵 = ⦋𝑦 / 𝑥⦌𝐵) | |
6 | 1, 2, 3, 4, 5 | cbvmptf 5167 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑦 ∈ 𝐴 ↦ ⦋𝑦 / 𝑥⦌𝐵) |
7 | 6 | rneqi 5809 | . . . . 5 ⊢ ran (𝑥 ∈ 𝐴 ↦ 𝐵) = ran (𝑦 ∈ 𝐴 ↦ ⦋𝑦 / 𝑥⦌𝐵) |
8 | 7 | supeq1i 8913 | . . . 4 ⊢ sup(ran (𝑥 ∈ 𝐴 ↦ 𝐵), ℝ*, < ) = sup(ran (𝑦 ∈ 𝐴 ↦ ⦋𝑦 / 𝑥⦌𝐵), ℝ*, < ) |
9 | 8 | breq1i 5075 | . . 3 ⊢ (sup(ran (𝑥 ∈ 𝐴 ↦ 𝐵), ℝ*, < ) ≤ 𝐶 ↔ sup(ran (𝑦 ∈ 𝐴 ↦ ⦋𝑦 / 𝑥⦌𝐵), ℝ*, < ) ≤ 𝐶) |
10 | 9 | a1i 11 | . 2 ⊢ (𝜑 → (sup(ran (𝑥 ∈ 𝐴 ↦ 𝐵), ℝ*, < ) ≤ 𝐶 ↔ sup(ran (𝑦 ∈ 𝐴 ↦ ⦋𝑦 / 𝑥⦌𝐵), ℝ*, < ) ≤ 𝐶)) |
11 | nfv 1915 | . . 3 ⊢ Ⅎ𝑦𝜑 | |
12 | supxrleubrnmptf.x | . . . . . 6 ⊢ Ⅎ𝑥𝜑 | |
13 | 1 | nfcri 2973 | . . . . . 6 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐴 |
14 | 12, 13 | nfan 1900 | . . . . 5 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑦 ∈ 𝐴) |
15 | 4 | nfel1 2996 | . . . . 5 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐵 ∈ ℝ* |
16 | 14, 15 | nfim 1897 | . . . 4 ⊢ Ⅎ𝑥((𝜑 ∧ 𝑦 ∈ 𝐴) → ⦋𝑦 / 𝑥⦌𝐵 ∈ ℝ*) |
17 | eleq1w 2897 | . . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) | |
18 | 17 | anbi2d 630 | . . . . 5 ⊢ (𝑥 = 𝑦 → ((𝜑 ∧ 𝑥 ∈ 𝐴) ↔ (𝜑 ∧ 𝑦 ∈ 𝐴))) |
19 | 5 | eleq1d 2899 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝐵 ∈ ℝ* ↔ ⦋𝑦 / 𝑥⦌𝐵 ∈ ℝ*)) |
20 | 18, 19 | imbi12d 347 | . . . 4 ⊢ (𝑥 = 𝑦 → (((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ*) ↔ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ⦋𝑦 / 𝑥⦌𝐵 ∈ ℝ*))) |
21 | supxrleubrnmptf.b | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ*) | |
22 | 16, 20, 21 | chvarfv 2242 | . . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ⦋𝑦 / 𝑥⦌𝐵 ∈ ℝ*) |
23 | supxrleubrnmptf.c | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ*) | |
24 | 11, 22, 23 | supxrleubrnmpt 41686 | . 2 ⊢ (𝜑 → (sup(ran (𝑦 ∈ 𝐴 ↦ ⦋𝑦 / 𝑥⦌𝐵), ℝ*, < ) ≤ 𝐶 ↔ ∀𝑦 ∈ 𝐴 ⦋𝑦 / 𝑥⦌𝐵 ≤ 𝐶)) |
25 | nfcv 2979 | . . . . 5 ⊢ Ⅎ𝑥 ≤ | |
26 | supxrleubrnmptf.n | . . . . 5 ⊢ Ⅎ𝑥𝐶 | |
27 | 4, 25, 26 | nfbr 5115 | . . . 4 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐵 ≤ 𝐶 |
28 | nfv 1915 | . . . 4 ⊢ Ⅎ𝑦 𝐵 ≤ 𝐶 | |
29 | eqcom 2830 | . . . . . . . 8 ⊢ (𝑥 = 𝑦 ↔ 𝑦 = 𝑥) | |
30 | 29 | imbi1i 352 | . . . . . . 7 ⊢ ((𝑥 = 𝑦 → 𝐵 = ⦋𝑦 / 𝑥⦌𝐵) ↔ (𝑦 = 𝑥 → 𝐵 = ⦋𝑦 / 𝑥⦌𝐵)) |
31 | eqcom 2830 | . . . . . . . 8 ⊢ (𝐵 = ⦋𝑦 / 𝑥⦌𝐵 ↔ ⦋𝑦 / 𝑥⦌𝐵 = 𝐵) | |
32 | 31 | imbi2i 338 | . . . . . . 7 ⊢ ((𝑦 = 𝑥 → 𝐵 = ⦋𝑦 / 𝑥⦌𝐵) ↔ (𝑦 = 𝑥 → ⦋𝑦 / 𝑥⦌𝐵 = 𝐵)) |
33 | 30, 32 | bitri 277 | . . . . . 6 ⊢ ((𝑥 = 𝑦 → 𝐵 = ⦋𝑦 / 𝑥⦌𝐵) ↔ (𝑦 = 𝑥 → ⦋𝑦 / 𝑥⦌𝐵 = 𝐵)) |
34 | 5, 33 | mpbi 232 | . . . . 5 ⊢ (𝑦 = 𝑥 → ⦋𝑦 / 𝑥⦌𝐵 = 𝐵) |
35 | 34 | breq1d 5078 | . . . 4 ⊢ (𝑦 = 𝑥 → (⦋𝑦 / 𝑥⦌𝐵 ≤ 𝐶 ↔ 𝐵 ≤ 𝐶)) |
36 | 2, 1, 27, 28, 35 | cbvralfw 3439 | . . 3 ⊢ (∀𝑦 ∈ 𝐴 ⦋𝑦 / 𝑥⦌𝐵 ≤ 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝐶) |
37 | 36 | a1i 11 | . 2 ⊢ (𝜑 → (∀𝑦 ∈ 𝐴 ⦋𝑦 / 𝑥⦌𝐵 ≤ 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝐶)) |
38 | 10, 24, 37 | 3bitrd 307 | 1 ⊢ (𝜑 → (sup(ran (𝑥 ∈ 𝐴 ↦ 𝐵), ℝ*, < ) ≤ 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 Ⅎwnf 1784 ∈ wcel 2114 Ⅎwnfc 2963 ∀wral 3140 ⦋csb 3885 class class class wbr 5068 ↦ cmpt 5148 ran crn 5558 supcsup 8906 ℝ*cxr 10676 < clt 10677 ≤ cle 10678 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 ax-pre-sup 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-po 5476 df-so 5477 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-er 8291 df-en 8512 df-dom 8513 df-sdom 8514 df-sup 8908 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 |
This theorem is referenced by: liminflelimsuplem 42063 |
Copyright terms: Public domain | W3C validator |