Theorem hoidifhspval3 47450

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

Assertion

Ref	Expression
hoidifhspval3	⊢ (𝜑 → (((𝐷‘𝑌)‘𝐴)‘𝐽) = if(𝐽 = 𝐾, if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌), (𝐴‘𝐽)))

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

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

Proof of Theorem hoidifhspval3

Step	Hyp	Ref	Expression
1		hoidifhspval3.d	. . 3 ⊢ 𝐷 = (𝑥 ∈ ℝ ↦ (𝑎 ∈ (ℝ ↑m 𝑋) ↦ (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑥 ≤ (𝑎‘𝑘), (𝑎‘𝑘), 𝑥), (𝑎‘𝑘)))))
2		hoidifhspval3.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ ℝ)
3		hoidifhspval3.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
4		hoidifhspval3.a	. . 3 ⊢ (𝜑 → 𝐴:𝑋⟶ℝ)
5	1, 2, 3, 4	hoidifhspval2 47446	. 2 ⊢ (𝜑 → ((𝐷‘𝑌)‘𝐴) = (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘))))
6		eqeq1 2764	. . . 4 ⊢ (𝑘 = 𝐽 → (𝑘 = 𝐾 ↔ 𝐽 = 𝐾))
7		fveq2 6879	. . . . . 6 ⊢ (𝑘 = 𝐽 → (𝐴‘𝑘) = (𝐴‘𝐽))
8	7	breq2d 5115	. . . . 5 ⊢ (𝑘 = 𝐽 → (𝑌 ≤ (𝐴‘𝑘) ↔ 𝑌 ≤ (𝐴‘𝐽)))
9	8, 7	ifbieq1d 4507	. . . 4 ⊢ (𝑘 = 𝐽 → if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌) = if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌))
10	6, 9, 7	ifbieq12d 4511	. . 3 ⊢ (𝑘 = 𝐽 → if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘)) = if(𝐽 = 𝐾, if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌), (𝐴‘𝐽)))
11	10	adantl 487	. 2 ⊢ ((𝜑 ∧ 𝑘 = 𝐽) → if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘)) = if(𝐽 = 𝐾, if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌), (𝐴‘𝐽)))
12		hoidifhspval3.j	. 2 ⊢ (𝜑 → 𝐽 ∈ 𝑋)
13		fvexd 6894	. . . 4 ⊢ (𝜑 → (𝐴‘𝐽) ∈ V)
14	2	elexd 3473	. . . 4 ⊢ (𝜑 → 𝑌 ∈ V)
15	13, 14	ifcld 4529	. . 3 ⊢ (𝜑 → if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌) ∈ V)
16	15, 13	ifcld 4529	. 2 ⊢ (𝜑 → if(𝐽 = 𝐾, if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌), (𝐴‘𝐽)) ∈ V)
17	5, 11, 12, 16	fvmptd 6995	1 ⊢ (𝜑 → (((𝐷‘𝑌)‘𝐴)‘𝐽) = 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  ⟶wf 6529  ‘cfv 6533  (class class class)co 7414   ↑_m cmap 8829  ℝcr 11126   ≤ cle 11271

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-pow 5330  ax-pr 5398  ax-un 7737  ax-cnex 11183  ax-resscn 11184

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-pw 4559  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 7417  df-oprab 7418  df-mpo 7419  df-map 8831

This theorem is used by:  hoidifhspdmvle  47451  hspmbllem1  47457  hspmbllem2  47458