Theorem hoi2toco 47435

Description: The half-open interval expressed using a composition of a function into (ℝ × ℝ) and using two distinct real-valued functions for the borders. (Contributed by Glauco Siliprandi, 24-Dec-2020.)

Hypotheses

Ref	Expression
hoi2toco.1	⊢ Ⅎ𝑘𝜑
hoi2toco.c	⊢ 𝐼 = (𝑘 ∈ 𝑋 ↦ ⟨(𝐴‘𝑘), (𝐵‘𝑘)⟩)

Assertion

Ref	Expression
hoi2toco	⊢ (𝜑 → X𝑘 ∈ 𝑋 (([,) ∘ 𝐼)‘𝑘) = X𝑘 ∈ 𝑋 ((𝐴‘𝑘)[,)(𝐵‘𝑘)))

Distinct variable group:   𝑘,𝑋

Allowed substitution hints:   𝜑(𝑘)   𝐴(𝑘)   𝐵(𝑘)   𝐼(𝑘)

Proof of Theorem hoi2toco

Step	Hyp	Ref	Expression
1		hoi2toco.1	. 2 ⊢ Ⅎ𝑘𝜑
2		hoi2toco.c	. . . . . . 7 ⊢ 𝐼 = (𝑘 ∈ 𝑋 ↦ ⟨(𝐴‘𝑘), (𝐵‘𝑘)⟩)
3	2	funmpt2 6572	. . . . . 6 ⊢ Fun 𝐼
4	3	a1i 11	. . . . 5 ⊢ (𝜑 → Fun 𝐼)
5	4	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → Fun 𝐼)
6		simpr 490	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → 𝑘 ∈ 𝑋)
7	2	dmeqi 5888	. . . . . . . 8 ⊢ dom 𝐼 = dom (𝑘 ∈ 𝑋 ↦ ⟨(𝐴‘𝑘), (𝐵‘𝑘)⟩)
8	7	a1i 11	. . . . . . 7 ⊢ (𝜑 → dom 𝐼 = dom (𝑘 ∈ 𝑋 ↦ ⟨(𝐴‘𝑘), (𝐵‘𝑘)⟩))
9		opex 5439	. . . . . . . . . 10 ⊢ ⟨(𝐴‘𝑘), (𝐵‘𝑘)⟩ ∈ V
10	9	2a1i 12	. . . . . . . . 9 ⊢ (𝜑 → (𝑘 ∈ 𝑋 → ⟨(𝐴‘𝑘), (𝐵‘𝑘)⟩ ∈ V))
11	1, 10	ralrimi 3260	. . . . . . . 8 ⊢ (𝜑 → ∀𝑘 ∈ 𝑋 ⟨(𝐴‘𝑘), (𝐵‘𝑘)⟩ ∈ V)
12		dmmptg 6238	. . . . . . . 8 ⊢ (∀𝑘 ∈ 𝑋 ⟨(𝐴‘𝑘), (𝐵‘𝑘)⟩ ∈ V → dom (𝑘 ∈ 𝑋 ↦ ⟨(𝐴‘𝑘), (𝐵‘𝑘)⟩) = 𝑋)
13	11, 12	syl 18	. . . . . . 7 ⊢ (𝜑 → dom (𝑘 ∈ 𝑋 ↦ ⟨(𝐴‘𝑘), (𝐵‘𝑘)⟩) = 𝑋)
14	8, 13	eqtr2d 2796	. . . . . 6 ⊢ (𝜑 → 𝑋 = dom 𝐼)
15	14	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → 𝑋 = dom 𝐼)
16	6, 15	eleqtrd 2862	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → 𝑘 ∈ dom 𝐼)
17		fvco 6976	. . . 4 ⊢ ((Fun 𝐼 ∧ 𝑘 ∈ dom 𝐼) → (([,) ∘ 𝐼)‘𝑘) = ([,)‘(𝐼‘𝑘)))
18	5, 16, 17	syl2anc 596	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (([,) ∘ 𝐼)‘𝑘) = ([,)‘(𝐼‘𝑘)))
19	9	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → ⟨(𝐴‘𝑘), (𝐵‘𝑘)⟩ ∈ V)
20	2	fvmpt2 6998	. . . . 5 ⊢ ((𝑘 ∈ 𝑋 ∧ ⟨(𝐴‘𝑘), (𝐵‘𝑘)⟩ ∈ V) → (𝐼‘𝑘) = ⟨(𝐴‘𝑘), (𝐵‘𝑘)⟩)
21	6, 19, 20	syl2anc 596	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (𝐼‘𝑘) = ⟨(𝐴‘𝑘), (𝐵‘𝑘)⟩)
22	21	fveq2d 6882	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → ([,)‘(𝐼‘𝑘)) = ([,)‘⟨(𝐴‘𝑘), (𝐵‘𝑘)⟩))
23		df-ov 7416	. . . . 5 ⊢ ((𝐴‘𝑘)[,)(𝐵‘𝑘)) = ([,)‘⟨(𝐴‘𝑘), (𝐵‘𝑘)⟩)
24	23	eqcomi 2769	. . . 4 ⊢ ([,)‘⟨(𝐴‘𝑘), (𝐵‘𝑘)⟩) = ((𝐴‘𝑘)[,)(𝐵‘𝑘))
25	24	a1i 11	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → ([,)‘⟨(𝐴‘𝑘), (𝐵‘𝑘)⟩) = ((𝐴‘𝑘)[,)(𝐵‘𝑘)))
26	18, 22, 25	3eqtrd 2799	. 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (([,) ∘ 𝐼)‘𝑘) = ((𝐴‘𝑘)[,)(𝐵‘𝑘)))
27	1, 26	ixpeq2d 45902	1 ⊢ (𝜑 → X𝑘 ∈ 𝑋 (([,) ∘ 𝐼)‘𝑘) = X𝑘 ∈ 𝑋 ((𝐴‘𝑘)[,)(𝐵‘𝑘)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2145  ∀wral 3076  Vcvv 3450  ⟨cop 4590   ↦ cmpt 5186  dom cdm 5655   ∘ ccom 5659  Fun wfun 6527  ‘cfv 6533  (class class class)co 7413  Xcixp 8904  [,)cico 13400

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-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-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-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-fv 6541  df-ov 7416  df-ixp 8905

This theorem is used by:  opnvonmbllem1  47460