Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  hsphoival Structured version   Visualization version   GIF version

Theorem hsphoival 44810
Description: 𝐻 is a function (that returns the representation of the right side of a half-open interval intersected with a half-space). Step (b) in Lemma 115B of [Fremlin1] p. 29. (Contributed by Glauco Siliprandi, 21-Nov-2020.)
Hypotheses
Ref Expression
hsphoival.h 𝐻 = (𝑥 ∈ ℝ ↦ (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑗𝑋 ↦ if(𝑗𝑌, (𝑎𝑗), if((𝑎𝑗) ≤ 𝑥, (𝑎𝑗), 𝑥)))))
hsphoival.a (𝜑𝐴 ∈ ℝ)
hsphoival.x (𝜑𝑋𝑉)
hsphoival.b (𝜑𝐵:𝑋⟶ℝ)
hsphoival.k (𝜑𝐾𝑋)
Assertion
Ref Expression
hsphoival (𝜑 → (((𝐻𝐴)‘𝐵)‘𝐾) = if(𝐾𝑌, (𝐵𝐾), if((𝐵𝐾) ≤ 𝐴, (𝐵𝐾), 𝐴)))
Distinct variable groups:   𝐴,𝑎,𝑗,𝑥   𝐵,𝑎,𝑗   𝑗,𝐾   𝑋,𝑎,𝑗,𝑥   𝑌,𝑎,𝑗,𝑥   𝜑,𝑎,𝑗,𝑥
Allowed substitution hints:   𝐵(𝑥)   𝐻(𝑥,𝑗,𝑎)   𝐾(𝑥,𝑎)   𝑉(𝑥,𝑗,𝑎)

Proof of Theorem hsphoival
StepHypRef Expression
1 hsphoival.h . . . 4 𝐻 = (𝑥 ∈ ℝ ↦ (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑗𝑋 ↦ if(𝑗𝑌, (𝑎𝑗), if((𝑎𝑗) ≤ 𝑥, (𝑎𝑗), 𝑥)))))
2 breq2 5109 . . . . . . . 8 (𝑥 = 𝐴 → ((𝑎𝑗) ≤ 𝑥 ↔ (𝑎𝑗) ≤ 𝐴))
3 id 22 . . . . . . . 8 (𝑥 = 𝐴𝑥 = 𝐴)
42, 3ifbieq2d 4512 . . . . . . 7 (𝑥 = 𝐴 → if((𝑎𝑗) ≤ 𝑥, (𝑎𝑗), 𝑥) = if((𝑎𝑗) ≤ 𝐴, (𝑎𝑗), 𝐴))
54ifeq2d 4506 . . . . . 6 (𝑥 = 𝐴 → if(𝑗𝑌, (𝑎𝑗), if((𝑎𝑗) ≤ 𝑥, (𝑎𝑗), 𝑥)) = if(𝑗𝑌, (𝑎𝑗), if((𝑎𝑗) ≤ 𝐴, (𝑎𝑗), 𝐴)))
65mpteq2dv 5207 . . . . 5 (𝑥 = 𝐴 → (𝑗𝑋 ↦ if(𝑗𝑌, (𝑎𝑗), if((𝑎𝑗) ≤ 𝑥, (𝑎𝑗), 𝑥))) = (𝑗𝑋 ↦ if(𝑗𝑌, (𝑎𝑗), if((𝑎𝑗) ≤ 𝐴, (𝑎𝑗), 𝐴))))
76mpteq2dv 5207 . . . 4 (𝑥 = 𝐴 → (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑗𝑋 ↦ if(𝑗𝑌, (𝑎𝑗), if((𝑎𝑗) ≤ 𝑥, (𝑎𝑗), 𝑥)))) = (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑗𝑋 ↦ if(𝑗𝑌, (𝑎𝑗), if((𝑎𝑗) ≤ 𝐴, (𝑎𝑗), 𝐴)))))
8 hsphoival.a . . . 4 (𝜑𝐴 ∈ ℝ)
9 ovex 7390 . . . . . 6 (ℝ ↑m 𝑋) ∈ V
109mptex 7173 . . . . 5 (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑗𝑋 ↦ if(𝑗𝑌, (𝑎𝑗), if((𝑎𝑗) ≤ 𝐴, (𝑎𝑗), 𝐴)))) ∈ V
1110a1i 11 . . . 4 (𝜑 → (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑗𝑋 ↦ if(𝑗𝑌, (𝑎𝑗), if((𝑎𝑗) ≤ 𝐴, (𝑎𝑗), 𝐴)))) ∈ V)
121, 7, 8, 11fvmptd3 6971 . . 3 (𝜑 → (𝐻𝐴) = (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑗𝑋 ↦ if(𝑗𝑌, (𝑎𝑗), if((𝑎𝑗) ≤ 𝐴, (𝑎𝑗), 𝐴)))))
13 fveq1 6841 . . . . . 6 (𝑎 = 𝐵 → (𝑎𝑗) = (𝐵𝑗))
1413breq1d 5115 . . . . . . 7 (𝑎 = 𝐵 → ((𝑎𝑗) ≤ 𝐴 ↔ (𝐵𝑗) ≤ 𝐴))
1514, 13ifbieq1d 4510 . . . . . 6 (𝑎 = 𝐵 → if((𝑎𝑗) ≤ 𝐴, (𝑎𝑗), 𝐴) = if((𝐵𝑗) ≤ 𝐴, (𝐵𝑗), 𝐴))
1613, 15ifeq12d 4507 . . . . 5 (𝑎 = 𝐵 → if(𝑗𝑌, (𝑎𝑗), if((𝑎𝑗) ≤ 𝐴, (𝑎𝑗), 𝐴)) = if(𝑗𝑌, (𝐵𝑗), if((𝐵𝑗) ≤ 𝐴, (𝐵𝑗), 𝐴)))
1716mpteq2dv 5207 . . . 4 (𝑎 = 𝐵 → (𝑗𝑋 ↦ if(𝑗𝑌, (𝑎𝑗), if((𝑎𝑗) ≤ 𝐴, (𝑎𝑗), 𝐴))) = (𝑗𝑋 ↦ if(𝑗𝑌, (𝐵𝑗), if((𝐵𝑗) ≤ 𝐴, (𝐵𝑗), 𝐴))))
1817adantl 482 . . 3 ((𝜑𝑎 = 𝐵) → (𝑗𝑋 ↦ if(𝑗𝑌, (𝑎𝑗), if((𝑎𝑗) ≤ 𝐴, (𝑎𝑗), 𝐴))) = (𝑗𝑋 ↦ if(𝑗𝑌, (𝐵𝑗), if((𝐵𝑗) ≤ 𝐴, (𝐵𝑗), 𝐴))))
19 hsphoival.b . . . 4 (𝜑𝐵:𝑋⟶ℝ)
20 reex 11142 . . . . . . 7 ℝ ∈ V
2120a1i 11 . . . . . 6 (𝜑 → ℝ ∈ V)
22 hsphoival.x . . . . . 6 (𝜑𝑋𝑉)
2321, 22jca 512 . . . . 5 (𝜑 → (ℝ ∈ V ∧ 𝑋𝑉))
24 elmapg 8778 . . . . 5 ((ℝ ∈ V ∧ 𝑋𝑉) → (𝐵 ∈ (ℝ ↑m 𝑋) ↔ 𝐵:𝑋⟶ℝ))
2523, 24syl 17 . . . 4 (𝜑 → (𝐵 ∈ (ℝ ↑m 𝑋) ↔ 𝐵:𝑋⟶ℝ))
2619, 25mpbird 256 . . 3 (𝜑𝐵 ∈ (ℝ ↑m 𝑋))
27 mptexg 7171 . . . 4 (𝑋𝑉 → (𝑗𝑋 ↦ if(𝑗𝑌, (𝐵𝑗), if((𝐵𝑗) ≤ 𝐴, (𝐵𝑗), 𝐴))) ∈ V)
2822, 27syl 17 . . 3 (𝜑 → (𝑗𝑋 ↦ if(𝑗𝑌, (𝐵𝑗), if((𝐵𝑗) ≤ 𝐴, (𝐵𝑗), 𝐴))) ∈ V)
2912, 18, 26, 28fvmptd 6955 . 2 (𝜑 → ((𝐻𝐴)‘𝐵) = (𝑗𝑋 ↦ if(𝑗𝑌, (𝐵𝑗), if((𝐵𝑗) ≤ 𝐴, (𝐵𝑗), 𝐴))))
30 eleq1 2825 . . . 4 (𝑗 = 𝐾 → (𝑗𝑌𝐾𝑌))
31 fveq2 6842 . . . 4 (𝑗 = 𝐾 → (𝐵𝑗) = (𝐵𝐾))
3231breq1d 5115 . . . . 5 (𝑗 = 𝐾 → ((𝐵𝑗) ≤ 𝐴 ↔ (𝐵𝐾) ≤ 𝐴))
3332, 31ifbieq1d 4510 . . . 4 (𝑗 = 𝐾 → if((𝐵𝑗) ≤ 𝐴, (𝐵𝑗), 𝐴) = if((𝐵𝐾) ≤ 𝐴, (𝐵𝐾), 𝐴))
3430, 31, 33ifbieq12d 4514 . . 3 (𝑗 = 𝐾 → if(𝑗𝑌, (𝐵𝑗), if((𝐵𝑗) ≤ 𝐴, (𝐵𝑗), 𝐴)) = if(𝐾𝑌, (𝐵𝐾), if((𝐵𝐾) ≤ 𝐴, (𝐵𝐾), 𝐴)))
3534adantl 482 . 2 ((𝜑𝑗 = 𝐾) → if(𝑗𝑌, (𝐵𝑗), if((𝐵𝑗) ≤ 𝐴, (𝐵𝑗), 𝐴)) = if(𝐾𝑌, (𝐵𝐾), if((𝐵𝐾) ≤ 𝐴, (𝐵𝐾), 𝐴)))
36 hsphoival.k . 2 (𝜑𝐾𝑋)
3719, 36ffvelcdmd 7036 . . 3 (𝜑 → (𝐵𝐾) ∈ ℝ)
3837, 8ifcld 4532 . . 3 (𝜑 → if((𝐵𝐾) ≤ 𝐴, (𝐵𝐾), 𝐴) ∈ ℝ)
3937, 38ifexd 4534 . 2 (𝜑 → if(𝐾𝑌, (𝐵𝐾), if((𝐵𝐾) ≤ 𝐴, (𝐵𝐾), 𝐴)) ∈ V)
4029, 35, 36, 39fvmptd 6955 1 (𝜑 → (((𝐻𝐴)‘𝐵)‘𝐾) = if(𝐾𝑌, (𝐵𝐾), if((𝐵𝐾) ≤ 𝐴, (𝐵𝐾), 𝐴)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1541  wcel 2106  Vcvv 3445  ifcif 4486   class class class wbr 5105  cmpt 5188  wf 6492  cfv 6496  (class class class)co 7357  m cmap 8765  cr 11050  cle 11190
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-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-cnex 11107  ax-resscn 11108
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  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 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-ov 7360  df-oprab 7361  df-mpo 7362  df-map 8767
This theorem is referenced by:  hsphoidmvle2  44816  hsphoidmvle  44817  hoidmvlelem2  44827  hspmbllem1  44857
  Copyright terms: Public domain W3C validator