Theorem hoidifhspval 40822

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
hoidifhspval.d	⊢ 𝐷 = (𝑥 ∈ ℝ ↦ (𝑎 ∈ (ℝ ↑𝑚 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘)))))
hoidifhspval.y	⊢ (𝜑 → 𝑌 ∈ ℝ)

Assertion

Ref	Expression
hoidifhspval	⊢ (𝜑 → (𝐷‘𝑌) = (𝑎 ∈ (ℝ ↑𝑚 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))))

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

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

Proof of Theorem hoidifhspval

Step	Hyp	Ref	Expression
1		hoidifhspval.d	. . 3 ⊢ 𝐷 = (𝑥 ∈ ℝ ↦ (𝑎 ∈ (ℝ ↑𝑚 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘)))))
2	1	a1i 11	. 2 ⊢ (𝜑 → 𝐷 = (𝑥 ∈ ℝ ↦ (𝑎 ∈ (ℝ ↑𝑚 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘))))))
3		breq1 4656	. . . . . . 7 ⊢ (𝑥 = 𝑌 → (𝑥 ≤ (𝑎‘𝑘) ↔ 𝑌 ≤ (𝑎‘𝑘)))
4		id 22	. . . . . . 7 ⊢ (𝑥 = 𝑌 → 𝑥 = 𝑌)
5	3, 4	ifbieq2d 4111	. . . . . 6 ⊢ (𝑥 = 𝑌 → if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥) = if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌))
6	5	ifeq1d 4104	. . . . 5 ⊢ (𝑥 = 𝑌 → if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘)) = if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))
7	6	mpteq2dv 4745	. . . 4 ⊢ (𝑥 = 𝑌 → (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘))) = (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘))))
8	7	mpteq2dv 4745	. . 3 ⊢ (𝑥 = 𝑌 → (𝑎 ∈ (ℝ ↑𝑚 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘)))) = (𝑎 ∈ (ℝ ↑𝑚 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))))
9	8	adantl 482	. 2 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (𝑎 ∈ (ℝ ↑𝑚 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘)))) = (𝑎 ∈ (ℝ ↑𝑚 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))))
10		hoidifhspval.y	. 2 ⊢ (𝜑 → 𝑌 ∈ ℝ)
11		ovex 6678	. . . 4 ⊢ (ℝ ↑𝑚 𝑋) ∈ V
12	11	mptex 6486	. . 3 ⊢ (𝑎 ∈ (ℝ ↑𝑚 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))) ∈ V
13	12	a1i 11	. 2 ⊢ (𝜑 → (𝑎 ∈ (ℝ ↑𝑚 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))) ∈ V)
14	2, 9, 10, 13	fvmptd 6288	1 ⊢ (𝜑 → (𝐷‘𝑌) = (𝑎 ∈ (ℝ ↑𝑚 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))))

Syntax hints:   → wi 4   = wceq 1483   ∈ wcel 1990  Vcvv 3200  ifcif 4086   class class class wbr 4653   ↦ cmpt 4729  ‘cfv 5888  (class class class)co 6650   ↑_𝑚 cmap 7857  ℝcr 9935   ≤ cle 10075

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653

This theorem is referenced by:  hoidifhspval2  40829