Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > limcvallem | Structured version Visualization version GIF version |
Description: Lemma for ellimc 25047. (Contributed by Mario Carneiro, 25-Dec-2016.) |
Ref | Expression |
---|---|
limcval.j | ⊢ 𝐽 = (𝐾 ↾t (𝐴 ∪ {𝐵})) |
limcval.k | ⊢ 𝐾 = (TopOpen‘ℂfld) |
limcvallem.g | ⊢ 𝐺 = (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧))) |
Ref | Expression |
---|---|
limcvallem | ⊢ ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → (𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵) → 𝐶 ∈ ℂ)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iftrue 4465 | . . . 4 ⊢ (𝑧 = 𝐵 → if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧)) = 𝐶) | |
2 | 1 | eleq1d 2823 | . . 3 ⊢ (𝑧 = 𝐵 → (if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧)) ∈ ℂ ↔ 𝐶 ∈ ℂ)) |
3 | limcval.j | . . . . . 6 ⊢ 𝐽 = (𝐾 ↾t (𝐴 ∪ {𝐵})) | |
4 | limcval.k | . . . . . . . 8 ⊢ 𝐾 = (TopOpen‘ℂfld) | |
5 | 4 | cnfldtopon 23956 | . . . . . . 7 ⊢ 𝐾 ∈ (TopOn‘ℂ) |
6 | simpl2 1191 | . . . . . . . 8 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐴 ⊆ ℂ) | |
7 | simpl3 1192 | . . . . . . . . 9 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐵 ∈ ℂ) | |
8 | 7 | snssd 4742 | . . . . . . . 8 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → {𝐵} ⊆ ℂ) |
9 | 6, 8 | unssd 4119 | . . . . . . 7 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → (𝐴 ∪ {𝐵}) ⊆ ℂ) |
10 | resttopon 22322 | . . . . . . 7 ⊢ ((𝐾 ∈ (TopOn‘ℂ) ∧ (𝐴 ∪ {𝐵}) ⊆ ℂ) → (𝐾 ↾t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵}))) | |
11 | 5, 9, 10 | sylancr 587 | . . . . . 6 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → (𝐾 ↾t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵}))) |
12 | 3, 11 | eqeltrid 2843 | . . . . 5 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐽 ∈ (TopOn‘(𝐴 ∪ {𝐵}))) |
13 | 5 | a1i 11 | . . . . 5 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐾 ∈ (TopOn‘ℂ)) |
14 | simpr 485 | . . . . 5 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) | |
15 | cnpf2 22411 | . . . . 5 ⊢ ((𝐽 ∈ (TopOn‘(𝐴 ∪ {𝐵})) ∧ 𝐾 ∈ (TopOn‘ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐺:(𝐴 ∪ {𝐵})⟶ℂ) | |
16 | 12, 13, 14, 15 | syl3anc 1370 | . . . 4 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐺:(𝐴 ∪ {𝐵})⟶ℂ) |
17 | limcvallem.g | . . . . 5 ⊢ 𝐺 = (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧))) | |
18 | 17 | fmpt 6976 | . . . 4 ⊢ (∀𝑧 ∈ (𝐴 ∪ {𝐵})if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧)) ∈ ℂ ↔ 𝐺:(𝐴 ∪ {𝐵})⟶ℂ) |
19 | 16, 18 | sylibr 233 | . . 3 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → ∀𝑧 ∈ (𝐴 ∪ {𝐵})if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧)) ∈ ℂ) |
20 | ssun2 4106 | . . . 4 ⊢ {𝐵} ⊆ (𝐴 ∪ {𝐵}) | |
21 | snssg 4718 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (𝐵 ∈ (𝐴 ∪ {𝐵}) ↔ {𝐵} ⊆ (𝐴 ∪ {𝐵}))) | |
22 | 7, 21 | syl 17 | . . . 4 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → (𝐵 ∈ (𝐴 ∪ {𝐵}) ↔ {𝐵} ⊆ (𝐴 ∪ {𝐵}))) |
23 | 20, 22 | mpbiri 257 | . . 3 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐵 ∈ (𝐴 ∪ {𝐵})) |
24 | 2, 19, 23 | rspcdva 3561 | . 2 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐶 ∈ ℂ) |
25 | 24 | ex 413 | 1 ⊢ ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → (𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵) → 𝐶 ∈ ℂ)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 ∀wral 3064 ∪ cun 3884 ⊆ wss 3886 ifcif 4459 {csn 4561 ↦ cmpt 5156 ⟶wf 6422 ‘cfv 6426 (class class class)co 7267 ℂcc 10879 ↾t crest 17141 TopOpenctopn 17142 ℂfldccnfld 20607 TopOnctopon 22069 CnP ccnp 22386 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5208 ax-sep 5221 ax-nul 5228 ax-pow 5286 ax-pr 5350 ax-un 7578 ax-cnex 10937 ax-resscn 10938 ax-1cn 10939 ax-icn 10940 ax-addcl 10941 ax-addrcl 10942 ax-mulcl 10943 ax-mulrcl 10944 ax-mulcom 10945 ax-addass 10946 ax-mulass 10947 ax-distr 10948 ax-i2m1 10949 ax-1ne0 10950 ax-1rid 10951 ax-rnegex 10952 ax-rrecex 10953 ax-cnre 10954 ax-pre-lttri 10955 ax-pre-lttrn 10956 ax-pre-ltadd 10957 ax-pre-mulgt0 10958 ax-pre-sup 10959 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-reu 3071 df-rmo 3072 df-rab 3073 df-v 3431 df-sbc 3716 df-csb 3832 df-dif 3889 df-un 3891 df-in 3893 df-ss 3903 df-pss 3905 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-br 5074 df-opab 5136 df-mpt 5157 df-tr 5191 df-id 5484 df-eprel 5490 df-po 5498 df-so 5499 df-fr 5539 df-we 5541 df-xp 5590 df-rel 5591 df-cnv 5592 df-co 5593 df-dm 5594 df-rn 5595 df-res 5596 df-ima 5597 df-pred 6195 df-ord 6262 df-on 6263 df-lim 6264 df-suc 6265 df-iota 6384 df-fun 6428 df-fn 6429 df-f 6430 df-f1 6431 df-fo 6432 df-f1o 6433 df-fv 6434 df-riota 7224 df-ov 7270 df-oprab 7271 df-mpo 7272 df-om 7703 df-1st 7820 df-2nd 7821 df-frecs 8084 df-wrecs 8115 df-recs 8189 df-rdg 8228 df-1o 8284 df-er 8485 df-map 8604 df-en 8721 df-dom 8722 df-sdom 8723 df-fin 8724 df-fi 9157 df-sup 9188 df-inf 9189 df-pnf 11021 df-mnf 11022 df-xr 11023 df-ltxr 11024 df-le 11025 df-sub 11217 df-neg 11218 df-div 11643 df-nn 11984 df-2 12046 df-3 12047 df-4 12048 df-5 12049 df-6 12050 df-7 12051 df-8 12052 df-9 12053 df-n0 12244 df-z 12330 df-dec 12448 df-uz 12593 df-q 12699 df-rp 12741 df-xneg 12858 df-xadd 12859 df-xmul 12860 df-fz 13250 df-seq 13732 df-exp 13793 df-cj 14820 df-re 14821 df-im 14822 df-sqrt 14956 df-abs 14957 df-struct 16858 df-slot 16893 df-ndx 16905 df-base 16923 df-plusg 16985 df-mulr 16986 df-starv 16987 df-tset 16991 df-ple 16992 df-ds 16994 df-unif 16995 df-rest 17143 df-topn 17144 df-topgen 17164 df-psmet 20599 df-xmet 20600 df-met 20601 df-bl 20602 df-mopn 20603 df-cnfld 20608 df-top 22053 df-topon 22070 df-topsp 22092 df-bases 22106 df-cnp 22389 df-xms 23483 df-ms 23484 |
This theorem is referenced by: limcfval 25046 ellimc 25047 |
Copyright terms: Public domain | W3C validator |