| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > negcncf | GIF version | ||
| Description: The negative function is continuous. (Contributed by Mario Carneiro, 30-Dec-2016.) |
| Ref | Expression |
|---|---|
| negcncf.1 | ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ -𝑥) |
| Ref | Expression |
|---|---|
| negcncf | ⊢ (𝐴 ⊆ ℂ → 𝐹 ∈ (𝐴–cn→ℂ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 19 | . 2 ⊢ (𝐴 ⊆ ℂ → 𝐴 ⊆ ℂ) | |
| 2 | ssidd 3246 | . 2 ⊢ (𝐴 ⊆ ℂ → ℂ ⊆ ℂ) | |
| 3 | ssel2 3220 | . . . . 5 ⊢ ((𝐴 ⊆ ℂ ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℂ) | |
| 4 | 3 | negcld 8470 | . . . 4 ⊢ ((𝐴 ⊆ ℂ ∧ 𝑥 ∈ 𝐴) → -𝑥 ∈ ℂ) |
| 5 | negcncf.1 | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ -𝑥) | |
| 6 | 4, 5 | fmptd 5797 | . . 3 ⊢ (𝐴 ⊆ ℂ → 𝐹:𝐴⟶ℂ) |
| 7 | simpr 110 | . . . 4 ⊢ ((𝑢 ∈ 𝐴 ∧ 𝑒 ∈ ℝ+) → 𝑒 ∈ ℝ+) | |
| 8 | 7 | a1i 9 | . . 3 ⊢ (𝐴 ⊆ ℂ → ((𝑢 ∈ 𝐴 ∧ 𝑒 ∈ ℝ+) → 𝑒 ∈ ℝ+)) |
| 9 | negeq 8365 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑢 → -𝑥 = -𝑢) | |
| 10 | simprll 537 | . . . . . . . . . 10 ⊢ ((𝐴 ⊆ ℂ ∧ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑒 ∈ ℝ+)) → 𝑢 ∈ 𝐴) | |
| 11 | simpl 109 | . . . . . . . . . . . 12 ⊢ ((𝐴 ⊆ ℂ ∧ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑒 ∈ ℝ+)) → 𝐴 ⊆ ℂ) | |
| 12 | 11, 10 | sseldd 3226 | . . . . . . . . . . 11 ⊢ ((𝐴 ⊆ ℂ ∧ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑒 ∈ ℝ+)) → 𝑢 ∈ ℂ) |
| 13 | 12 | negcld 8470 | . . . . . . . . . 10 ⊢ ((𝐴 ⊆ ℂ ∧ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑒 ∈ ℝ+)) → -𝑢 ∈ ℂ) |
| 14 | 5, 9, 10, 13 | fvmptd3 5736 | . . . . . . . . 9 ⊢ ((𝐴 ⊆ ℂ ∧ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑒 ∈ ℝ+)) → (𝐹‘𝑢) = -𝑢) |
| 15 | negeq 8365 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑣 → -𝑥 = -𝑣) | |
| 16 | simprlr 538 | . . . . . . . . . 10 ⊢ ((𝐴 ⊆ ℂ ∧ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑒 ∈ ℝ+)) → 𝑣 ∈ 𝐴) | |
| 17 | 11, 16 | sseldd 3226 | . . . . . . . . . . 11 ⊢ ((𝐴 ⊆ ℂ ∧ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑒 ∈ ℝ+)) → 𝑣 ∈ ℂ) |
| 18 | 17 | negcld 8470 | . . . . . . . . . 10 ⊢ ((𝐴 ⊆ ℂ ∧ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑒 ∈ ℝ+)) → -𝑣 ∈ ℂ) |
| 19 | 5, 15, 16, 18 | fvmptd3 5736 | . . . . . . . . 9 ⊢ ((𝐴 ⊆ ℂ ∧ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑒 ∈ ℝ+)) → (𝐹‘𝑣) = -𝑣) |
| 20 | 14, 19 | oveq12d 6031 | . . . . . . . 8 ⊢ ((𝐴 ⊆ ℂ ∧ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑒 ∈ ℝ+)) → ((𝐹‘𝑢) − (𝐹‘𝑣)) = (-𝑢 − -𝑣)) |
| 21 | 12, 17 | neg2subd 8500 | . . . . . . . 8 ⊢ ((𝐴 ⊆ ℂ ∧ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑒 ∈ ℝ+)) → (-𝑢 − -𝑣) = (𝑣 − 𝑢)) |
| 22 | 20, 21 | eqtrd 2262 | . . . . . . 7 ⊢ ((𝐴 ⊆ ℂ ∧ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑒 ∈ ℝ+)) → ((𝐹‘𝑢) − (𝐹‘𝑣)) = (𝑣 − 𝑢)) |
| 23 | 22 | fveq2d 5639 | . . . . . 6 ⊢ ((𝐴 ⊆ ℂ ∧ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑒 ∈ ℝ+)) → (abs‘((𝐹‘𝑢) − (𝐹‘𝑣))) = (abs‘(𝑣 − 𝑢))) |
| 24 | 17, 12 | abssubd 11747 | . . . . . 6 ⊢ ((𝐴 ⊆ ℂ ∧ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑒 ∈ ℝ+)) → (abs‘(𝑣 − 𝑢)) = (abs‘(𝑢 − 𝑣))) |
| 25 | 23, 24 | eqtrd 2262 | . . . . 5 ⊢ ((𝐴 ⊆ ℂ ∧ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑒 ∈ ℝ+)) → (abs‘((𝐹‘𝑢) − (𝐹‘𝑣))) = (abs‘(𝑢 − 𝑣))) |
| 26 | 25 | breq1d 4096 | . . . 4 ⊢ ((𝐴 ⊆ ℂ ∧ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑒 ∈ ℝ+)) → ((abs‘((𝐹‘𝑢) − (𝐹‘𝑣))) < 𝑒 ↔ (abs‘(𝑢 − 𝑣)) < 𝑒)) |
| 27 | 26 | exbiri 382 | . . 3 ⊢ (𝐴 ⊆ ℂ → (((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑒 ∈ ℝ+) → ((abs‘(𝑢 − 𝑣)) < 𝑒 → (abs‘((𝐹‘𝑢) − (𝐹‘𝑣))) < 𝑒))) |
| 28 | 6, 8, 27 | elcncf1di 15296 | . 2 ⊢ (𝐴 ⊆ ℂ → ((𝐴 ⊆ ℂ ∧ ℂ ⊆ ℂ) → 𝐹 ∈ (𝐴–cn→ℂ))) |
| 29 | 1, 2, 28 | mp2and 433 | 1 ⊢ (𝐴 ⊆ ℂ → 𝐹 ∈ (𝐴–cn→ℂ)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 ⊆ wss 3198 class class class wbr 4086 ↦ cmpt 4148 ‘cfv 5324 (class class class)co 6013 ℂcc 8023 < clt 8207 − cmin 8343 -cneg 8344 ℝ+crp 9881 abscabs 11551 –cn→ccncf 15287 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4202 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-cnex 8116 ax-resscn 8117 ax-1cn 8118 ax-1re 8119 ax-icn 8120 ax-addcl 8121 ax-addrcl 8122 ax-mulcl 8123 ax-mulrcl 8124 ax-addcom 8125 ax-mulcom 8126 ax-addass 8127 ax-mulass 8128 ax-distr 8129 ax-i2m1 8130 ax-0lt1 8131 ax-1rid 8132 ax-0id 8133 ax-rnegex 8134 ax-precex 8135 ax-cnre 8136 ax-pre-ltirr 8137 ax-pre-ltwlin 8138 ax-pre-lttrn 8139 ax-pre-apti 8140 ax-pre-ltadd 8141 ax-pre-mulgt0 8142 ax-pre-mulext 8143 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-po 4391 df-iso 4392 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-map 6814 df-pnf 8209 df-mnf 8210 df-xr 8211 df-ltxr 8212 df-le 8213 df-sub 8345 df-neg 8346 df-reap 8748 df-ap 8755 df-div 8846 df-2 9195 df-cj 11396 df-re 11397 df-im 11398 df-rsqrt 11552 df-abs 11553 df-cncf 15288 |
| This theorem is referenced by: negfcncf 15323 |
| Copyright terms: Public domain | W3C validator |