Theorem hoidifhspf 45012

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
hoidifhspf.d	⊢ 𝐷 = (𝑥 ∈ ℝ ↦ (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘)))))
hoidifhspf.y	⊢ (𝜑 → 𝑌 ∈ ℝ)
hoidifhspf.x	⊢ (𝜑 → 𝑋 ∈ 𝑉)
hoidifhspf.a	⊢ (𝜑 → 𝐴:𝑋⟶ℝ)

Assertion

Ref	Expression
hoidifhspf	⊢ (𝜑 → ((𝐷‘𝑌)‘𝐴):𝑋⟶ℝ)

Distinct variable groups:   𝐴,𝑎,𝑘   𝐾,𝑎,𝑥   𝑋,𝑎,𝑘,𝑥   𝑌,𝑎,𝑘,𝑥   𝜑,𝑎,𝑘,𝑥

Allowed substitution hints:   𝐴(𝑥)   𝐷(𝑥,𝑘,𝑎)   𝐾(𝑘)   𝑉(𝑥,𝑘,𝑎)

Proof of Theorem hoidifhspf

Step	Hyp	Ref	Expression
1		hoidifhspf.a	. . . . . 6 ⊢ (𝜑 → 𝐴:𝑋⟶ℝ)
2	1	ffvelcdmda 7055	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (𝐴‘𝑘) ∈ ℝ)
3		hoidifhspf.y	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ ℝ)
4	3	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → 𝑌 ∈ ℝ)
5	2, 4	ifcld 4552	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌) ∈ ℝ)
6	5, 2	ifcld 4552	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘)) ∈ ℝ)
7	6	fmpttd 7083	. 2 ⊢ (𝜑 → (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘))):𝑋⟶ℝ)
8		hoidifhspf.d	. . . 4 ⊢ 𝐷 = (𝑥 ∈ ℝ ↦ (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘)))))
9		hoidifhspf.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
10	8, 3, 9, 1	hoidifhspval2 45009	. . 3 ⊢ (𝜑 → ((𝐷‘𝑌)‘𝐴) = (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘))))
11	10	feq1d 6673	. 2 ⊢ (𝜑 → (((𝐷‘𝑌)‘𝐴):𝑋⟶ℝ ↔ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘))):𝑋⟶ℝ))
12	7, 11	mpbird 256	1 ⊢ (𝜑 → ((𝐷‘𝑌)‘𝐴):𝑋⟶ℝ)

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ifcif 4506   class class class wbr 5125   ↦ cmpt 5208  ⟶wf 6512  ‘cfv 6516  (class class class)co 7377   ↑_m cmap 8787  ℝcr 11074   ≤ cle 11214

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 2702  ax-rep 5262  ax-sep 5276  ax-nul 5283  ax-pow 5340  ax-pr 5404  ax-un 7692  ax-cnex 11131  ax-resscn 11132

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 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3365  df-rab 3419  df-v 3461  df-sbc 3758  df-csb 3874  df-dif 3931  df-un 3933  df-in 3935  df-ss 3945  df-nul 4303  df-if 4507  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4886  df-iun 4976  df-br 5126  df-opab 5188  df-mpt 5209  df-id 5551  df-xp 5659  df-rel 5660  df-cnv 5661  df-co 5662  df-dm 5663  df-rn 5664  df-res 5665  df-ima 5666  df-iota 6468  df-fun 6518  df-fn 6519  df-f 6520  df-f1 6521  df-fo 6522  df-f1o 6523  df-fv 6524  df-ov 7380  df-oprab 7381  df-mpo 7382  df-map 8789

This theorem is referenced by:  hoidifhspdmvle  45014  hspmbllem1  45020  hspmbllem2  45021