Theorem hoidifhspval 47355

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 5114	. . . . . 6 ⊢ (𝑥 = 𝑌 → (𝑥 ≤ (𝑎‘𝑘) ↔ 𝑌 ≤ (𝑎‘𝑘)))
3		id 23	. . . . . 6 ⊢ (𝑥 = 𝑌 → 𝑥 = 𝑌)
4	2, 3	ifbieq2d 4516	. . . . 5 ⊢ (𝑥 = 𝑌 → if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥) = if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌))
5	4	ifeq1d 4509	. . . 4 ⊢ (𝑥 = 𝑌 → if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘)) = if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))
6	5	mpteq2dv 5207	. . 3 ⊢ (𝑥 = 𝑌 → (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘))) = (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘))))
7	6	mpteq2dv 5207	. 2 ⊢ (𝑥 = 𝑌 → (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘)))) = (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))))
8		hoidifhspval.y	. 2 ⊢ (𝜑 → 𝑌 ∈ ℝ)
9		ovex 7449	. . . 4 ⊢ (ℝ ↑m 𝑋) ∈ V
10	9	mptex 7225	. . 3 ⊢ (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))) ∈ V
11	10	a1i 11	. 2 ⊢ (𝜑 → (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))) ∈ V)
12	1, 7, 8, 11	fvmptd3 7017	1 ⊢ (𝜑 → (𝐷‘𝑌) = (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2146  Vcvv 3457  ifcif 4489   class class class wbr 5111   ↦ cmpt 5194  ‘cfv 6540  (class class class)co 7416   ↑_m cmap 8826  ℝcr 11110   ≤ cle 11255

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pr 5406

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7419

This theorem is used by:  hoidifhspval2  47362