| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > hoidifhspval3 | Structured version Visualization version GIF version | ||
| Description: 𝐷 is a function that returns the representation of the left side of the difference of a half-open interval and a half-space. Used in Lemma 115F of [Fremlin1] p. 31 . (Contributed by Glauco Siliprandi, 24-Dec-2020.) |
| Ref | Expression |
|---|---|
| hoidifhspval3.d | ⊢ 𝐷 = (𝑥 ∈ ℝ ↦ (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘))))) |
| hoidifhspval3.y | ⊢ (𝜑 → 𝑌 ∈ ℝ) |
| hoidifhspval3.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| hoidifhspval3.a | ⊢ (𝜑 → 𝐴:𝑋⟶ℝ) |
| hoidifhspval3.j | ⊢ (𝜑 → 𝐽 ∈ 𝑋) |
| Ref | Expression |
|---|---|
| hoidifhspval3 | ⊢ (𝜑 → (((𝐷‘𝑌)‘𝐴)‘𝐽) = if(𝐽 = 𝐾, if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌), (𝐴‘𝐽))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hoidifhspval3.d | . . 3 ⊢ 𝐷 = (𝑥 ∈ ℝ ↦ (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘))))) | |
| 2 | hoidifhspval3.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ ℝ) | |
| 3 | hoidifhspval3.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 4 | hoidifhspval3.a | . . 3 ⊢ (𝜑 → 𝐴:𝑋⟶ℝ) | |
| 5 | 1, 2, 3, 4 | hoidifhspval2 47221 | . 2 ⊢ (𝜑 → ((𝐷‘𝑌)‘𝐴) = (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘)))) |
| 6 | eqeq1 2773 | . . . 4 ⊢ (𝑘 = 𝐽 → (𝑘 = 𝐾 ↔ 𝐽 = 𝐾)) | |
| 7 | fveq2 6882 | . . . . . 6 ⊢ (𝑘 = 𝐽 → (𝐴‘𝑘) = (𝐴‘𝐽)) | |
| 8 | 7 | breq2d 5125 | . . . . 5 ⊢ (𝑘 = 𝐽 → (𝑌 ≤ (𝐴‘𝑘) ↔ 𝑌 ≤ (𝐴‘𝐽))) |
| 9 | 8, 7 | ifbieq1d 4517 | . . . 4 ⊢ (𝑘 = 𝐽 → if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌) = if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌)) |
| 10 | 6, 9, 7 | ifbieq12d 4521 | . . 3 ⊢ (𝑘 = 𝐽 → if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘)) = if(𝐽 = 𝐾, if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌), (𝐴‘𝐽))) |
| 11 | 10 | adantl 486 | . 2 ⊢ ((𝜑 ∧ 𝑘 = 𝐽) → if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘)) = if(𝐽 = 𝐾, if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌), (𝐴‘𝐽))) |
| 12 | hoidifhspval3.j | . 2 ⊢ (𝜑 → 𝐽 ∈ 𝑋) | |
| 13 | fvexd 6897 | . . . 4 ⊢ (𝜑 → (𝐴‘𝐽) ∈ V) | |
| 14 | 2 | elexd 3486 | . . . 4 ⊢ (𝜑 → 𝑌 ∈ V) |
| 15 | 13, 14 | ifcld 4539 | . . 3 ⊢ (𝜑 → if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌) ∈ V) |
| 16 | 15, 13 | ifcld 4539 | . 2 ⊢ (𝜑 → if(𝐽 = 𝐾, if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌), (𝐴‘𝐽)) ∈ V) |
| 17 | 5, 11, 12, 16 | fvmptd 6998 | 1 ⊢ (𝜑 → (((𝐷‘𝑌)‘𝐴)‘𝐽) = if(𝐽 = 𝐾, if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌), (𝐴‘𝐽))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1567 ∈ wcel 2149 Vcvv 3463 ifcif 4492 class class class wbr 5113 ↦ cmpt 5196 ⟶wf 6533 ‘cfv 6537 (class class class)co 7411 ↑m cmap 8824 ℝcr 11099 ≤ cle 11244 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7414 df-oprab 7415 df-mpo 7416 df-map 8826 |
| This theorem is referenced by: hoidifhspdmvle 47226 hspmbllem1 47232 hspmbllem2 47233 |
| Copyright terms: Public domain | W3C validator |