Theorem reldv 26097

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 5673	. . . . . . . 8 ⊢ Rel ({𝑥} × ((𝑧 ∈ (dom 𝑓 ∖ {𝑥}) ↦ (((𝑓‘𝑧) − (𝑓‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥))
2	1	rgenw 3080	. . . . . . 7 ⊢ ∀𝑥 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑠))‘dom 𝑓)Rel ({𝑥} × ((𝑧 ∈ (dom 𝑓 ∖ {𝑥}) ↦ (((𝑓‘𝑧) − (𝑓‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥))
3		reliun 5797	. . . . . . 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 5662	. . . . . 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 3080	. . . 4 ⊢ ∀𝑓 ∈ (ℂ ↑pm 𝑠)∪ 𝑥 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑠))‘dom 𝑓)({𝑥} × ((𝑧 ∈ (dom 𝑓 ∖ {𝑥}) ↦ (((𝑓‘𝑧) − (𝑓‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥)) ⊆ (V × V)
8	7	rgenw 3080	. . 3 ⊢ ∀𝑠 ∈ 𝒫 ℂ∀𝑓 ∈ (ℂ ↑pm 𝑠)∪ 𝑥 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑠))‘dom 𝑓)({𝑥} × ((𝑧 ∈ (dom 𝑓 ∖ {𝑥}) ↦ (((𝑓‘𝑧) − (𝑓‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥)) ⊆ (V × V)
9		df-dv 26094	. . . 4 ⊢ D = (𝑠 ∈ 𝒫 ℂ, 𝑓 ∈ (ℂ ↑pm 𝑠) ↦ ∪ 𝑥 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑠))‘dom 𝑓)({𝑥} × ((𝑧 ∈ (dom 𝑓 ∖ {𝑥}) ↦ (((𝑓‘𝑧) − (𝑓‘𝑥)) / (𝑧 − 𝑥))) limℂ 𝑥)))
10	9	ovmptss 8090	. . 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 5662	. 2 ⊢ (Rel (𝑆 D 𝐹) ↔ (𝑆 D 𝐹) ⊆ (V × V))
13	11, 12	mpbir 234	1 ⊢ Rel (𝑆 D 𝐹)

This proof depends on syntax axioms:  ∀wral 3076  Vcvv 3450   ∖ cdif 3896   ⊆ wss 3899  𝒫 cpw 4557  {csn 4584  ∪ ciun 4951   ↦ cmpt 5186   × cxp 5653  dom cdm 5655  Rel wrel 5660  ‘cfv 6533  (class class class)co 7413   ↑_pm cpm 8827  ℂcc 11122   − cmin 11465   / cdiv 11895   ↾_t crest 17505  TopOpenctopn 17506  ℂ_fldccnfld 21585  intcnt 23242   lim_ℂ climc 26089   D cdv 26090

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7736

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-1st 7986  df-2nd 7987  df-dv 26094

This theorem is used by:  perfdvf  26130  dvres  26138  dvres3  26140  dvres3a  26141  dvidlem  26142  dvmulbr  26166  dvaddf  26169  dvmulf  26170  dvcobr  26173  dvcof  26175  dvcnv  26204