Theorem hoidifhspval 47436

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

Assertion

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

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

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

Proof of Theorem hoidifhspval

Step	Hyp	Ref	Expression
1		hoidifhspval.d	. 2 ⊢ 𝐷 = (𝑥 ∈ ℝ ↦ (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘)))))
2		breq1 5106	. . . . . 6 ⊢ (𝑥 = 𝑌 → (𝑥 ≤ (𝑎‘𝑘) ↔ 𝑌 ≤ (𝑎‘𝑘)))
3		id 23	. . . . . 6 ⊢ (𝑥 = 𝑌 → 𝑥 = 𝑌)
4	2, 3	ifbieq2d 4509	. . . . 5 ⊢ (𝑥 = 𝑌 → if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥) = if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌))
5	4	ifeq1d 4502	. . . 4 ⊢ (𝑥 = 𝑌 → if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘)) = if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))
6	5	mpteq2dv 5199	. . 3 ⊢ (𝑥 = 𝑌 → (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘))) = (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘))))
7	6	mpteq2dv 5199	. 2 ⊢ (𝑥 = 𝑌 → (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘)))) = (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))))
8		hoidifhspval.y	. 2 ⊢ (𝜑 → 𝑌 ∈ ℝ)
9		ovex 7446	. . . 4 ⊢ (ℝ ↑m 𝑋) ∈ V
10	9	mptex 7222	. . 3 ⊢ (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))) ∈ V
11	10	a1i 11	. 2 ⊢ (𝜑 → (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))) ∈ V)
12	1, 7, 8, 11	fvmptd3 7010	1 ⊢ (𝜑 → (𝐷‘𝑌) = (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3450  ifcif 4482   class class class wbr 5103   ↦ cmpt 5186  ‘cfv 6533  (class class class)co 7413   ↑_m cmap 8826  ℝcr 11123   ≤ cle 11268

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pr 5398

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7416

This theorem is used by:  hoidifhspval2  47443