Theorem hoidifhspval2 47058

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

Assertion

Ref	Expression
hoidifhspval2	⊢ (𝜑 → ((𝐷‘𝑌)‘𝐴) = (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘))))

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

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

Proof of Theorem hoidifhspval2

Step	Hyp	Ref	Expression
1		hoidifhspval2.d	. . 3 ⊢ 𝐷 = (𝑥 ∈ ℝ ↦ (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘)))))
2		hoidifhspval2.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ ℝ)
3	1, 2	hoidifhspval 47051	. 2 ⊢ (𝜑 → (𝐷‘𝑌) = (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))))
4		fveq1 6826	. . . . . . 7 ⊢ (𝑎 = 𝐴 → (𝑎‘𝑘) = (𝐴‘𝑘))
5	4	breq2d 5084	. . . . . 6 ⊢ (𝑎 = 𝐴 → (𝑌 ≤ (𝑎‘𝑘) ↔ 𝑌 ≤ (𝐴‘𝑘)))
6	5, 4	ifbieq1d 4479	. . . . 5 ⊢ (𝑎 = 𝐴 → if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌) = if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌))
7	6, 4	ifeq12d 4476	. . . 4 ⊢ (𝑎 = 𝐴 → if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)) = if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘)))
8	7	mpteq2dv 5166	. . 3 ⊢ (𝑎 = 𝐴 → (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘))) = (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘))))
9	8	adantl 482	. 2 ⊢ ((𝜑 ∧ 𝑎 = 𝐴) → (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘))) = (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘))))
10		hoidifhspval2.a	. . 3 ⊢ (𝜑 → 𝐴:𝑋⟶ℝ)
11		reex 11120	. . . . . 6 ⊢ ℝ ∈ V
12	11	a1i 11	. . . . 5 ⊢ (𝜑 → ℝ ∈ V)
13		hoidifhspval2.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
14	12, 13	jca 516	. . . 4 ⊢ (𝜑 → (ℝ ∈ V ∧ 𝑋 ∈ 𝑉))
15		elmapg 8776	. . . 4 ⊢ ((ℝ ∈ V ∧ 𝑋 ∈ 𝑉) → (𝐴 ∈ (ℝ ↑m 𝑋) ↔ 𝐴:𝑋⟶ℝ))
16	14, 15	syl 17	. . 3 ⊢ (𝜑 → (𝐴 ∈ (ℝ ↑m 𝑋) ↔ 𝐴:𝑋⟶ℝ))
17	10, 16	mpbird 258	. 2 ⊢ (𝜑 → 𝐴 ∈ (ℝ ↑m 𝑋))
18		mptexg 7165	. . 3 ⊢ (𝑋 ∈ 𝑉 → (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘))) ∈ V)
19	13, 18	syl 17	. 2 ⊢ (𝜑 → (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘))) ∈ V)
20	3, 9, 17, 19	fvmptd 6943	1 ⊢ (𝜑 → ((𝐷‘𝑌)‘𝐴) = (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘))))

Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396   = wceq 1547   ∈ wcel 2119  Vcvv 3431  ifcif 4454   class class class wbr 5072   ↦ cmpt 5153  ⟶wf 6481  ‘cfv 6485  (class class class)co 7356   ↑_m cmap 8763  ℝcr 11028   ≤ cle 11171

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678  ax-cnex 11085  ax-resscn 11086

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-ov 7359  df-oprab 7360  df-mpo 7361  df-map 8765

This theorem is referenced by:  hoidifhspf  47061  hoidifhspval3  47062