Theorem fdmrn 6735

Description: A different way to write 𝐹 is a function. (Contributed by Thierry Arnoux, 7-Dec-2016.)

Assertion

Ref	Expression
fdmrn	⊢ (Fun 𝐹 ↔ 𝐹:dom 𝐹⟶ran 𝐹)

Proof of Theorem fdmrn

Step	Hyp	Ref	Expression
1		ssid 3967	. . 3 ⊢ ran 𝐹 ⊆ ran 𝐹
2		df-f 6538	. . 3 ⊢ (𝐹:dom 𝐹⟶ran 𝐹 ↔ (𝐹 Fn dom 𝐹 ∧ ran 𝐹 ⊆ ran 𝐹))
3	1, 2	mpbiran2 722	. 2 ⊢ (𝐹:dom 𝐹⟶ran 𝐹 ↔ 𝐹 Fn dom 𝐹)
4		eqid 2769	. . 3 ⊢ dom 𝐹 = dom 𝐹
5		df-fn 6537	. . 3 ⊢ (𝐹 Fn dom 𝐹 ↔ (Fun 𝐹 ∧ dom 𝐹 = dom 𝐹))
6	4, 5	mpbiran2 722	. 2 ⊢ (𝐹 Fn dom 𝐹 ↔ Fun 𝐹)
7	3, 6	bitr2i 279	1 ⊢ (Fun 𝐹 ↔ 𝐹:dom 𝐹⟶ran 𝐹)

Syntax hints:   ↔ wb 209   = wceq 1567   ⊆ wss 3913  dom cdm 5659  ran crn 5660  Fun wfun 6528   Fn wfn 6529  ⟶wf 6530

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-9 2159  ax-ext 2741

This theorem depends on definitions:  df-bi 210  df-an 401  df-ex 1807  df-cleq 2761  df-ss 3930  df-fn 6537  df-f 6538

This theorem is referenced by:  funcofd  6736  nvof1o  7276  usgrwwlks2on  30244  umgrwwlks2on  30245  rinvf1o  32912  smatrcl  34127  locfinref  34172  lfuhgr  35505  limccog  46223  funfocofob  47699  grimuhgr  48536  isuspgrim0lem  48542