Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > climcncf | GIF version |
Description: Image of a limit under a continuous map. (Contributed by Mario Carneiro, 7-Apr-2015.) |
Ref | Expression |
---|---|
climcncf.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
climcncf.2 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
climcncf.4 | ⊢ (𝜑 → 𝐹 ∈ (𝐴–cn→𝐵)) |
climcncf.5 | ⊢ (𝜑 → 𝐺:𝑍⟶𝐴) |
climcncf.6 | ⊢ (𝜑 → 𝐺 ⇝ 𝐷) |
climcncf.7 | ⊢ (𝜑 → 𝐷 ∈ 𝐴) |
Ref | Expression |
---|---|
climcncf | ⊢ (𝜑 → (𝐹 ∘ 𝐺) ⇝ (𝐹‘𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | climcncf.1 | . 2 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
2 | climcncf.2 | . 2 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
3 | climcncf.7 | . 2 ⊢ (𝜑 → 𝐷 ∈ 𝐴) | |
4 | climcncf.4 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ (𝐴–cn→𝐵)) | |
5 | cncff 13358 | . . . . 5 ⊢ (𝐹 ∈ (𝐴–cn→𝐵) → 𝐹:𝐴⟶𝐵) | |
6 | 4, 5 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) |
7 | 6 | ffvelrnda 5631 | . . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (𝐹‘𝑧) ∈ 𝐵) |
8 | cncfrss2 13357 | . . . . 5 ⊢ (𝐹 ∈ (𝐴–cn→𝐵) → 𝐵 ⊆ ℂ) | |
9 | 4, 8 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐵 ⊆ ℂ) |
10 | 9 | sselda 3147 | . . 3 ⊢ ((𝜑 ∧ (𝐹‘𝑧) ∈ 𝐵) → (𝐹‘𝑧) ∈ ℂ) |
11 | 7, 10 | syldan 280 | . 2 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (𝐹‘𝑧) ∈ ℂ) |
12 | climcncf.6 | . 2 ⊢ (𝜑 → 𝐺 ⇝ 𝐷) | |
13 | climcncf.5 | . . . 4 ⊢ (𝜑 → 𝐺:𝑍⟶𝐴) | |
14 | zex 9221 | . . . . . 6 ⊢ ℤ ∈ V | |
15 | uzssz 9506 | . . . . . 6 ⊢ (ℤ≥‘𝑀) ⊆ ℤ | |
16 | 14, 15 | ssexi 4127 | . . . . 5 ⊢ (ℤ≥‘𝑀) ∈ V |
17 | 1, 16 | eqeltri 2243 | . . . 4 ⊢ 𝑍 ∈ V |
18 | fex 5725 | . . . 4 ⊢ ((𝐺:𝑍⟶𝐴 ∧ 𝑍 ∈ V) → 𝐺 ∈ V) | |
19 | 13, 17, 18 | sylancl 411 | . . 3 ⊢ (𝜑 → 𝐺 ∈ V) |
20 | coexg 5155 | . . 3 ⊢ ((𝐹 ∈ (𝐴–cn→𝐵) ∧ 𝐺 ∈ V) → (𝐹 ∘ 𝐺) ∈ V) | |
21 | 4, 19, 20 | syl2anc 409 | . 2 ⊢ (𝜑 → (𝐹 ∘ 𝐺) ∈ V) |
22 | cncfi 13359 | . . . . 5 ⊢ ((𝐹 ∈ (𝐴–cn→𝐵) ∧ 𝐷 ∈ 𝐴 ∧ 𝑥 ∈ ℝ+) → ∃𝑦 ∈ ℝ+ ∀𝑧 ∈ 𝐴 ((abs‘(𝑧 − 𝐷)) < 𝑦 → (abs‘((𝐹‘𝑧) − (𝐹‘𝐷))) < 𝑥)) | |
23 | 22 | 3expia 1200 | . . . 4 ⊢ ((𝐹 ∈ (𝐴–cn→𝐵) ∧ 𝐷 ∈ 𝐴) → (𝑥 ∈ ℝ+ → ∃𝑦 ∈ ℝ+ ∀𝑧 ∈ 𝐴 ((abs‘(𝑧 − 𝐷)) < 𝑦 → (abs‘((𝐹‘𝑧) − (𝐹‘𝐷))) < 𝑥))) |
24 | 4, 3, 23 | syl2anc 409 | . . 3 ⊢ (𝜑 → (𝑥 ∈ ℝ+ → ∃𝑦 ∈ ℝ+ ∀𝑧 ∈ 𝐴 ((abs‘(𝑧 − 𝐷)) < 𝑦 → (abs‘((𝐹‘𝑧) − (𝐹‘𝐷))) < 𝑥))) |
25 | 24 | imp 123 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ+) → ∃𝑦 ∈ ℝ+ ∀𝑧 ∈ 𝐴 ((abs‘(𝑧 − 𝐷)) < 𝑦 → (abs‘((𝐹‘𝑧) − (𝐹‘𝐷))) < 𝑥)) |
26 | 13 | ffvelrnda 5631 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) ∈ 𝐴) |
27 | fvco3 5567 | . . 3 ⊢ ((𝐺:𝑍⟶𝐴 ∧ 𝑘 ∈ 𝑍) → ((𝐹 ∘ 𝐺)‘𝑘) = (𝐹‘(𝐺‘𝑘))) | |
28 | 13, 27 | sylan 281 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝐹 ∘ 𝐺)‘𝑘) = (𝐹‘(𝐺‘𝑘))) |
29 | 1, 2, 3, 11, 12, 21, 25, 26, 28 | climcn1 11271 | 1 ⊢ (𝜑 → (𝐹 ∘ 𝐺) ⇝ (𝐹‘𝐷)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1348 ∈ wcel 2141 ∀wral 2448 ∃wrex 2449 Vcvv 2730 ⊆ wss 3121 class class class wbr 3989 ∘ ccom 4615 ⟶wf 5194 ‘cfv 5198 (class class class)co 5853 ℂcc 7772 < clt 7954 − cmin 8090 ℤcz 9212 ℤ≥cuz 9487 ℝ+crp 9610 abscabs 10961 ⇝ cli 11241 –cn→ccncf 13351 |
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 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-coll 4104 ax-sep 4107 ax-pow 4160 ax-pr 4194 ax-un 4418 ax-setind 4521 ax-cnex 7865 ax-resscn 7866 ax-1cn 7867 ax-1re 7868 ax-icn 7869 ax-addcl 7870 ax-addrcl 7871 ax-mulcl 7872 ax-mulrcl 7873 ax-addcom 7874 ax-mulcom 7875 ax-addass 7876 ax-mulass 7877 ax-distr 7878 ax-i2m1 7879 ax-0lt1 7880 ax-1rid 7881 ax-0id 7882 ax-rnegex 7883 ax-precex 7884 ax-cnre 7885 ax-pre-ltirr 7886 ax-pre-ltwlin 7887 ax-pre-lttrn 7888 ax-pre-apti 7889 ax-pre-ltadd 7890 ax-pre-mulgt0 7891 ax-pre-mulext 7892 |
This theorem depends on definitions: df-bi 116 df-dc 830 df-3or 974 df-3an 975 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ne 2341 df-nel 2436 df-ral 2453 df-rex 2454 df-reu 2455 df-rmo 2456 df-rab 2457 df-v 2732 df-sbc 2956 df-csb 3050 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-if 3527 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 df-uni 3797 df-int 3832 df-iun 3875 df-br 3990 df-opab 4051 df-mpt 4052 df-id 4278 df-po 4281 df-iso 4282 df-xp 4617 df-rel 4618 df-cnv 4619 df-co 4620 df-dm 4621 df-rn 4622 df-res 4623 df-ima 4624 df-iota 5160 df-fun 5200 df-fn 5201 df-f 5202 df-f1 5203 df-fo 5204 df-f1o 5205 df-fv 5206 df-riota 5809 df-ov 5856 df-oprab 5857 df-mpo 5858 df-map 6628 df-pnf 7956 df-mnf 7957 df-xr 7958 df-ltxr 7959 df-le 7960 df-sub 8092 df-neg 8093 df-reap 8494 df-ap 8501 df-div 8590 df-inn 8879 df-2 8937 df-n0 9136 df-z 9213 df-uz 9488 df-cj 10806 df-re 10807 df-im 10808 df-rsqrt 10962 df-abs 10963 df-clim 11242 df-cncf 13352 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |