Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > limcvallem | Structured version Visualization version GIF version |
Description: Lemma for ellimc 24742. (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 4435 | . . . 4 ⊢ (𝑧 = 𝐵 → if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧)) = 𝐶) | |
2 | 1 | eleq1d 2818 | . . 3 ⊢ (𝑧 = 𝐵 → (if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧)) ∈ ℂ ↔ 𝐶 ∈ ℂ)) |
3 | limcval.j | . . . . . 6 ⊢ 𝐽 = (𝐾 ↾t (𝐴 ∪ {𝐵})) | |
4 | limcval.k | . . . . . . . 8 ⊢ 𝐾 = (TopOpen‘ℂfld) | |
5 | 4 | cnfldtopon 23652 | . . . . . . 7 ⊢ 𝐾 ∈ (TopOn‘ℂ) |
6 | simpl2 1194 | . . . . . . . 8 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐴 ⊆ ℂ) | |
7 | simpl3 1195 | . . . . . . . . 9 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐵 ∈ ℂ) | |
8 | 7 | snssd 4712 | . . . . . . . 8 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → {𝐵} ⊆ ℂ) |
9 | 6, 8 | unssd 4090 | . . . . . . 7 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → (𝐴 ∪ {𝐵}) ⊆ ℂ) |
10 | resttopon 22030 | . . . . . . 7 ⊢ ((𝐾 ∈ (TopOn‘ℂ) ∧ (𝐴 ∪ {𝐵}) ⊆ ℂ) → (𝐾 ↾t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵}))) | |
11 | 5, 9, 10 | sylancr 590 | . . . . . 6 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → (𝐾 ↾t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵}))) |
12 | 3, 11 | eqeltrid 2838 | . . . . 5 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐽 ∈ (TopOn‘(𝐴 ∪ {𝐵}))) |
13 | 5 | a1i 11 | . . . . 5 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐾 ∈ (TopOn‘ℂ)) |
14 | simpr 488 | . . . . 5 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) | |
15 | cnpf2 22119 | . . . . 5 ⊢ ((𝐽 ∈ (TopOn‘(𝐴 ∪ {𝐵})) ∧ 𝐾 ∈ (TopOn‘ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐺:(𝐴 ∪ {𝐵})⟶ℂ) | |
16 | 12, 13, 14, 15 | syl3anc 1373 | . . . 4 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐺:(𝐴 ∪ {𝐵})⟶ℂ) |
17 | limcvallem.g | . . . . 5 ⊢ 𝐺 = (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧))) | |
18 | 17 | fmpt 6916 | . . . 4 ⊢ (∀𝑧 ∈ (𝐴 ∪ {𝐵})if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧)) ∈ ℂ ↔ 𝐺:(𝐴 ∪ {𝐵})⟶ℂ) |
19 | 16, 18 | sylibr 237 | . . 3 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → ∀𝑧 ∈ (𝐴 ∪ {𝐵})if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧)) ∈ ℂ) |
20 | ssun2 4077 | . . . 4 ⊢ {𝐵} ⊆ (𝐴 ∪ {𝐵}) | |
21 | snssg 4688 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (𝐵 ∈ (𝐴 ∪ {𝐵}) ↔ {𝐵} ⊆ (𝐴 ∪ {𝐵}))) | |
22 | 7, 21 | syl 17 | . . . 4 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → (𝐵 ∈ (𝐴 ∪ {𝐵}) ↔ {𝐵} ⊆ (𝐴 ∪ {𝐵}))) |
23 | 20, 22 | mpbiri 261 | . . 3 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐵 ∈ (𝐴 ∪ {𝐵})) |
24 | 2, 19, 23 | rspcdva 3532 | . 2 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐶 ∈ ℂ) |
25 | 24 | ex 416 | 1 ⊢ ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → (𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵) → 𝐶 ∈ ℂ)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1089 = wceq 1543 ∈ wcel 2110 ∀wral 3054 ∪ cun 3855 ⊆ wss 3857 ifcif 4429 {csn 4531 ↦ cmpt 5124 ⟶wf 6365 ‘cfv 6369 (class class class)co 7202 ℂcc 10710 ↾t crest 16897 TopOpenctopn 16898 ℂfldccnfld 20335 TopOnctopon 21779 CnP ccnp 22094 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2706 ax-rep 5168 ax-sep 5181 ax-nul 5188 ax-pow 5247 ax-pr 5311 ax-un 7512 ax-cnex 10768 ax-resscn 10769 ax-1cn 10770 ax-icn 10771 ax-addcl 10772 ax-addrcl 10773 ax-mulcl 10774 ax-mulrcl 10775 ax-mulcom 10776 ax-addass 10777 ax-mulass 10778 ax-distr 10779 ax-i2m1 10780 ax-1ne0 10781 ax-1rid 10782 ax-rnegex 10783 ax-rrecex 10784 ax-cnre 10785 ax-pre-lttri 10786 ax-pre-lttrn 10787 ax-pre-ltadd 10788 ax-pre-mulgt0 10789 ax-pre-sup 10790 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2537 df-eu 2566 df-clab 2713 df-cleq 2726 df-clel 2812 df-nfc 2882 df-ne 2936 df-nel 3040 df-ral 3059 df-rex 3060 df-reu 3061 df-rmo 3062 df-rab 3063 df-v 3403 df-sbc 3688 df-csb 3803 df-dif 3860 df-un 3862 df-in 3864 df-ss 3874 df-pss 3876 df-nul 4228 df-if 4430 df-pw 4505 df-sn 4532 df-pr 4534 df-tp 4536 df-op 4538 df-uni 4810 df-int 4850 df-iun 4896 df-br 5044 df-opab 5106 df-mpt 5125 df-tr 5151 df-id 5444 df-eprel 5449 df-po 5457 df-so 5458 df-fr 5498 df-we 5500 df-xp 5546 df-rel 5547 df-cnv 5548 df-co 5549 df-dm 5550 df-rn 5551 df-res 5552 df-ima 5553 df-pred 6149 df-ord 6205 df-on 6206 df-lim 6207 df-suc 6208 df-iota 6327 df-fun 6371 df-fn 6372 df-f 6373 df-f1 6374 df-fo 6375 df-f1o 6376 df-fv 6377 df-riota 7159 df-ov 7205 df-oprab 7206 df-mpo 7207 df-om 7634 df-1st 7750 df-2nd 7751 df-wrecs 8036 df-recs 8097 df-rdg 8135 df-1o 8191 df-er 8380 df-map 8499 df-en 8616 df-dom 8617 df-sdom 8618 df-fin 8619 df-fi 9016 df-sup 9047 df-inf 9048 df-pnf 10852 df-mnf 10853 df-xr 10854 df-ltxr 10855 df-le 10856 df-sub 11047 df-neg 11048 df-div 11473 df-nn 11814 df-2 11876 df-3 11877 df-4 11878 df-5 11879 df-6 11880 df-7 11881 df-8 11882 df-9 11883 df-n0 12074 df-z 12160 df-dec 12277 df-uz 12422 df-q 12528 df-rp 12570 df-xneg 12687 df-xadd 12688 df-xmul 12689 df-fz 13079 df-seq 13558 df-exp 13619 df-cj 14645 df-re 14646 df-im 14647 df-sqrt 14781 df-abs 14782 df-struct 16686 df-ndx 16687 df-slot 16688 df-base 16690 df-plusg 16780 df-mulr 16781 df-starv 16782 df-tset 16786 df-ple 16787 df-ds 16789 df-unif 16790 df-rest 16899 df-topn 16900 df-topgen 16920 df-psmet 20327 df-xmet 20328 df-met 20329 df-bl 20330 df-mopn 20331 df-cnfld 20336 df-top 21763 df-topon 21780 df-topsp 21802 df-bases 21815 df-cnp 22097 df-xms 23190 df-ms 23191 |
This theorem is referenced by: limcfval 24741 ellimc 24742 |
Copyright terms: Public domain | W3C validator |