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

Theorem hoidifhspval3 47963
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.)
Hypotheses
Ref Expression
hoidifhspval3.d 𝐷 = (𝑥 ∈ ℝ ↦ (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘)))))
hoidifhspval3.y (𝜑 → 𝑌 ∈ ℝ)
hoidifhspval3.x (𝜑 → 𝑋 ∈ 𝑉)
hoidifhspval3.a (𝜑 → 𝐴:𝑋⟶ℝ)
hoidifhspval3.j (𝜑 → 𝐽 ∈ 𝑋)
Assertion
Ref Expression
hoidifhspval3 (𝜑 → (((𝐷‘𝑌)‘𝐴)‘𝐽) = if(𝐽 = 𝐾, if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌), (𝐴‘𝐽)))
Distinct variable groups:   𝐴,𝑎,𝑘   𝑘,𝐽   𝐾,𝑎,𝑘,𝑥   𝑋,𝑎,𝑘,𝑥   𝑌,𝑎,𝑘,𝑥   𝜑,𝑎,𝑘,𝑥
Allowed substitution hints:   𝐴(𝑥)   𝐷(𝑥, 𝑘, 𝑎)   𝐽(𝑥, 𝑎)   𝑉(𝑥, 𝑘, 𝑎)

Proof of Theorem hoidifhspval3
StepHypRef Expression
1 hoidifhspval3.d . . 3 𝐷 = (𝑥 ∈ ℝ ↦ (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘)))))
2 hoidifhspval3.y . . 3 (𝜑 → 𝑌 ∈ ℝ)
3 hoidifhspval3.x . . 3 (𝜑 → 𝑋 ∈ 𝑉)
4 hoidifhspval3.a . . 3 (𝜑 → 𝐴:𝑋⟶ℝ)
51, 2, 3, 4hoidifhspval2 47959 . 2 (𝜑 → ((𝐷‘𝑌)‘𝐴) = (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘))))
6 eqeq1 2767 . . . 4 (𝑘 = 𝐽 → (𝑘 = 𝐾 ↔ 𝐽 = 𝐾))
7 fveq2 6916 . . . . . 6 (𝑘 = 𝐽 → (𝐴‘𝑘) = (𝐴‘𝐽))
87breq2d 5120 . . . . 5 (𝑘 = 𝐽 → (𝑌 ≤ (𝐴‘𝑘) ↔ 𝑌 ≤ (𝐴‘𝐽)))
98, 7ifbieq1d 4510 . . . 4 (𝑘 = 𝐽 → if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌) = if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌))
106, 9, 7ifbieq12d 4514 . . 3 (𝑘 = 𝐽 → if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘)) = if(𝐽 = 𝐾, if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌), (𝐴‘𝐽)))
1110adantl 487 . 2 ((𝜑 ∧ 𝑘 = 𝐽) → if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘)) = if(𝐽 = 𝐾, if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌), (𝐴‘𝐽)))
12 hoidifhspval3.j . 2 (𝜑 → 𝐽 ∈ 𝑋)
13 fvexd 6931 . . . 4 (𝜑 → (𝐴‘𝐽) ∈ V)
142elexd 3477 . . . 4 (𝜑 → 𝑌 ∈ V)
1513, 14ifcld 4532 . . 3 (𝜑 → if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌) ∈ V)
1615, 13ifcld 4532 . 2 (𝜑 → if(𝐽 = 𝐾, if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌), (𝐴‘𝐽)) ∈ V)
175, 11, 12, 16fvmptd 7032 1 (𝜑 → (((𝐷‘𝑌)‘𝐴)‘𝐽) = if(𝐽 = 𝐾, if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌), (𝐴‘𝐽)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ifcif 4485   class class class wbr 5108   ↦ cmpt 5192  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451   ↑m cmap 8885  ℝcr 11238   ≤ cle 11383
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-map 8887
This theorem is used by:  hoidifhspdmvle  47964  hspmbllem1  47970  hspmbllem2  47971
  Copyright terms: Public domain W3C validator