Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cncnp2 | Structured version Visualization version GIF version |
Description: A continuous function is continuous at all points. Theorem 7.2(g) of [Munkres] p. 107. (Contributed by Raph Levien, 20-Nov-2006.) (Proof shortened by Mario Carneiro, 21-Aug-2015.) |
Ref | Expression |
---|---|
cncnp.1 | ⊢ 𝑋 = ∪ 𝐽 |
cncnp.2 | ⊢ 𝑌 = ∪ 𝐾 |
Ref | Expression |
---|---|
cncnp2 | ⊢ (𝑋 ≠ ∅ → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ ∀𝑥 ∈ 𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cntop1 21776 | . . . . 5 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top) | |
2 | cncnp.1 | . . . . . 6 ⊢ 𝑋 = ∪ 𝐽 | |
3 | 2 | toptopon 21453 | . . . . 5 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋)) |
4 | 1, 3 | sylib 219 | . . . 4 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ (TopOn‘𝑋)) |
5 | cntop2 21777 | . . . . 5 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top) | |
6 | cncnp.2 | . . . . . 6 ⊢ 𝑌 = ∪ 𝐾 | |
7 | 6 | toptopon 21453 | . . . . 5 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘𝑌)) |
8 | 5, 7 | sylib 219 | . . . 4 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ (TopOn‘𝑌)) |
9 | 2, 6 | cnf 21782 | . . . 4 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋⟶𝑌) |
10 | 4, 8, 9 | jca31 515 | . . 3 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌)) |
11 | 10 | adantl 482 | . 2 ⊢ ((𝑋 ≠ ∅ ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌)) |
12 | r19.2z 4436 | . . 3 ⊢ ((𝑋 ≠ ∅ ∧ ∀𝑥 ∈ 𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)) → ∃𝑥 ∈ 𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)) | |
13 | cnptop1 21778 | . . . . . 6 ⊢ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) → 𝐽 ∈ Top) | |
14 | 13, 3 | sylib 219 | . . . . 5 ⊢ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) → 𝐽 ∈ (TopOn‘𝑋)) |
15 | cnptop2 21779 | . . . . . 6 ⊢ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) → 𝐾 ∈ Top) | |
16 | 15, 7 | sylib 219 | . . . . 5 ⊢ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) → 𝐾 ∈ (TopOn‘𝑌)) |
17 | 2, 6 | cnpf 21783 | . . . . 5 ⊢ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) → 𝐹:𝑋⟶𝑌) |
18 | 14, 16, 17 | jca31 515 | . . . 4 ⊢ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) → ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌)) |
19 | 18 | rexlimivw 3279 | . . 3 ⊢ (∃𝑥 ∈ 𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) → ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌)) |
20 | 12, 19 | syl 17 | . 2 ⊢ ((𝑋 ≠ ∅ ∧ ∀𝑥 ∈ 𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)) → ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌)) |
21 | cncnp 21816 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)))) | |
22 | 21 | baibd 540 | . 2 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ ∀𝑥 ∈ 𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥))) |
23 | 11, 20, 22 | pm5.21nd 798 | 1 ⊢ (𝑋 ≠ ∅ → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ ∀𝑥 ∈ 𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1528 ∈ wcel 2105 ≠ wne 3013 ∀wral 3135 ∃wrex 3136 ∅c0 4288 ∪ cuni 4830 ⟶wf 6344 ‘cfv 6348 (class class class)co 7145 Topctop 21429 TopOnctopon 21446 Cn ccn 21760 CnP ccnp 21761 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-ral 3140 df-rex 3141 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-id 5453 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-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-fv 6356 df-ov 7148 df-oprab 7149 df-mpo 7150 df-1st 7678 df-2nd 7679 df-map 8397 df-topgen 16705 df-top 21430 df-topon 21447 df-cn 21763 df-cnp 21764 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |