Theorem hoidifhspval3 47768

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 47764	. 2 ⊢ (𝜑 → ((𝐷‘𝑌)‘𝐴) = (𝑘 ∈ 𝑋 ↦ if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘))))
6		eqeq1 2767	. . . 4 ⊢ (𝑘 = 𝐽 → (𝑘 = 𝐾 ↔ 𝐽 = 𝐾))
7		fveq2 6893	. . . . . 6 ⊢ (𝑘 = 𝐽 → (𝐴‘𝑘) = (𝐴‘𝐽))
8	7	breq2d 5117	. . . . 5 ⊢ (𝑘 = 𝐽 → (𝑌 ≤ (𝐴‘𝑘) ↔ 𝑌 ≤ (𝐴‘𝐽)))
9	8, 7	ifbieq1d 4509	. . . 4 ⊢ (𝑘 = 𝐽 → if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌) = if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌))
10	6, 9, 7	ifbieq12d 4513	. . 3 ⊢ (𝑘 = 𝐽 → if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘)) = if(𝐽 = 𝐾, if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌), (𝐴‘𝐽)))
11	10	adantl 487	. 2 ⊢ ((𝜑 ∧ 𝑘 = 𝐽) → if(𝑘 = 𝐾, if(𝑌 ≤ (𝐴‘𝑘), (𝐴‘𝑘), 𝑌), (𝐴‘𝑘)) = if(𝐽 = 𝐾, if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌), (𝐴‘𝐽)))
12		hoidifhspval3.j	. 2 ⊢ (𝜑 → 𝐽 ∈ 𝑋)
13		fvexd 6908	. . . 4 ⊢ (𝜑 → (𝐴‘𝐽) ∈ V)
14	2	elexd 3476	. . . 4 ⊢ (𝜑 → 𝑌 ∈ V)
15	13, 14	ifcld 4531	. . 3 ⊢ (𝜑 → if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌) ∈ V)
16	15, 13	ifcld 4531	. 2 ⊢ (𝜑 → if(𝐽 = 𝐾, if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌), (𝐴‘𝐽)) ∈ V)
17	5, 11, 12, 16	fvmptd 7009	1 ⊢ (𝜑 → (((𝐷‘𝑌)‘𝐴)‘𝐽) = if(𝐽 = 𝐾, if(𝑌 ≤ (𝐴‘𝐽), (𝐴‘𝐽), 𝑌), (𝐴‘𝐽)))

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2146  Vcvv 3453  ifcif 4484   class class class wbr 5105   ↦ cmpt 5188  ⟶wf 6542  ‘cfv 6546  (class class class)co 7427   ↑_m cmap 8858  ℝcr 11209   ≤ cle 11354

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5234  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758  ax-cnex 11266  ax-resscn 11267

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-iun 4955  df-br 5106  df-opab 5170  df-mpt 5189  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-f1 6551  df-fo 6552  df-f1o 6553  df-fv 6554  df-ov 7430  df-oprab 7431  df-mpo 7432  df-map 8860

This theorem is used by:  hoidifhspdmvle  47769  hspmbllem1  47775  hspmbllem2  47776