Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > limcvallem | Structured version Visualization version GIF version |
Description: Lemma for ellimc 24463. (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 4471 | . . . 4 ⊢ (𝑧 = 𝐵 → if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧)) = 𝐶) | |
2 | 1 | eleq1d 2895 | . . 3 ⊢ (𝑧 = 𝐵 → (if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧)) ∈ ℂ ↔ 𝐶 ∈ ℂ)) |
3 | limcval.j | . . . . . 6 ⊢ 𝐽 = (𝐾 ↾t (𝐴 ∪ {𝐵})) | |
4 | limcval.k | . . . . . . . 8 ⊢ 𝐾 = (TopOpen‘ℂfld) | |
5 | 4 | cnfldtopon 23383 | . . . . . . 7 ⊢ 𝐾 ∈ (TopOn‘ℂ) |
6 | simpl2 1187 | . . . . . . . 8 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐴 ⊆ ℂ) | |
7 | simpl3 1188 | . . . . . . . . 9 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐵 ∈ ℂ) | |
8 | 7 | snssd 4734 | . . . . . . . 8 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → {𝐵} ⊆ ℂ) |
9 | 6, 8 | unssd 4160 | . . . . . . 7 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → (𝐴 ∪ {𝐵}) ⊆ ℂ) |
10 | resttopon 21761 | . . . . . . 7 ⊢ ((𝐾 ∈ (TopOn‘ℂ) ∧ (𝐴 ∪ {𝐵}) ⊆ ℂ) → (𝐾 ↾t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵}))) | |
11 | 5, 9, 10 | sylancr 589 | . . . . . 6 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → (𝐾 ↾t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵}))) |
12 | 3, 11 | eqeltrid 2915 | . . . . 5 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐽 ∈ (TopOn‘(𝐴 ∪ {𝐵}))) |
13 | 5 | a1i 11 | . . . . 5 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐾 ∈ (TopOn‘ℂ)) |
14 | simpr 487 | . . . . 5 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) | |
15 | cnpf2 21850 | . . . . 5 ⊢ ((𝐽 ∈ (TopOn‘(𝐴 ∪ {𝐵})) ∧ 𝐾 ∈ (TopOn‘ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐺:(𝐴 ∪ {𝐵})⟶ℂ) | |
16 | 12, 13, 14, 15 | syl3anc 1366 | . . . 4 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐺:(𝐴 ∪ {𝐵})⟶ℂ) |
17 | limcvallem.g | . . . . 5 ⊢ 𝐺 = (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧))) | |
18 | 17 | fmpt 6867 | . . . 4 ⊢ (∀𝑧 ∈ (𝐴 ∪ {𝐵})if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧)) ∈ ℂ ↔ 𝐺:(𝐴 ∪ {𝐵})⟶ℂ) |
19 | 16, 18 | sylibr 236 | . . 3 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → ∀𝑧 ∈ (𝐴 ∪ {𝐵})if(𝑧 = 𝐵, 𝐶, (𝐹‘𝑧)) ∈ ℂ) |
20 | ssun2 4147 | . . . 4 ⊢ {𝐵} ⊆ (𝐴 ∪ {𝐵}) | |
21 | snssg 4709 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (𝐵 ∈ (𝐴 ∪ {𝐵}) ↔ {𝐵} ⊆ (𝐴 ∪ {𝐵}))) | |
22 | 7, 21 | syl 17 | . . . 4 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → (𝐵 ∈ (𝐴 ∪ {𝐵}) ↔ {𝐵} ⊆ (𝐴 ∪ {𝐵}))) |
23 | 20, 22 | mpbiri 260 | . . 3 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐵 ∈ (𝐴 ∪ {𝐵})) |
24 | 2, 19, 23 | rspcdva 3623 | . 2 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵)) → 𝐶 ∈ ℂ) |
25 | 24 | ex 415 | 1 ⊢ ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → (𝐺 ∈ ((𝐽 CnP 𝐾)‘𝐵) → 𝐶 ∈ ℂ)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1082 = wceq 1531 ∈ wcel 2108 ∀wral 3136 ∪ cun 3932 ⊆ wss 3934 ifcif 4465 {csn 4559 ↦ cmpt 5137 ⟶wf 6344 ‘cfv 6348 (class class class)co 7148 ℂcc 10527 ↾t crest 16686 TopOpenctopn 16687 ℂfldccnfld 20537 TopOnctopon 21510 CnP ccnp 21825 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1905 ax-6 1964 ax-7 2009 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2154 ax-12 2170 ax-ext 2791 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7453 ax-cnex 10585 ax-resscn 10586 ax-1cn 10587 ax-icn 10588 ax-addcl 10589 ax-addrcl 10590 ax-mulcl 10591 ax-mulrcl 10592 ax-mulcom 10593 ax-addass 10594 ax-mulass 10595 ax-distr 10596 ax-i2m1 10597 ax-1ne0 10598 ax-1rid 10599 ax-rnegex 10600 ax-rrecex 10601 ax-cnre 10602 ax-pre-lttri 10603 ax-pre-lttrn 10604 ax-pre-ltadd 10605 ax-pre-mulgt0 10606 ax-pre-sup 10607 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1083 df-3an 1084 df-tru 1534 df-ex 1775 df-nf 1779 df-sb 2064 df-mo 2616 df-eu 2648 df-clab 2798 df-cleq 2812 df-clel 2891 df-nfc 2961 df-ne 3015 df-nel 3122 df-ral 3141 df-rex 3142 df-reu 3143 df-rmo 3144 df-rab 3145 df-v 3495 df-sbc 3771 df-csb 3882 df-dif 3937 df-un 3939 df-in 3941 df-ss 3950 df-pss 3952 df-nul 4290 df-if 4466 df-pw 4539 df-sn 4560 df-pr 4562 df-tp 4564 df-op 4566 df-uni 4831 df-int 4868 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7106 df-ov 7151 df-oprab 7152 df-mpo 7153 df-om 7573 df-1st 7681 df-2nd 7682 df-wrecs 7939 df-recs 8000 df-rdg 8038 df-1o 8094 df-oadd 8098 df-er 8281 df-map 8400 df-en 8502 df-dom 8503 df-sdom 8504 df-fin 8505 df-fi 8867 df-sup 8898 df-inf 8899 df-pnf 10669 df-mnf 10670 df-xr 10671 df-ltxr 10672 df-le 10673 df-sub 10864 df-neg 10865 df-div 11290 df-nn 11631 df-2 11692 df-3 11693 df-4 11694 df-5 11695 df-6 11696 df-7 11697 df-8 11698 df-9 11699 df-n0 11890 df-z 11974 df-dec 12091 df-uz 12236 df-q 12341 df-rp 12382 df-xneg 12499 df-xadd 12500 df-xmul 12501 df-fz 12885 df-seq 13362 df-exp 13422 df-cj 14450 df-re 14451 df-im 14452 df-sqrt 14586 df-abs 14587 df-struct 16477 df-ndx 16478 df-slot 16479 df-base 16481 df-plusg 16570 df-mulr 16571 df-starv 16572 df-tset 16576 df-ple 16577 df-ds 16579 df-unif 16580 df-rest 16688 df-topn 16689 df-topgen 16709 df-psmet 20529 df-xmet 20530 df-met 20531 df-bl 20532 df-mopn 20533 df-cnfld 20538 df-top 21494 df-topon 21511 df-topsp 21533 df-bases 21546 df-cnp 21828 df-xms 22922 df-ms 22923 |
This theorem is referenced by: limcfval 24462 ellimc 24463 |
Copyright terms: Public domain | W3C validator |