| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > rnmptbd2 | Structured version Visualization version GIF version | ||
| Description: Boundness below of the range of a function in maps-to notation. (Contributed by Glauco Siliprandi, 23-Oct-2021.) |
| Ref | Expression |
|---|---|
| rnmptbd2.x | ⊢ Ⅎ𝑥𝜑 |
| rnmptbd2.b | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉) |
| Ref | Expression |
|---|---|
| rnmptbd2 | ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝑦 ≤ 𝐵 ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦 ≤ 𝑧)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq1 5106 | . . . . 5 ⊢ (𝑦 = 𝑤 → (𝑦 ≤ 𝐵 ↔ 𝑤 ≤ 𝐵)) | |
| 2 | 1 | ralbidv 3185 | . . . 4 ⊢ (𝑦 = 𝑤 → (∀𝑥 ∈ 𝐴 𝑦 ≤ 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑤 ≤ 𝐵)) |
| 3 | 2 | cbvrexvw 3241 | . . 3 ⊢ (∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝑦 ≤ 𝐵 ↔ ∃𝑤 ∈ ℝ ∀𝑥 ∈ 𝐴 𝑤 ≤ 𝐵) |
| 4 | 3 | a1i 11 | . 2 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝑦 ≤ 𝐵 ↔ ∃𝑤 ∈ ℝ ∀𝑥 ∈ 𝐴 𝑤 ≤ 𝐵)) |
| 5 | rnmptbd2.x | . . 3 ⊢ Ⅎ𝑥𝜑 | |
| 6 | rnmptbd2.b | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉) | |
| 7 | 5, 6 | rnmptbd2lem 46078 | . 2 ⊢ (𝜑 → (∃𝑤 ∈ ℝ ∀𝑥 ∈ 𝐴 𝑤 ≤ 𝐵 ↔ ∃𝑤 ∈ ℝ ∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑢)) |
| 8 | breq1 5106 | . . . . . 6 ⊢ (𝑤 = 𝑦 → (𝑤 ≤ 𝑢 ↔ 𝑦 ≤ 𝑢)) | |
| 9 | 8 | ralbidv 3185 | . . . . 5 ⊢ (𝑤 = 𝑦 → (∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑢 ↔ ∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦 ≤ 𝑢)) |
| 10 | breq2 5107 | . . . . . 6 ⊢ (𝑢 = 𝑧 → (𝑦 ≤ 𝑢 ↔ 𝑦 ≤ 𝑧)) | |
| 11 | 10 | cbvralvw 3240 | . . . . 5 ⊢ (∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦 ≤ 𝑢 ↔ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦 ≤ 𝑧) |
| 12 | 9, 11 | bitrdi 290 | . . . 4 ⊢ (𝑤 = 𝑦 → (∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑢 ↔ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦 ≤ 𝑧)) |
| 13 | 12 | cbvrexvw 3241 | . . 3 ⊢ (∃𝑤 ∈ ℝ ∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑢 ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦 ≤ 𝑧) |
| 14 | 13 | a1i 11 | . 2 ⊢ (𝜑 → (∃𝑤 ∈ ℝ ∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑢 ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦 ≤ 𝑧)) |
| 15 | 4, 7, 14 | 3bitrd 308 | 1 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝑦 ≤ 𝐵 ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦 ≤ 𝑧)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 Ⅎwnf 1816 ∈ wcel 2145 ∀wral 3076 ∃wrex 3086 class class class wbr 5103 ↦ cmpt 5186 ran crn 5656 ℝcr 11124 ≤ cle 11269 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 df-opab 5168 df-mpt 5187 df-cnv 5663 df-dm 5665 df-rn 5666 |
| This theorem is used by: limsupvaluz2 46567 |
| Copyright terms: Public domain | W3C validator |