Theorem reldv 26245

Description: The derivative function is a relation. (Contributed by Mario Carneiro, 7-Aug-2014.) (Revised by Mario Carneiro, 24-Dec-2016.)

Assertion

Ref	Expression
reldv	⊢ Rel (𝑆 D 𝐹)

Proof of Theorem reldv

Dummy variables 𝑓 𝑠 𝑥 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		relxp 5676	. . . . . . . 8 ⊢ Rel ({𝑥} × ((𝑧 ∈ (dom 𝑓 ∖ {𝑥}) ↦ (((𝑓‘𝑧) − (𝑓‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥))
2	1	rgenw 3084	. . . . . . 7 ⊢ ∀𝑥 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑠))‘dom 𝑓)Rel ({𝑥} × ((𝑧 ∈ (dom 𝑓 ∖ {𝑥}) ↦ (((𝑓‘𝑧) − (𝑓‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥))
3		reliun 5803	. . . . . . 7 ⊢ (Rel ∪ 𝑥 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑠))‘dom 𝑓)({𝑥} × ((𝑧 ∈ (dom 𝑓 ∖ {𝑥}) ↦ (((𝑓‘𝑧) − (𝑓‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥)) ↔ ∀𝑥 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑠))‘dom 𝑓)Rel ({𝑥} × ((𝑧 ∈ (dom 𝑓 ∖ {𝑥}) ↦ (((𝑓‘𝑧) − (𝑓‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥)))
4	2, 3	mpbir 234	. . . . . 6 ⊢ Rel ∪ 𝑥 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑠))‘dom 𝑓)({𝑥} × ((𝑧 ∈ (dom 𝑓 ∖ {𝑥}) ↦ (((𝑓‘𝑧) − (𝑓‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥))
5		df-rel 5665	. . . . . 6 ⊢ (Rel ∪ 𝑥 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑠))‘dom 𝑓)({𝑥} × ((𝑧 ∈ (dom 𝑓 ∖ {𝑥}) ↦ (((𝑓‘𝑧) − (𝑓‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥)) ↔ ∪ 𝑥 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑠))‘dom 𝑓)({𝑥} × ((𝑧 ∈ (dom 𝑓 ∖ {𝑥}) ↦ (((𝑓‘𝑧) − (𝑓‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥)) ⊆ (V × V))
6	4, 5	mpbi 233	. . . . 5 ⊢ ∪ 𝑥 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑠))‘dom 𝑓)({𝑥} × ((𝑧 ∈ (dom 𝑓 ∖ {𝑥}) ↦ (((𝑓‘𝑧) − (𝑓‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥)) ⊆ (V × V)
7	6	rgenw 3084	. . . 4 ⊢ ∀𝑓 ∈ (ℂ ↑pm 𝑠)∪ 𝑥 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑠))‘dom 𝑓)({𝑥} × ((𝑧 ∈ (dom 𝑓 ∖ {𝑥}) ↦ (((𝑓‘𝑧) − (𝑓‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥)) ⊆ (V × V)
8	7	rgenw 3084	. . 3 ⊢ ∀𝑠 ∈ 𝒫 ℂ∀𝑓 ∈ (ℂ ↑pm 𝑠)∪ 𝑥 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑠))‘dom 𝑓)({𝑥} × ((𝑧 ∈ (dom 𝑓 ∖ {𝑥}) ↦ (((𝑓‘𝑧) − (𝑓‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥)) ⊆ (V × V)
9		df-dv 26242	. . . 4 ⊢ D = (𝑠 ∈ 𝒫 ℂ, 𝑓 ∈ (ℂ ↑pm 𝑠) ↦ ∪ 𝑥 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑠))‘dom 𝑓)({𝑥} × ((𝑧 ∈ (dom 𝑓 ∖ {𝑥}) ↦ (((𝑓‘𝑧) − (𝑓‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥)))
10	9	ovmptss 8139	. . 3 ⊢ (∀𝑠 ∈ 𝒫 ℂ∀𝑓 ∈ (ℂ ↑pm 𝑠)∪ 𝑥 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑠))‘dom 𝑓)({𝑥} × ((𝑧 ∈ (dom 𝑓 ∖ {𝑥}) ↦ (((𝑓‘𝑧) − (𝑓‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥)) ⊆ (V × V) → (𝑆 D 𝐹) ⊆ (V × V))
11	8, 10	ax-mp 5	. 2 ⊢ (𝑆 D 𝐹) ⊆ (V × V)
12		df-rel 5665	. 2 ⊢ (Rel (𝑆 D 𝐹) ↔ (𝑆 D 𝐹) ⊆ (V × V))
13	11, 12	mpbir 234	1 ⊢ Rel (𝑆 D 𝐹)

This proof depends on syntax axioms:  ∀wral 3080  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048  𝒫 cpw 4560  {csn 4588  ∪ ciun 4956   ↦ cmpt 5192   × cxp 5656  dom cdm 5658  Rel wrel 5663  ‘cfv 6566  (class class class)co 7451   ↑_pm cpm 8886  ℂcc 11237   − cmin 11580   / cdiv 12013   ↾_t crest 17641  TopOpenctopn 17642  ℂ_fldccnfld 21729  intcnt 23390   lim_ℂ climc 26237   D cdv 26238

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-xp 5664  df-rel 5665  df-cnv 5666  df-dm 5668  df-rn 5669  df-iota 6520  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-dv 26242

This theorem is used by:  perfdvf  26278  dvres  26286  dvres3  26288  dvres3a  26289  dvidlem  26290  dvmulbr  26314  dvaddf  26317  dvmulf  26318  dvcobr  26321  dvcof  26323  dvcnv  26352