Theorem hoidifhspf 47192

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 7065	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (𝐴‘𝑘) ∈ ℝ)
3		hoidifhspf.y	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ ℝ)
4	3	adantr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → 𝑌 ∈ ℝ)
5	2, 4	ifcld 4527	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌) ∈ ℝ)
6	5, 2	ifcld 4527	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘)) ∈ ℝ)
7	6	fmpttd 7096	. 2 ⊢ (𝜑 → (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘))):𝑋⟶ℝ)
8		hoidifhspf.d	. . . 4 ⊢ 𝐷 = (𝑥 ∈ ℝ ↦ (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘)))))
9		hoidifhspf.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
10	8, 3, 9, 1	hoidifhspval2 47189	. . 3 ⊢ (𝜑 → ((𝐷‘𝑌)‘𝐴) = (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘))))
11	10	feq1d 6673	. 2 ⊢ (𝜑 → (((𝐷‘𝑌)‘𝐴):𝑋⟶ℝ ↔ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘))):𝑋⟶ℝ))
12	7, 11	mpbird 259	1 ⊢ (𝜑 → ((𝐷‘𝑌)‘𝐴):𝑋⟶ℝ)

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1560   ∈ wcel 2142  ifcif 4480   class class class wbr 5100   ↦ cmpt 5181  ⟶wf 6517  ‘cfv 6521  (class class class)co 7396   ↑_m cmap 8808  ℝcr 11072   ≤ cle 11217

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5227  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718  ax-cnex 11129  ax-resscn 11130

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-ov 7399  df-oprab 7400  df-mpo 7401  df-map 8810

This theorem is referenced by:  hoidifhspdmvle  47194  hspmbllem1  47200  hspmbllem2  47201