![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > infrnmptle | Structured version Visualization version GIF version |
Description: An indexed infimum of extended reals is smaller than another indexed infimum of extended reals, when every indexed element is smaller than the corresponding one. (Contributed by Glauco Siliprandi, 23-Oct-2021.) |
Ref | Expression |
---|---|
infrnmptle.x | ⊢ Ⅎ𝑥𝜑 |
infrnmptle.b | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ*) |
infrnmptle.c | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℝ*) |
infrnmptle.l | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ≤ 𝐶) |
Ref | Expression |
---|---|
infrnmptle | ⊢ (𝜑 → inf(ran (𝑥 ∈ 𝐴 ↦ 𝐵), ℝ*, < ) ≤ inf(ran (𝑥 ∈ 𝐴 ↦ 𝐶), ℝ*, < )) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1992 | . 2 ⊢ Ⅎ𝑦𝜑 | |
2 | nfv 1992 | . 2 ⊢ Ⅎ𝑧𝜑 | |
3 | infrnmptle.x | . . 3 ⊢ Ⅎ𝑥𝜑 | |
4 | eqid 2760 | . . 3 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
5 | infrnmptle.b | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ*) | |
6 | 3, 4, 5 | rnmptssd 39884 | . 2 ⊢ (𝜑 → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ ℝ*) |
7 | eqid 2760 | . . 3 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐶) = (𝑥 ∈ 𝐴 ↦ 𝐶) | |
8 | infrnmptle.c | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℝ*) | |
9 | 3, 7, 8 | rnmptssd 39884 | . 2 ⊢ (𝜑 → ran (𝑥 ∈ 𝐴 ↦ 𝐶) ⊆ ℝ*) |
10 | vex 3343 | . . . . . 6 ⊢ 𝑦 ∈ V | |
11 | 7 | elrnmpt 5527 | . . . . . 6 ⊢ (𝑦 ∈ V → (𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐶) ↔ ∃𝑥 ∈ 𝐴 𝑦 = 𝐶)) |
12 | 10, 11 | ax-mp 5 | . . . . 5 ⊢ (𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐶) ↔ ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) |
13 | 12 | biimpi 206 | . . . 4 ⊢ (𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐶) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) |
14 | 13 | adantl 473 | . . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐶)) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) |
15 | nfmpt1 4899 | . . . . . . 7 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐵) | |
16 | 15 | nfrn 5523 | . . . . . 6 ⊢ Ⅎ𝑥ran (𝑥 ∈ 𝐴 ↦ 𝐵) |
17 | nfv 1992 | . . . . . 6 ⊢ Ⅎ𝑥 𝑧 ≤ 𝑦 | |
18 | 16, 17 | nfrex 3145 | . . . . 5 ⊢ Ⅎ𝑥∃𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦 |
19 | simpr 479 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴) | |
20 | 4 | elrnmpt1 5529 | . . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ ℝ*) → 𝐵 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) |
21 | 19, 5, 20 | syl2anc 696 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) |
22 | 21 | 3adant3 1127 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) → 𝐵 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) |
23 | infrnmptle.l | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ≤ 𝐶) | |
24 | 23 | 3adant3 1127 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) → 𝐵 ≤ 𝐶) |
25 | id 22 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐶 → 𝑦 = 𝐶) | |
26 | 25 | eqcomd 2766 | . . . . . . . . 9 ⊢ (𝑦 = 𝐶 → 𝐶 = 𝑦) |
27 | 26 | 3ad2ant3 1130 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) → 𝐶 = 𝑦) |
28 | 24, 27 | breqtrd 4830 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) → 𝐵 ≤ 𝑦) |
29 | breq1 4807 | . . . . . . . 8 ⊢ (𝑧 = 𝐵 → (𝑧 ≤ 𝑦 ↔ 𝐵 ≤ 𝑦)) | |
30 | 29 | rspcev 3449 | . . . . . . 7 ⊢ ((𝐵 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ 𝐵 ≤ 𝑦) → ∃𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦) |
31 | 22, 28, 30 | syl2anc 696 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) → ∃𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦) |
32 | 31 | 3exp 1113 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → (𝑦 = 𝐶 → ∃𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦))) |
33 | 3, 18, 32 | rexlimd 3164 | . . . 4 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝑦 = 𝐶 → ∃𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦)) |
34 | 33 | adantr 472 | . . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐶)) → (∃𝑥 ∈ 𝐴 𝑦 = 𝐶 → ∃𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦)) |
35 | 14, 34 | mpd 15 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐶)) → ∃𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦) |
36 | 1, 2, 6, 9, 35 | infleinf2 40139 | 1 ⊢ (𝜑 → inf(ran (𝑥 ∈ 𝐴 ↦ 𝐵), ℝ*, < ) ≤ inf(ran (𝑥 ∈ 𝐴 ↦ 𝐶), ℝ*, < )) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 383 ∧ w3a 1072 = wceq 1632 Ⅎwnf 1857 ∈ wcel 2139 ∃wrex 3051 Vcvv 3340 class class class wbr 4804 ↦ cmpt 4881 ran crn 5267 infcinf 8512 ℝ*cxr 10265 < clt 10266 ≤ cle 10267 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1871 ax-4 1886 ax-5 1988 ax-6 2054 ax-7 2090 ax-8 2141 ax-9 2148 ax-10 2168 ax-11 2183 ax-12 2196 ax-13 2391 ax-ext 2740 ax-sep 4933 ax-nul 4941 ax-pow 4992 ax-pr 5055 ax-un 7114 ax-cnex 10184 ax-resscn 10185 ax-1cn 10186 ax-icn 10187 ax-addcl 10188 ax-addrcl 10189 ax-mulcl 10190 ax-mulrcl 10191 ax-mulcom 10192 ax-addass 10193 ax-mulass 10194 ax-distr 10195 ax-i2m1 10196 ax-1ne0 10197 ax-1rid 10198 ax-rnegex 10199 ax-rrecex 10200 ax-cnre 10201 ax-pre-lttri 10202 ax-pre-lttrn 10203 ax-pre-ltadd 10204 ax-pre-mulgt0 10205 ax-pre-sup 10206 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1635 df-ex 1854 df-nf 1859 df-sb 2047 df-eu 2611 df-mo 2612 df-clab 2747 df-cleq 2753 df-clel 2756 df-nfc 2891 df-ne 2933 df-nel 3036 df-ral 3055 df-rex 3056 df-reu 3057 df-rmo 3058 df-rab 3059 df-v 3342 df-sbc 3577 df-csb 3675 df-dif 3718 df-un 3720 df-in 3722 df-ss 3729 df-nul 4059 df-if 4231 df-pw 4304 df-sn 4322 df-pr 4324 df-op 4328 df-uni 4589 df-br 4805 df-opab 4865 df-mpt 4882 df-id 5174 df-po 5187 df-so 5188 df-xp 5272 df-rel 5273 df-cnv 5274 df-co 5275 df-dm 5276 df-rn 5277 df-res 5278 df-ima 5279 df-iota 6012 df-fun 6051 df-fn 6052 df-f 6053 df-f1 6054 df-fo 6055 df-f1o 6056 df-fv 6057 df-riota 6774 df-ov 6816 df-oprab 6817 df-mpt2 6818 df-er 7911 df-en 8122 df-dom 8123 df-sdom 8124 df-sup 8513 df-inf 8514 df-pnf 10268 df-mnf 10269 df-xr 10270 df-ltxr 10271 df-le 10272 df-sub 10460 df-neg 10461 |
This theorem is referenced by: limsupres 40440 |
Copyright terms: Public domain | W3C validator |