Theorem hoidifhspval 41614

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 4878	. . . . . . 7 ⊢ (𝑥 = 𝑌 → (𝑥 ≤ (𝑎‘𝑘) ↔ 𝑌 ≤ (𝑎‘𝑘)))
4		id 22	. . . . . . 7 ⊢ (𝑥 = 𝑌 → 𝑥 = 𝑌)
5	3, 4	ifbieq2d 4333	. . . . . 6 ⊢ (𝑥 = 𝑌 → if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥) = if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌))
6	5	ifeq1d 4326	. . . . 5 ⊢ (𝑥 = 𝑌 → if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘)) = if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))
7	6	mpteq2dv 4970	. . . 4 ⊢ (𝑥 = 𝑌 → (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘))) = (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘))))
8	7	mpteq2dv 4970	. . 3 ⊢ (𝑥 = 𝑌 → (𝑎 ∈ (ℝ ↑𝑚 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘)))) = (𝑎 ∈ (ℝ ↑𝑚 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))))
9	8	adantl 475	. 2 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (𝑎 ∈ (ℝ ↑𝑚 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘)))) = (𝑎 ∈ (ℝ ↑𝑚 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))))
10		hoidifhspval.y	. 2 ⊢ (𝜑 → 𝑌 ∈ ℝ)
11		ovex 6942	. . . 4 ⊢ (ℝ ↑𝑚 𝑋) ∈ V
12	11	mptex 6747	. . 3 ⊢ (𝑎 ∈ (ℝ ↑𝑚 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))) ∈ V
13	12	a1i 11	. 2 ⊢ (𝜑 → (𝑎 ∈ (ℝ ↑𝑚 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))) ∈ V)
14	2, 9, 10, 13	fvmptd 6539	1 ⊢ (𝜑 → (𝐷‘𝑌) = (𝑎 ∈ (ℝ ↑𝑚 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑌), (𝑎‘𝑘)))))

Syntax hints:   → wi 4   = wceq 1656   ∈ wcel 2164  Vcvv 3414  ifcif 4308   class class class wbr 4875   ↦ cmpt 4954  ‘cfv 6127  (class class class)co 6910   ↑_𝑚 cmap 8127  ℝcr 10258   ≤ cle 10399

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1894  ax-4 1908  ax-5 2009  ax-6 2075  ax-7 2112  ax-9 2173  ax-10 2192  ax-11 2207  ax-12 2220  ax-13 2389  ax-ext 2803  ax-rep 4996  ax-sep 5007  ax-nul 5015  ax-pr 5129

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 879  df-3an 1113  df-tru 1660  df-ex 1879  df-nf 1883  df-sb 2068  df-mo 2605  df-eu 2640  df-clab 2812  df-cleq 2818  df-clel 2821  df-nfc 2958  df-ne 3000  df-ral 3122  df-rex 3123  df-reu 3124  df-rab 3126  df-v 3416  df-sbc 3663  df-csb 3758  df-dif 3801  df-un 3803  df-in 3805  df-ss 3812  df-nul 4147  df-if 4309  df-sn 4400  df-pr 4402  df-op 4406  df-uni 4661  df-iun 4744  df-br 4876  df-opab 4938  df-mpt 4955  df-id 5252  df-xp 5352  df-rel 5353  df-cnv 5354  df-co 5355  df-dm 5356  df-rn 5357  df-res 5358  df-ima 5359  df-iota 6090  df-fun 6129  df-fn 6130  df-f 6131  df-f1 6132  df-fo 6133  df-f1o 6134  df-fv 6135  df-ov 6913

This theorem is referenced by:  hoidifhspval2  41621