Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > limcvallem | Structured version Visualization version GIF version |
Description: Lemma for ellimc 24473. (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 4475 | . . . 4 ⊢ (𝑧 = 𝐵 → if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧)) = 𝐶) | |
2 | 1 | eleq1d 2899 | . . 3 ⊢ (𝑧 = 𝐵 → (if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧)) ∈ ℂ ↔ 𝐶 ∈ ℂ)) |
3 | limcval.j | . . . . . 6 ⊢ 𝐽 = (𝐾 ↾t (𝐴 ∪ {𝐵})) | |
4 | limcval.k | . . . . . . . 8 ⊢ 𝐾 = (TopOpen‘ℂfld) | |
5 | 4 | cnfldtopon 23393 | . . . . . . 7 ⊢ 𝐾 ∈ (TopOn‘ℂ) |
6 | simpl2 1188 | . . . . . . . 8 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐴 ⊆ ℂ) | |
7 | simpl3 1189 | . . . . . . . . 9 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐵 ∈ ℂ) | |
8 | 7 | snssd 4744 | . . . . . . . 8 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → {𝐵} ⊆ ℂ) |
9 | 6, 8 | unssd 4164 | . . . . . . 7 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → (𝐴 ∪ {𝐵}) ⊆ ℂ) |
10 | resttopon 21771 | . . . . . . 7 ⊢ ((𝐾 ∈ (TopOn‘ℂ) ∧ (𝐴 ∪ {𝐵}) ⊆ ℂ) → (𝐾 ↾t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵}))) | |
11 | 5, 9, 10 | sylancr 589 | . . . . . 6 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → (𝐾 ↾t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵}))) |
12 | 3, 11 | eqeltrid 2919 | . . . . 5 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐽 ∈ (TopOn‘(𝐴 ∪ {𝐵}))) |
13 | 5 | a1i 11 | . . . . 5 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐾 ∈ (TopOn‘ℂ)) |
14 | simpr 487 | . . . . 5 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) | |
15 | cnpf2 21860 | . . . . 5 ⊢ ((𝐽 ∈ (TopOn‘(𝐴 ∪ {𝐵})) ∧ 𝐾 ∈ (TopOn‘ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐺:(𝐴 ∪ {𝐵})⟶ℂ) | |
16 | 12, 13, 14, 15 | syl3anc 1367 | . . . 4 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐺:(𝐴 ∪ {𝐵})⟶ℂ) |
17 | limcvallem.g | . . . . 5 ⊢ 𝐺 = (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧))) | |
18 | 17 | fmpt 6876 | . . . 4 ⊢ (∀𝑧 ∈ (𝐴 ∪ {𝐵})if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧)) ∈ ℂ ↔ 𝐺:(𝐴 ∪ {𝐵})⟶ℂ) |
19 | 16, 18 | sylibr 236 | . . 3 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → ∀𝑧 ∈ (𝐴 ∪ {𝐵})if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧)) ∈ ℂ) |
20 | ssun2 4151 | . . . 4 ⊢ {𝐵} ⊆ (𝐴 ∪ {𝐵}) | |
21 | snssg 4719 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (𝐵 ∈ (𝐴 ∪ {𝐵}) ↔ {𝐵} ⊆ (𝐴 ∪ {𝐵}))) | |
22 | 7, 21 | syl 17 | . . . 4 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → (𝐵 ∈ (𝐴 ∪ {𝐵}) ↔ {𝐵} ⊆ (𝐴 ∪ {𝐵}))) |
23 | 20, 22 | mpbiri 260 | . . 3 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐵 ∈ (𝐴 ∪ {𝐵})) |
24 | 2, 19, 23 | rspcdva 3627 | . 2 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐶 ∈ ℂ) |
25 | 24 | ex 415 | 1 ⊢ ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → (𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵) → 𝐶 ∈ ℂ)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ∀wral 3140 ∪ cun 3936 ⊆ wss 3938 ifcif 4469 {csn 4569 ↦ cmpt 5148 ⟶wf 6353 ‘cfv 6357 (class class class)co 7158 ℂcc 10537 ↾t crest 16696 TopOpenctopn 16697 ℂfldccnfld 20547 TopOnctopon 21520 CnP ccnp 21835 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 ax-pre-sup 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-oadd 8108 df-er 8291 df-map 8410 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-fi 8877 df-sup 8908 df-inf 8909 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-div 11300 df-nn 11641 df-2 11703 df-3 11704 df-4 11705 df-5 11706 df-6 11707 df-7 11708 df-8 11709 df-9 11710 df-n0 11901 df-z 11985 df-dec 12102 df-uz 12247 df-q 12352 df-rp 12393 df-xneg 12510 df-xadd 12511 df-xmul 12512 df-fz 12896 df-seq 13373 df-exp 13433 df-cj 14460 df-re 14461 df-im 14462 df-sqrt 14596 df-abs 14597 df-struct 16487 df-ndx 16488 df-slot 16489 df-base 16491 df-plusg 16580 df-mulr 16581 df-starv 16582 df-tset 16586 df-ple 16587 df-ds 16589 df-unif 16590 df-rest 16698 df-topn 16699 df-topgen 16719 df-psmet 20539 df-xmet 20540 df-met 20541 df-bl 20542 df-mopn 20543 df-cnfld 20548 df-top 21504 df-topon 21521 df-topsp 21543 df-bases 21556 df-cnp 21838 df-xms 22932 df-ms 22933 |
This theorem is referenced by: limcfval 24472 ellimc 24473 |
Copyright terms: Public domain | W3C validator |