| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > hoicoto2 | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| hoicoto2.i | ⊢ (𝜑 → 𝐼:𝑋⟶(ℝ × ℝ)) |
| hoicoto2.a | ⊢ 𝐴 = (𝑘 ∈ 𝑋 ↦ (1st ‘(𝐼‘𝑘))) |
| hoicoto2.b | ⊢ 𝐵 = (𝑘 ∈ 𝑋 ↦ (2nd ‘(𝐼‘𝑘))) |
| Ref | Expression |
|---|---|
| hoicoto2 | ⊢ (𝜑 → X𝑘 ∈ 𝑋 (([,) ∘ 𝐼)‘𝑘) = X𝑘 ∈ 𝑋 ((𝐴‘𝑘)[,)(𝐵‘𝑘))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hoicoto2.i | . . . . 5 ⊢ (𝜑 → 𝐼:𝑋⟶(ℝ × ℝ)) | |
| 2 | 1 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → 𝐼:𝑋⟶(ℝ × ℝ)) |
| 3 | simpr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → 𝑘 ∈ 𝑋) | |
| 4 | 2, 3 | fvovco 45515 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (([,) ∘ 𝐼)‘𝑘) = ((1st ‘(𝐼‘𝑘))[,)(2nd ‘(𝐼‘𝑘)))) |
| 5 | 1 | ffvelcdmda 7031 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (𝐼‘𝑘) ∈ (ℝ × ℝ)) |
| 6 | xp1st 7968 | . . . . . . . 8 ⊢ ((𝐼‘𝑘) ∈ (ℝ × ℝ) → (1st ‘(𝐼‘𝑘)) ∈ ℝ) | |
| 7 | 5, 6 | syl 17 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (1st ‘(𝐼‘𝑘)) ∈ ℝ) |
| 8 | 7 | elexd 3465 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (1st ‘(𝐼‘𝑘)) ∈ V) |
| 9 | hoicoto2.a | . . . . . . 7 ⊢ 𝐴 = (𝑘 ∈ 𝑋 ↦ (1st ‘(𝐼‘𝑘))) | |
| 10 | 9 | fvmpt2 6954 | . . . . . 6 ⊢ ((𝑘 ∈ 𝑋 ∧ (1st ‘(𝐼‘𝑘)) ∈ V) → (𝐴‘𝑘) = (1st ‘(𝐼‘𝑘))) |
| 11 | 3, 8, 10 | syl2anc 585 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (𝐴‘𝑘) = (1st ‘(𝐼‘𝑘))) |
| 12 | 11 | eqcomd 2743 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (1st ‘(𝐼‘𝑘)) = (𝐴‘𝑘)) |
| 13 | xp2nd 7969 | . . . . . . . 8 ⊢ ((𝐼‘𝑘) ∈ (ℝ × ℝ) → (2nd ‘(𝐼‘𝑘)) ∈ ℝ) | |
| 14 | 5, 13 | syl 17 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (2nd ‘(𝐼‘𝑘)) ∈ ℝ) |
| 15 | 14 | elexd 3465 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (2nd ‘(𝐼‘𝑘)) ∈ V) |
| 16 | hoicoto2.b | . . . . . . 7 ⊢ 𝐵 = (𝑘 ∈ 𝑋 ↦ (2nd ‘(𝐼‘𝑘))) | |
| 17 | 16 | fvmpt2 6954 | . . . . . 6 ⊢ ((𝑘 ∈ 𝑋 ∧ (2nd ‘(𝐼‘𝑘)) ∈ V) → (𝐵‘𝑘) = (2nd ‘(𝐼‘𝑘))) |
| 18 | 3, 15, 17 | syl2anc 585 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (𝐵‘𝑘) = (2nd ‘(𝐼‘𝑘))) |
| 19 | 18 | eqcomd 2743 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (2nd ‘(𝐼‘𝑘)) = (𝐵‘𝑘)) |
| 20 | 12, 19 | oveq12d 7379 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → ((1st ‘(𝐼‘𝑘))[,)(2nd ‘(𝐼‘𝑘))) = ((𝐴‘𝑘)[,)(𝐵‘𝑘))) |
| 21 | 4, 20 | eqtrd 2772 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑋) → (([,) ∘ 𝐼)‘𝑘) = ((𝐴‘𝑘)[,)(𝐵‘𝑘))) |
| 22 | 21 | ixpeq2dva 8855 | 1 ⊢ (𝜑 → X𝑘 ∈ 𝑋 (([,) ∘ 𝐼)‘𝑘) = X𝑘 ∈ 𝑋 ((𝐴‘𝑘)[,)(𝐵‘𝑘))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3441 ↦ cmpt 5180 × cxp 5623 ∘ ccom 5629 ⟶wf 6489 ‘cfv 6493 (class class class)co 7361 1st c1st 7934 2nd c2nd 7935 Xcixp 8840 ℝcr 11030 [,)cico 13268 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pr 5378 ax-un 7683 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4287 df-if 4481 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-fv 6501 df-ov 7364 df-1st 7936 df-2nd 7937 df-ixp 8841 |
| This theorem is referenced by: opnvonmbllem2 46954 |
| Copyright terms: Public domain | W3C validator |