Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > lmcn2 | GIF version |
Description: The image of a convergent sequence under a continuous map is convergent to the image of the original point. Binary operation version. (Contributed by Mario Carneiro, 15-May-2014.) |
Ref | Expression |
---|---|
txlm.z | ⊢ 𝑍 = (ℤ≥‘𝑀) |
txlm.m | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
txlm.j | ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋)) |
txlm.k | ⊢ (𝜑 → 𝐾 ∈ (TopOn‘𝑌)) |
txlm.f | ⊢ (𝜑 → 𝐹:𝑍⟶𝑋) |
txlm.g | ⊢ (𝜑 → 𝐺:𝑍⟶𝑌) |
lmcn2.fl | ⊢ (𝜑 → 𝐹(⇝𝑡‘𝐽)𝑅) |
lmcn2.gl | ⊢ (𝜑 → 𝐺(⇝𝑡‘𝐾)𝑆) |
lmcn2.o | ⊢ (𝜑 → 𝑂 ∈ ((𝐽 ×t 𝐾) Cn 𝑁)) |
lmcn2.h | ⊢ 𝐻 = (𝑛 ∈ 𝑍 ↦ ((𝐹‘𝑛)𝑂(𝐺‘𝑛))) |
Ref | Expression |
---|---|
lmcn2 | ⊢ (𝜑 → 𝐻(⇝𝑡‘𝑁)(𝑅𝑂𝑆)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | txlm.f | . . . . . . 7 ⊢ (𝜑 → 𝐹:𝑍⟶𝑋) | |
2 | 1 | ffvelrnda 5614 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛) ∈ 𝑋) |
3 | txlm.g | . . . . . . 7 ⊢ (𝜑 → 𝐺:𝑍⟶𝑌) | |
4 | 3 | ffvelrnda 5614 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐺‘𝑛) ∈ 𝑌) |
5 | 2, 4 | opelxpd 4631 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 〈(𝐹‘𝑛), (𝐺‘𝑛)〉 ∈ (𝑋 × 𝑌)) |
6 | eqidd 2165 | . . . . 5 ⊢ (𝜑 → (𝑛 ∈ 𝑍 ↦ 〈(𝐹‘𝑛), (𝐺‘𝑛)〉) = (𝑛 ∈ 𝑍 ↦ 〈(𝐹‘𝑛), (𝐺‘𝑛)〉)) | |
7 | txlm.j | . . . . . . . 8 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋)) | |
8 | txlm.k | . . . . . . . 8 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘𝑌)) | |
9 | txtopon 12809 | . . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 ×t 𝐾) ∈ (TopOn‘(𝑋 × 𝑌))) | |
10 | 7, 8, 9 | syl2anc 409 | . . . . . . 7 ⊢ (𝜑 → (𝐽 ×t 𝐾) ∈ (TopOn‘(𝑋 × 𝑌))) |
11 | lmcn2.o | . . . . . . . . 9 ⊢ (𝜑 → 𝑂 ∈ ((𝐽 ×t 𝐾) Cn 𝑁)) | |
12 | cntop2 12749 | . . . . . . . . 9 ⊢ (𝑂 ∈ ((𝐽 ×t 𝐾) Cn 𝑁) → 𝑁 ∈ Top) | |
13 | 11, 12 | syl 14 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ Top) |
14 | toptopon2 12564 | . . . . . . . 8 ⊢ (𝑁 ∈ Top ↔ 𝑁 ∈ (TopOn‘∪ 𝑁)) | |
15 | 13, 14 | sylib 121 | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ (TopOn‘∪ 𝑁)) |
16 | cnf2 12752 | . . . . . . 7 ⊢ (((𝐽 ×t 𝐾) ∈ (TopOn‘(𝑋 × 𝑌)) ∧ 𝑁 ∈ (TopOn‘∪ 𝑁) ∧ 𝑂 ∈ ((𝐽 ×t 𝐾) Cn 𝑁)) → 𝑂:(𝑋 × 𝑌)⟶∪ 𝑁) | |
17 | 10, 15, 11, 16 | syl3anc 1227 | . . . . . 6 ⊢ (𝜑 → 𝑂:(𝑋 × 𝑌)⟶∪ 𝑁) |
18 | 17 | feqmptd 5533 | . . . . 5 ⊢ (𝜑 → 𝑂 = (𝑥 ∈ (𝑋 × 𝑌) ↦ (𝑂‘𝑥))) |
19 | fveq2 5480 | . . . . . 6 ⊢ (𝑥 = 〈(𝐹‘𝑛), (𝐺‘𝑛)〉 → (𝑂‘𝑥) = (𝑂‘〈(𝐹‘𝑛), (𝐺‘𝑛)〉)) | |
20 | df-ov 5839 | . . . . . 6 ⊢ ((𝐹‘𝑛)𝑂(𝐺‘𝑛)) = (𝑂‘〈(𝐹‘𝑛), (𝐺‘𝑛)〉) | |
21 | 19, 20 | eqtr4di 2215 | . . . . 5 ⊢ (𝑥 = 〈(𝐹‘𝑛), (𝐺‘𝑛)〉 → (𝑂‘𝑥) = ((𝐹‘𝑛)𝑂(𝐺‘𝑛))) |
22 | 5, 6, 18, 21 | fmptco 5645 | . . . 4 ⊢ (𝜑 → (𝑂 ∘ (𝑛 ∈ 𝑍 ↦ 〈(𝐹‘𝑛), (𝐺‘𝑛)〉)) = (𝑛 ∈ 𝑍 ↦ ((𝐹‘𝑛)𝑂(𝐺‘𝑛)))) |
23 | lmcn2.h | . . . 4 ⊢ 𝐻 = (𝑛 ∈ 𝑍 ↦ ((𝐹‘𝑛)𝑂(𝐺‘𝑛))) | |
24 | 22, 23 | eqtr4di 2215 | . . 3 ⊢ (𝜑 → (𝑂 ∘ (𝑛 ∈ 𝑍 ↦ 〈(𝐹‘𝑛), (𝐺‘𝑛)〉)) = 𝐻) |
25 | lmcn2.fl | . . . . 5 ⊢ (𝜑 → 𝐹(⇝𝑡‘𝐽)𝑅) | |
26 | lmcn2.gl | . . . . 5 ⊢ (𝜑 → 𝐺(⇝𝑡‘𝐾)𝑆) | |
27 | txlm.z | . . . . . 6 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
28 | txlm.m | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
29 | eqid 2164 | . . . . . 6 ⊢ (𝑛 ∈ 𝑍 ↦ 〈(𝐹‘𝑛), (𝐺‘𝑛)〉) = (𝑛 ∈ 𝑍 ↦ 〈(𝐹‘𝑛), (𝐺‘𝑛)〉) | |
30 | 27, 28, 7, 8, 1, 3, 29 | txlm 12826 | . . . . 5 ⊢ (𝜑 → ((𝐹(⇝𝑡‘𝐽)𝑅 ∧ 𝐺(⇝𝑡‘𝐾)𝑆) ↔ (𝑛 ∈ 𝑍 ↦ 〈(𝐹‘𝑛), (𝐺‘𝑛)〉)(⇝𝑡‘(𝐽 ×t 𝐾))〈𝑅, 𝑆〉)) |
31 | 25, 26, 30 | mpbi2and 932 | . . . 4 ⊢ (𝜑 → (𝑛 ∈ 𝑍 ↦ 〈(𝐹‘𝑛), (𝐺‘𝑛)〉)(⇝𝑡‘(𝐽 ×t 𝐾))〈𝑅, 𝑆〉) |
32 | 31, 11 | lmcn 12798 | . . 3 ⊢ (𝜑 → (𝑂 ∘ (𝑛 ∈ 𝑍 ↦ 〈(𝐹‘𝑛), (𝐺‘𝑛)〉))(⇝𝑡‘𝑁)(𝑂‘〈𝑅, 𝑆〉)) |
33 | 24, 32 | eqbrtrrd 4000 | . 2 ⊢ (𝜑 → 𝐻(⇝𝑡‘𝑁)(𝑂‘〈𝑅, 𝑆〉)) |
34 | df-ov 5839 | . 2 ⊢ (𝑅𝑂𝑆) = (𝑂‘〈𝑅, 𝑆〉) | |
35 | 33, 34 | breqtrrdi 4018 | 1 ⊢ (𝜑 → 𝐻(⇝𝑡‘𝑁)(𝑅𝑂𝑆)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1342 ∈ wcel 2135 〈cop 3573 ∪ cuni 3783 class class class wbr 3976 ↦ cmpt 4037 × cxp 4596 ∘ ccom 4602 ⟶wf 5178 ‘cfv 5182 (class class class)co 5836 ℤcz 9182 ℤ≥cuz 9457 Topctop 12542 TopOnctopon 12555 Cn ccn 12732 ⇝𝑡clm 12734 ×t ctx 12799 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-13 2137 ax-14 2138 ax-ext 2146 ax-coll 4091 ax-sep 4094 ax-pow 4147 ax-pr 4181 ax-un 4405 ax-setind 4508 ax-cnex 7835 ax-resscn 7836 ax-1cn 7837 ax-1re 7838 ax-icn 7839 ax-addcl 7840 ax-addrcl 7841 ax-mulcl 7842 ax-addcom 7844 ax-addass 7846 ax-distr 7848 ax-i2m1 7849 ax-0lt1 7850 ax-0id 7852 ax-rnegex 7853 ax-cnre 7855 ax-pre-ltirr 7856 ax-pre-ltwlin 7857 ax-pre-lttrn 7858 ax-pre-apti 7859 ax-pre-ltadd 7860 |
This theorem depends on definitions: df-bi 116 df-dc 825 df-3or 968 df-3an 969 df-tru 1345 df-fal 1348 df-nf 1448 df-sb 1750 df-eu 2016 df-mo 2017 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ne 2335 df-nel 2430 df-ral 2447 df-rex 2448 df-reu 2449 df-rab 2451 df-v 2723 df-sbc 2947 df-csb 3041 df-dif 3113 df-un 3115 df-in 3117 df-ss 3124 df-if 3516 df-pw 3555 df-sn 3576 df-pr 3577 df-op 3579 df-uni 3784 df-int 3819 df-iun 3862 df-br 3977 df-opab 4038 df-mpt 4039 df-id 4265 df-xp 4604 df-rel 4605 df-cnv 4606 df-co 4607 df-dm 4608 df-rn 4609 df-res 4610 df-ima 4611 df-iota 5147 df-fun 5184 df-fn 5185 df-f 5186 df-f1 5187 df-fo 5188 df-f1o 5189 df-fv 5190 df-riota 5792 df-ov 5839 df-oprab 5840 df-mpo 5841 df-1st 6100 df-2nd 6101 df-map 6607 df-pm 6608 df-pnf 7926 df-mnf 7927 df-xr 7928 df-ltxr 7929 df-le 7930 df-sub 8062 df-neg 8063 df-inn 8849 df-n0 9106 df-z 9183 df-uz 9458 df-topgen 12519 df-top 12543 df-topon 12556 df-bases 12588 df-cn 12735 df-cnp 12736 df-lm 12737 df-tx 12800 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |